Quantum-enhanced Markov Chain Monte Carlo for systems larger than your Quantum Computer
Stuart Ferguson, Petros Wallden

TL;DR
This paper introduces CGQeMCMC, a framework that reduces quantum resource requirements for quantum-enhanced MCMC, enabling the analysis of larger systems with fewer qubits while maintaining quantum speedup.
Contribution
The authors develop a coarse graining approach for QeMCMC that significantly reduces the quantum hardware needed, making it feasible for near-term quantum devices.
Findings
Quantum speedup persists with only √n simulated qubits.
Advantage demonstrated with 6 qubits on a 36-spin system.
Framework adaptable to various hardware constraints.
Abstract
Quantum computers theoretically promise computational advantage in many tasks, but it is much less clear how such advantage can be maintained when using existing and near-term hardware that has limitations in the number and quality of its qubits. Layden et al. [Nature 619, 282 (2023)] proposed a promising application by introducing a Quantum-enhanced Markov Chain Monte Carlo (QeMCMC) approach to reduce the thermalization time required when sampling from hard probability distributions. In QeMCMC the size of the required quantum computer scales linearly with the problem, putting limitations on the sizes of systems that one can consider. In this work we introduce a framework to coarse grain the algorithm in such a way that the quantum computation can be performed using considerably smaller quantum computers and we term the method the Coarse Grained Quantum-enhanced Markov Chain Monte Carlo…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
