REVIEW 5 cited by
Runtime Quantum Advantage with Digital Quantum Optimization
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
Runtime Quantum Advantage with Digital Quantum Optimization
read the original abstract
We demonstrate experimentally that the bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm on IBM's 156-qubit devices can outperform simulated annealing (SA) and CPLEX in time-to-approximate solutions for specific higher-order unconstrained binary optimization (HUBO) problems. We suitably select problem instances that are challenging for classical methods, running in fractions of minutes even with multicore processors. On the other hand, our counterdiabatic quantum algorithms obtain similar or better results in at most a few seconds on quantum hardware, achieving runtime quantum advantage. Our analysis reveals that the performance improvement becomes increasingly evident as the system size grows. Given the rapid progress in quantum hardware, we expect that this improvement will become even more pronounced, potentially leading to a quantum advantage of several orders of magnitude. Our results indicate that available digital quantum processors, when combined with specific-purpose quantum algorithms, exhibit a runtime quantum advantage even in the absence of quantum error correction.
Forward citations
Cited by 5 Pith papers
-
AutoVerifier: An Agentic Automated Verification Framework Using Large Language Models
AutoVerifier decomposes technical claims into triples and uses layered LLM verification to assess validity, demonstrated on a quantum computing paper by finding overclaims and conflicts.
-
Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers
A warm-started XY-mixer aligned to a biased W-state, iterated via sample-based probability updates, raises optimal-solution sampling rates for one-hot constrained QAOA and finds optima on 144-qubit hardware with post-...
-
Simulated Bifurcation Quantum Annealing
SBQA adds inter-replica interactions to simulated bifurcation to mimic quantum tunneling and improves performance on sparse rugged optimization problems over standard SBM.
-
Recent quantum runtime (dis)advantages
End-to-end runtime definitions and strong classical baselines show that three recent quantum advantage claims in annealing, Simon's problem, and hybrid algorithms do not hold on NISQ hardware.
-
Quantum optimization beyond QUBO for industrial logistics and scheduling
HUBO formulations for logistics problems offer qubit savings over QUBO at the expense of higher circuit depth, validated classically and simulated quantumly for small cases.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.