Bounding speedup of quantum-enhanced Markov chain Monte Carlo
Abstract: Sampling tasks are a natural class of problems for quantum computers due to the probabilistic nature of the Born rule. Sampling from useful distributions on noisy quantum hardware remains a challenging problem. A paper [Layden, D. et al. Nature 619, 282-287 (2023)] proposed a quantum-enhanced Markov chain Monte Carlo algorithm where moves are generated by a quantum device and accepted or rejected by a classical algorithm. While this procedure is robust to noise and control imperfections, its potential for quantum advantage is unclear. Here we show that there is no speedup over classical sampling on a worst-case unstructured sampling problem. We present an upper bound to the Markov gap that rules out a speedup for any unital quantum proposal.
- Computational advantage of quantum random sampling. Reviews of Modern Physics 95, 035001 (2023).
- Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505–510 (2019).
- Zhong, H.-S. et al. Quantum computational advantage using photons. Science 370, 1460–1463 (2020).
- Wu, Y. et al. Strong quantum computational advantage using a superconducting quantum processor. Physical review letters 127, 180501 (2021).
- Zhong, H.-S. et al. Phase-programmable gaussian boson sampling using stimulated squeezed light. Physical review letters 127, 180502 (2021).
- Zhu, Q. et al. Quantum computational advantage via 60-qubit 24-cycle random circuit sampling. Science bulletin 67, 240–245 (2022).
- Madsen, L. S. et al. Quantum computational advantage with a programmable photonic processor. Nature 606, 75–81 (2022).
- Szegedy, M. Quantum speed-up of Markov chain based algorithms. In 45th Annual IEEE Symposium on Foundations of Computer Science, 32–41 (2004).
- Quantum simulations of classical annealing processes. Physical review letters 101, 130504 (2008).
- Speedup via quantum sampling. Physical Review A 78, 042336 (2008).
- Sampling from the thermal quantum gibbs state and evaluating partition functions with a quantum computer. Physical review letters 103, 220502 (2009).
- Preparing thermal states of quantum systems by dimension reduction. Physical review letters 105, 170405 (2010).
- Quantum metropolis sampling. Nature 471, 87–90 (2011).
- A quantum–quantum metropolis algorithm. Proceedings of the National Academy of Sciences 109, 754–759 (2012).
- Montanaro, A. Quantum speedup of Monte Carlo methods. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 471, 20150301 (2015).
- Quantum algorithms for gibbs sampling and hitting-time estimation. arXiv preprint arXiv:1603.02940 (2016).
- Adaptive quantum simulated annealing for Bayesian inference and estimating partition functions. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 193–212 (SIAM, 2020).
- Efficient quantum walk circuits for Metropolis-Hastings algorithm. Quantum 4, 287 (2020).
- Simpler (classical) and faster (quantum) algorithms for Gibbs partition functions. Quantum 6, 789 (2022).
- Thermal state preparation via rounding promises. Quantum 7, 1132 (2023).
- An efficient and exact noncommutative quantum gibbs sampler. arXiv preprint arXiv:2311.09207 (2023).
- Quantum sampling algorithms for near-term devices. Physical Review Letters 127, 100504 (2021).
- Quantum sampling algorithms, phase transitions, and computational complexity. Physical Review A 104, 032602 (2021).
- Layden, D. et al. Quantum-enhanced markov chain monte carlo. Nature 619, 282–287 (2023).
- Dissipative quantum gibbs sampling. arXiv preprint arXiv:2304.04526 (2023).
- Single-ancilla ground state preparation via lindbladians (2023). arXiv preprint arXiv:2308.15676 .
- Markov chains and mixing times, vol. 107 (American Mathematical Soc., 2017).
- Berestycki, N. Mixing times of Markov chains: Techniques and examples. Alea-Latin American Journal of Probability and Mathematical Statistics (2016).
- Unital quantum channels –convex structure and revivals of birkhoff’s theorem. Communications in Mathematical Physics 289, 1057–1086 (2009).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
