Speedup via quantum sampling

The Markov Chain Monte Carlo method is at the heart of efficientapproximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether quantum computers can speed-up classical mixing processes based on Markov chains. To this end, we present a new quantum algorithm, making it possible to prepare a quantum sample, i.e., a coherent version of the stationary distribution of a reversible Markov chain. Our algorithm has a significantly better running time than that of a previous algorithm based on adiabatic state generation. We also show that our methods provide a speed-up over a recently proposed method for obtaining ground states of (classical) Hamiltonians.

[1]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[2]  M. Luby,et al.  Polytopes, permanents and graphs with large factors , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[3]  Mark Jerrum,et al.  Approximating the Permanent , 1989, SIAM J. Comput..

[4]  Martin E. Dyer,et al.  A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.

[5]  Martin E. Dyer,et al.  A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies , 1989, STOC.

[6]  Mark Jerrum,et al.  Polynomial-Time Approximation Algorithms for the Ising Model , 1990, SIAM J. Comput..

[7]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[8]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

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

[10]  M. Jerrum.  Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[11]  Amnon Ta-Shma,et al.  Adiabatic quantum state generation and statistical zero knowledge , 2003, STOC '03.

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

[13]  M. Szegedy,et al.  Quantum Walk Based Search Algorithms , 2008, TAMC.

[14]  Lov K. Grover,et al.  Fixed-point quantum search. , 2005, Physical review letters.

[15]  Peter Høyer.  The Phase Matrix , 2005, ISAAC.

[16]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .

[17]  Lov K. Grover.  A different kind of quantum search , 2005, quant-ph/0503205.

[18]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[19]  Frédéric Magniez,et al.  Search via quantum walk , 2006, STOC '07.

[20]  Peter C. Richter.  Quantum speedup of classical mixing processes , 2006, quant-ph/0609204.

[21]  Peter C. Richter.  Almost uniform sampling via quantum walks , 2006, quant-ph/0606202.

[22]  H. Barnum,et al.  Quantum Simulated Annealing , 2007, 0712.1008.

[23]  E. Knill,et al.  Quantum simulations of classical annealing processes. , 2008, Physical review letters.

[24]  F. Jotzo,et al.  Double counting and the Paris Agreement rulebook , 2019, Science.