Unraveling the origin of higher success probabilities in quantum versus semi-classical annealing
Elias Starchl, Helmut Ritsch

TL;DR
This paper demonstrates that full quantum models of annealing outperform semi-classical approximations in finding optimal solutions, highlighting the importance of entanglement and quantum effects in complex optimization tasks.
Contribution
The study provides evidence that quantum annealing can significantly surpass semi-classical methods in success probability and efficiency, especially in complex bosonic systems with long-range interactions.
Findings
Quantum models achieve higher success probabilities than semi-classical approximations.
Entanglement plays a crucial role in reaching near-optimal solutions.
Reduced Hilbert spaces can sometimes improve short-time simulation success.
Abstract
Quantum annealing aims at finding optimal solutions to complex optimization problems using a suitable quantum many body Hamiltonian encoding the solution in its ground state. To find the solution one typically evolves the ground state of a soluble initial Hamiltonian adiabatically to the ground state of the designated final Hamiltonian. Here we explore whether and when a full quantum representation of the dynamics leads to higher probability to end up in the desired ground when compared to a classical mean field approximation. As simple, nontrivial example we target the ground state of interacting bosons trapped in a tight binding lattice with small local defect by turning on long range interactions. Already two atoms in four sites interacting via two cavity modes prove complex enough to exhibit significant differences between the full quantum model and a mean field approximation for…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
