Quantum Searches in a Hard 2SAT Ensemble
Neuhaus Thomas

TL;DR
This study investigates quantum annealing performance on a hard 2SAT ensemble, revealing exponential divergence of gap correlation length and run time, with classical annealing outperforming quantum methods in this context.
Contribution
The paper provides the first detailed analysis of quantum annealing on a specifically constructed hard 2SAT ensemble, highlighting the absence of quantum speedup and characterizing the gap distribution.
Findings
Quantum gap correlation length diverges exponentially with problem size.
Classical annealing finds solutions exponentially faster than quantum annealing.
Gap distribution functions exhibit Weibull-like behavior with thin catastrophic tails.
Abstract
Using a recently constructed ensemble of hard 2SAT realizations, that has a unique ground-state we calculate for the quantized theory the median gap correlation length values along the direction of the quantum adiabatic control parameter . We use quantum annealing (QA) with transverse field and a linear time schedule in the adiabatic control parameter . The gap correlation length diverges exponentially in the median with a rate constant , while the run time diverges exponentially with . Simulated classical annealing (SA) exhibits a run time rate constant that is small and thus finds ground-states exponentially faster than QA. There are no quantum speedups in ground state searches on constant…
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 · Neural Networks and Reservoir Computing
