Adiabatic quantum state generation and statistical zero knowledge

The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'.We first show that any problem in Statistical Zero Knowledge (including eg. discrete log, quadratic residuosity and gap closest vector in a lattice) can be reduced to an instance of the quantum state generation problem. Having shown the generality of the state generation problem, we set the foundations for a new paradigm for quantum state generation. We define 'Adiabatic State Generation' (ASG), which is based on Hamiltonians instead of unitary gates. We develop tools for ASG including a very general method for implementing Hamiltonians (The sparse Hamiltonian lemma), and ways to guarantee non negligible spectral gaps (The jagged adiabatic path lemma). We also prove that ASG is equivalent in power to state generation in the standard quantum model. After setting the foundations for ASG, we show how to apply our techniques to generate interesting superpositions related to Markov chains.The ASG approach to quantum algorithms provides intriguing links between quantum computation and many different areas: the analysis of spectral gaps and groundstates of Hamiltonians in physics, rapidly mixing Markov chains, statistical zero knowledge, and quantum random walks. We hope that these links will bring new insights and methods into quantum algorithms.

[1]  O. Hudry.  R. L. Graham, M. Grötschel, L. Lovasz (sous la direction de), "Handbook of combinatorics", Amsterdam, North-Holland, 1995 (2 volumes) , 2000 .

[2]  Alexander Elgart,et al.  The Adiabatic Theorem of Quantum Mechanics , 1998 .

[3]  Edward Farhi,et al.  Finding cliques by quantum adiabatic evolution , 2002, Quantum Inf. Comput..

[4]  E. Farhi,et al.  Quantum Adiabatic Evolution Algorithms with Different Paths , 2002, quant-ph/0208135.

[5]  E. Farhi,et al.  A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem , 2001, Science.

[6]  Andrew M. Childs,et al.  Quantum search by measurement , 2002, quant-ph/0204013.

[7]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[8]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[9]  J. E. Avron,et al.  Adiabatic Theorem without a Gap Condition , 1999 .

[10]  David Applegate,et al.  Sampling and integration of near log-concave functions , 1991, STOC '91.

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

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

[13]  A. Messiah.  Quantum Mechanics , 1961 .

[14]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[15]  Oded Goldreich,et al.  On the Limits of Nonapproximability of Lattice Problems , 2000, J. Comput. Syst. Sci..

[16]  Yaoyun Shi.  Both Toffoli and controlled-NOT need little help to do universal quantum computing , 2003, Quantum Inf. Comput..

[17]  N. Mermin.  Quantum theory: Concepts and methods , 1997 .

[18]  N. Cerf,et al.  Quantum search by local adiabatic evolution , 2001, quant-ph/0107015.

[19]  D. Aharonov.  A Simple Proof that Toffoli and Hadamard are Quantum Universal , 2003, quant-ph/0301040.

[20]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

[21]  Wolfgang L Spitzer,et al.  Improved Bounds on the Spectral Gap Above Frustration-Free Ground States of Quantum Spin Chains , 2002 .

[22]  Lov K. Grover,et al.  Creating superpositions that correspond to efficiently integrable probability distributions , 2002, quant-ph/0208112.

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

[24]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[25]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[26]  Amit Sahai,et al.  Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge , 1998, STOC '98.

[27]  Sean Hallgren,et al.  Efficient Quantum Algorithms for Shifted Quadratic Character Problems , 2000, ArXiv.

[28]  Umesh V. Vazirani,et al.  How powerful is adiabatic quantum computation? , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[29]  Martin E. Dyer,et al.  Faster random generation of linear extensions , 1999, SODA '98.

[30]  László Lovász,et al.  Random Walks on Graphs: A Survey , 1993 .

[31]  Mark Jerrum,et al.  The Markov chain Monte Carlo method: an approach to approximate counting and integration , 1996 .

[32]  Amit Sahai,et al.  A complete promise problem for statistical zero-knowledge , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[33]  Edward Farhi,et al.  An Example of the Difference Between Quantum and Classical Random Walks , 2002, Quantum Inf. Process..

[34]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

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

[36]  Howard E. Brandt,et al.  Quantum computation and information : AMS Special Session Quantum Computation and Information, January 19-21, 2000, Washington, D.C. , 2002 .

[37]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries , 2004, JACM.

[38]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[39]  Oded Goldreich,et al.  On the limits of non-approximability of lattice problems , 1998, STOC '98.

[40]  Edward Farhi,et al.  A Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for Satisfiability , 2000, ArXiv.

[41]  M. Sipser,et al.  Quantum Computation by Adiabatic Evolution , 2000, quant-ph/0001106.

[42]  Sean Hallgren,et al.  Polynomial-time quantum algorithms for Pell's equation and the principal ideal problem , 2002, STOC '02.

[43]  Scott Aaronson,et al.  Quantum lower bound for the collision problem , 2001, STOC '02.

[44]  Dorit Aharonov,et al.  A lattice problem in quantum NP , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..