Journal
PHYSICAL REVIEW A
Volume 80, Issue 2, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.80.022340
Keywords
-
Categories
Funding
- NSF [CCF-0726771, CCF-0746600]
- QAP [2004-IST-FETPI-15848]
- Slovak Research and Development Agency [APVV-0673-07]
Ask authors/readers for more resources
We present a quantum algorithm based on classical fully polynomial randomized approximation schemes (FPRASs) for estimating partition functions that combine simulated annealing with the Monte Carlo Markov chain method and use nonadaptive cooling schedules. We achieve a twofold polynomial improvement in time complexity: a quadratic reduction with respect to the spectral gap of the underlying Markov chains and a quadratic reduction with respect to the parameter characterizing the desired accuracy of the estimate output by the FPRAS. Both reductions are intimately related and cannot be achieved separately. First, we use Grover's fixed-point search, quantum walks, and phase estimation to efficiently prepare approximate coherent encodings of stationary distributions of the Markov chains. The speed up we obtain in this way is due to the quadratic relation between the spectral and phase gaps of classical and quantum walks. The second speed up with respect to accuracy comes from generalized quantum counting used instead of classical sampling to estimate expected values of quantum observables.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available