Efficient Quantum Optimization via Dissipative False Vacuum Decay
Abstract
Efficient quantum solvers for computationally hard problems are highly desirable for near-term quantum platforms. Here, we propose a cavity-based dissipative quantum solver for a class of NP-hard combinatorial optimization problems encoded in atomic-spin Hamiltonians with a few discrete single-spin-flip transition energies. We show that the cavity-based quantum solver exploits dissipative false-vacuum decay in configuration space to facilitate escape from metastable local minima in rugged energy landscapes. Numerical studies of MaxCut and Maximum Independent Set identify favorable parameter regions for ground-state preparation. Based on the finite-size scalings of the median mixing time and instance-averaged ground-state preparation probability, we estimate time complexities for our solver that are more favorable than those of standard Grover search. These results highlight cavity dissipation as a controllable resource for quantum optimization.
Related
- Probing False Vacuum Decay on a Cold-Atom Gauge-Theory Quantum Simulator
- Scattering and induced false vacuum decay in the two-dimensional quantum Ising model
- Long-Lived False-vacuum-Trapped Self-Bound Neutron-rich Droplets
- Collision Dynamics of False-Vacuum Oscillons
- False-vacuum bubbles in sphaleron scattering
BibTeX
@misc{huang2026efficient,
title = {{Efficient Quantum Optimization via Dissipative False Vacuum Decay}},
author = {Zhi-Hao Huang and Tian-Mu Hu and Shuaifan Cao and Ye Lu and Xiaopeng Li},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.39266},
eprint = {2610.39266},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.39266},
}
RIS
TY - UNPB
TI - Efficient Quantum Optimization via Dissipative False Vacuum Decay
AU - Zhi-Hao Huang
AU - Tian-Mu Hu
AU - Shuaifan Cao
AU - Ye Lu
AU - Xiaopeng Li
PY - 2026
DA - 2026/10/29
PB - arXiv
DO - 10.48550/arxiv.2610.39266
UR - https://arxiv.org/abs/2610.39266
AB - Efficient quantum solvers for computationally hard problems are highly desirable for near-term quantum platforms. Here, we propose a cavity-based dissipative quantum solver for a class of NP-hard combinatorial optimization problems encoded in atomic-spin Hamiltonians with a few discrete single-spin-flip transition energies. We show that the cavity-based quantum solver exploits dissipative false-vacuum decay in configuration space to facilitate escape from metastable local minima in rugged energy landscapes. Numerical studies of MaxCut and Maximum Independent Set identify favorable parameter regions for ground-state preparation. Based on the finite-size scalings of the median mixing time and instance-averaged ground-state preparation probability, we estimate time complexities for our solver that are more favorable than those of standard Grover search. These results highlight cavity dissipation as a controllable resource for quantum optimization.
ER -