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
2 Pith papers cite this work. Polarity classification is still indexing.
fields
quant-ph 2years
2025 2representative citing papers
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.
-
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.