REVIEW 3 cited by
Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
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
read the original abstract
We explain why quantum adiabatic evolution and simulated annealing perform similarly in certain examples of searching for the minimum of a cost function of n bits. In these examples each bit is treated symmetrically so the cost function depends only on the Hamming weight of the n bits. We also give two examples, closely related to these, where the similarity breaks down in that the quantum adiabatic algorithm succeeds in polynomial time whereas simulated annealing requires exponential time.
Forward citations
Cited by 3 Pith papers
-
Log-concavity and tunneling: adiabatic quantum optimization for convex functions (with a spike)
Establishes discrete log-concavity of ground states for convex potentials and extends Reichardt's HWS tunneling analysis to quadratic spikes via new spectral gap bounds.
-
Improving adiabatic quantum factorization via chopped random-basis optimization
Applying CRAB schedule optimization to adiabatic factorization Hamiltonians raises final-state fidelity for integers 21 to 2479, with a performance threshold near the quantum speed limit, and the improvement survives ...
-
Designing Minimalistic Variational Quantum Ansatz Inspired by Algorithmic Cooling
The paper introduces the Heat Exchange (HE) ansatz, a variational circuit built from XX+YY interactions with bath qubits, and reports improved MaxCut approximations and sub-1% Heisenberg ground-state errors in small n...
Discussion (0). Continue with ORCID to comment.