Interactive Proofs with Polynomial-Time Quantum Prover for Computing the Order of Solvable Groups

In this paper we consider what can be computed by a user interacting with a potentially malicious server, when the server performs polynomial-time quantum computation but the user can only perform polynomial-time classical (i.e., non-quantum) computation. Understanding the computational power of this model, which corresponds to polynomial-time quantum computation that can be efficiently verified classically, is a well-known open problem in quantum computing. Our result shows that computing the order of a solvable group, which is one of the most general problems for which quantum computing exhibits an exponential speed-up with respect to classical computing, can be realized in this model.

[1]  I. Isaacs,et al.  Finite Group Theory , 2008 .

[2]  John Watrous,et al.  Succinct quantum proofs for properties of finite groups , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[3]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[4]  Tomoyuki Morimae,et al.  Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy , 2017, Quantum.

[5]  Shafi Goldwasser,et al.  Pseudo-deterministic Proofs , 2017, Electron. Colloquium Comput. Complex..

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

[7]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[8]  László Babai,et al.  Fast Monte Carlo Algorithms for Permutation Groups , 1995, J. Comput. Syst. Sci..

[9]  Matthew McKague,et al.  Interactive proofs with efficient quantum prover for recursive Fourier sampling , 2010, Chic. J. Theor. Comput. Sci..

[10]  Simon R. Blackburn,et al.  Enumeration of Finite Groups , 2007 .

[11]  John Watrous,et al.  Quantum algorithms for solvable groups , 2000, STOC '01.

[12]  Yaoyun Shi.  Quantum and classical tradeoffs , 2005, Theor. Comput. Sci..

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

[14]  Urmila Mahadev,et al.  Classical Verification of Quantum Computations , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[15]  László Babai,et al.  Polynomial-time theory of matrix groups , 2009, STOC '09.

[16]  Oron Shagrir,et al.  Is Quantum Mechanics Falsifiable? A Computational Perspective on the Foundations of Quantum Mechanics , 2013 .

[17]  E. O'Brien,et al.  Handbook of Computational Group Theory , 2005 .

[18]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[19]  Tomoyuki Morimae,et al.  Quantum proofs can be verified using only single qubit measurements , 2015, ArXiv.

[20]  Umesh V. Vazirani,et al.  Classical command of quantum systems , 2013, Nature.

[21]  Greg Kuperberg,et al.  Quantum versus Classical Proofs and Advice , 2006, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[22]  今井 浩.  20世紀の名著名論：Peter Shor : Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 2004 .

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

[24]  E. Kashefi,et al.  Unconditionally verifiable blind computation , 2012 .

[25]  Matthew McKague,et al.  Interactive Proofs for BQP via Self-Tested Graph States , 2013, Theory Comput..

[26]  Joseph Fitzsimons,et al.  Classical verification of quantum circuits containing few basis changes , 2016, ArXiv.

[27]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[28]  Joseph Fitzsimons,et al.  Post hoc verification of quantum computation , 2015, Physical review letters.

[29]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[30]  Zhengfeng Ji.  Classical Verification of Quantum Proofs , 2019, Theory Comput..

[31]  Frédéric Magniez,et al.  Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem , 2001, SPAA '01.

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

[33]  Masahito Hayashi,et al.  Verifiable Measurement-Only Blind Quantum Computing with Stabilizer Testing. , 2015, Physical review letters.