Succinct quantum proofs for properties of finite groups

The article considers a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-type proof. Specifically, we consider quantum proofs for properties of black-box groups, which are finite groups whose elements are encoded as strings of a given length and whose group operations are performed by a group oracle. We prove that for an arbitrary group oracle, there exist succinct (polynomial-length) quantum proofs for the Group Non-Membership problem that can be checked with small error in polynomial time on a quantum computer. Classically, this is impossible; it is proved that there exists a group oracle, relative to which this problem does not have succinct proofs that can be checked classically with bounded error in polynomial time (i.e., the problem is not in MA relative to the group oracle constructed). By considering a certain subproblem of the Group Non-Membership problem, we obtain a simple proof that there exists an oracle relative to which BQP is not contained in MA. Finally, we show that quantum proofs for non-membership and classical proofs for various other group properties can be combined to yield succinct quantum proofs for other group properties not having succinct proofs in the classical setting, such as verifying that a number divides the order of a group and verifying that a group is not a simple group.

[1]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[2]  László Babai,et al.  Randomization in group algorithms: Conceptual questions , 1995, Groups and Computation.

[3]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[4]  S. Braunstein,et al.  Quantum computation , 1996 .

[5]  Lance Fortnow,et al.  Complexity limitations on quantum computation , 1999, J. Comput. Syst. Sci..

[6]  Stathis Zachos,et al.  Probabilistic Quantifiers and Games , 1988, J. Comput. Syst. Sci..

[7]  E. Knill.  Quantum Randomness and Nondeterminism , 1996 .

[8]  Ronald de Wolf,et al.  Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity , 2000, CCC.

[9]  Vikraman Arvind,et al.  Solvable Black-Box Group Problems Are Low for PP , 1996, STACS.

[10]  Leonard M. Adleman,et al.  Quantum Computability , 1997, SIAM J. Comput..

[11]  A. Kitaev.  Quantum computations: algorithms and error correction , 1997 .

[12]  Stephen A. Fenner,et al.  Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy , 1998, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[13]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[14]  C. Sims.  Computational methods in the study of permutation groups , 1970 .

[15]  R. Cleve.  An Introduction to Quantum Complexity Theory , 1999, quant-ph/9906111.

[16]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

[17]  I. Isaacs.  Algebra, a graduate course , 1994 .

[18]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[19]  P. Oscar Boykin,et al.  On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

[21]  László Babai.  Bounded Round Interactive Proofs in Finite Groups , 1992, SIAM J. Discret. Math..

[22]  L. Babai,et al.  Groups St Andrews 1997 in Bath, I: A polynomial-time theory of black box groups I , 1999 .

[23]  Alexei Y. Kitaev,et al.  Parallelization, amplification, and exponential time simulation of quantum interactive proof systems , 2000, STOC '00.

[24]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

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

[26]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[27]  John Watrous,et al.  PSPACE has constant-round quantum interactive proof systems , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).