REVIEW 1 cited by
Tighter Lower Bounds on Quantum Annealing Times
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We derive lower bounds on the time needed for a quantum annealer to prepare the ground state of a target Hamiltonian. These bounds do not depend on the annealing schedule and can take the local structure of the Hamiltonian into account. Consequently, the bounds are computable without knowledge of the annealer's dynamics and, in certain cases, scale with the size of the system. We discuss spin systems where the bounds are polynomially tighter than existing bounds, qualitatively capturing the scaling of the exact annealing times as a function of the number of spins.
Forward citations
Cited by 1 Pith paper
-
Boosting quantum annealing performance through direct polynomial unconstrained binary optimization
For 3-SAT problems, direct PUBO encoding shows larger minimum energy gaps than a standard QUBO reduction, hinting at an exponential speedup for some problem families.
Discussion (0). Continue with ORCID to comment.