Property testing for cyclic groups and beyond

This paper studies the problem of testing if an input (Γ,∘), where Γ is a finite set of unknown size and ∘ is a binary operation over Γ given as an oracle, is close to a specified class of groups. Friedl et al. (Proc. of STOC, 2005) have constructed an efficient tester using poly(log|Γ|) queries for the class of abelian groups. We focus in this paper on subclasses of abelian groups, and show that these problems are much harder: Ω(|Γ|1/6) queries are necessary to test if the input is close to a cyclic group, and Ω(|Γ|c) queries for some constant c are necessary to test more generally if the input is close to an abelian group generated by k elements, for any fixed integer k≥1. We also show that knowledge of the size of the ground set Γ helps only for k=1, in which case we construct an efficient tester using poly(log|Γ|) queries; for any other value k≥2 the query complexity remains Ω(|Γ|c). All our upper and lower bounds hold for both the edit distance and the Hamming distance. These are, to the best of our knowledge, the first nontrivial lower bounds for such group-theoretic problems in the property testing model and, in particular, they imply the first exponential separations between the classical and quantum query complexities of testing closeness to classes of groups.

[1]  V. Rich.  Personal communication , 1989, Nature.

[2]  Artur Czumaj,et al.  Sublinear-Time Algorithms , 2006, Bull. EATCS.

[3]  Miklos Santha,et al.  Efficient testing of groups , 2005, STOC '05.

[4]  Ronitt Rubinfeld,et al.  Spot-Checkers , 2000, J. Comput. Syst. Sci..

[5]  Yuichi Yoshida,et al.  On the distance between non-isomorphic groups , 2012, Eur. J. Comb..

[6]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

[7]  Ronitt Rubinfeld,et al.  Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions , 2008, Random Struct. Algorithms.

[8]  Avi Wigderson,et al.  Derandomizing homomorphism testing in general groups , 2004, STOC '04.

[9]  Ronitt Rubinfeld,et al.  Spot-checkers , 1998, STOC '98.

[10]  Gábor Ivanyos,et al.  Classical and quantum algorithms for algebraic problems , 2007 .

[11]  Yuichi Yoshida,et al.  Property Testing for Cyclic Groups and Beyond , 2011, COCOON.

[12]  Richard Cleve,et al.  The query complexity of order-finding , 1999, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[13]  Dana Ron,et al.  Property Testing , 2000 .

[14]  Michele Mosca,et al.  Decomposing finite Abelian groups , 2001, Quantum Inf. Comput..

[15]  François Le Gall,et al.  Quantum Property Testing of Group Solvability , 2008, LATIN.

[16]  Endre Szemerédi,et al.  On the Complexity of Matrix Group Problems I , 1984, FOCS.

[17]  SRIDHAR RAJAGOPALAN,et al.  Verification of Identities , 2000, SIAM J. Comput..

[18]  Frédéric Magniez,et al.  Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey , 2000, Theoretical Aspects of Computer Science.

[19]  Wieb Bosma,et al.  Algorithmic Number Theory , 2000, Lecture Notes in Computer Science.

[20]  László Babai,et al.  Local expansion of vertex-transitive graphs and random generation in finite groups , 1991, STOC '91.