Quantum Testers for Hidden Group Properties

We construct efficient or query efficient quantum property testers for two existential group properties which have exponential query complexity both for their decision problem in the quantum and for their testing problem in the classical model of computing. These are periodicity in groups and the common coset range property of two functions having identical ranges within each coset of some normal subgroup. Our periodicity tester is efficient in Abelian groups and generalizes, in several aspects, previous periodicity testers. This is achieved by introducing a technique refining the majority correction process widely used for proving robustness of algebraic properties. The periodicity tester in non-Abelian groups and the common coset range tester are query efficient.

[1]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[2]  Ronitt Rubinfeld.  On the Robustness of Functional Equations , 1999, SIAM J. Comput..

[3]  GoldreichOded,et al.  Property testing and its connection to learning and approximation , 1998 .

[4]  Jean-Pierre Serre,et al.  Linear representations of finite groups , 1977, Graduate texts in mathematics.

[5]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Lisa R. Hales.  The quantum fourier transform and extensions of the abelian hidden subgroup problem , 2002 .

[7]  Daniel R. Simon.  On the Power of Quantum Computation , 1997, SIAM J. Comput..

[8]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[9]  Mark Ettinger,et al.  On Quantum Algorithms for Noncommutative Hidden Subgroups , 2000, Adv. Appl. Math..

[10]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[11]  Alexander Russell,et al.  Normal subgroup reconstruction and quantum computation using group representations , 2000, STOC '00.

[12]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[13]  L. Fortnow,et al.  Quantum property testing , 2002, SODA '03.

[14]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[15]  Umesh V. Vazirani,et al.  Quantum mechanical algorithms for the nonabelian hidden subgroup problem , 2001, STOC '01.

[16]  Frédéric Magniez,et al.  Hidden translation and orbit coset in quantum computing , 2002, STOC '03.

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

[18]  Eleanor G. Rieffel,et al.  J an 2 00 0 An Introduction to Quantum Computing for Non-Physicists , 2002 .

[19]  David P. DiVincenzo,et al.  Quantum information and computation , 2000, Nature.

[20]  Sean Hallgren,et al.  An improved quantum Fourier transform algorithm and applications , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

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

[22]  RieffelEleanor,et al.  An introduction to quantum computing for non-physicists , 2000 .

[23]  Dana Ron,et al.  Property Testing in Bounded Degree Graphs , 1997, STOC.

[24]  Manuel Blum,et al.  Designing programs that check their work , 1989, STOC '89.

[25]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[26]  Oded Goldreich,et al.  Combinatorial property testing (a survey) , 1997, Randomization Methods in Algorithm Design.

[27]  Frédéric Magniez,et al.  Self-testing of universal and fault-tolerant sets of quantum gates , 2000, STOC '00.

[28]  Andrew Chi-Chih Yao,et al.  Quantum cryptography with imperfect apparatus , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).