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.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
fields
quant-ph 4years
2025 4representative citing papers
Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up to 156 qubits, with hardware runs confirming gains up to p=10.
DC-QAOA with CD-mixer ansatz outperforms QAOA for 1d bin packing, showing robustness and high accuracy on a 10-item instance executed on IBM quantum hardware.
VeloxQ is a classical QUBO solver that reports competitive or superior performance and unique scalability to 10^8-variable sparse instances across benchmarks against quantum annealers, physics-inspired methods, and conventional solvers.
citing papers explorer
-
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.
-
Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up to 156 qubits, with hardware runs confirming gains up to p=10.
-
Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem
DC-QAOA with CD-mixer ansatz outperforms QAOA for 1d bin packing, showing robustness and high accuracy on a 10-item instance executed on IBM quantum hardware.
-
VeloxQ: A Fast and Efficient QUBO Solver
VeloxQ is a classical QUBO solver that reports competitive or superior performance and unique scalability to 10^8-variable sparse instances across benchmarks against quantum annealers, physics-inspired methods, and conventional solvers.