GPU-based quantum-annealing-inspired algorithms outperform both quantum processors and industry classical solvers in sampling speed and full runtime on MO-MaxCut instances.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Objective Optimization by Quantum-Annealing-Inspired Algorithms
GPU-based quantum-annealing-inspired algorithms outperform both quantum processors and industry classical solvers in sampling speed and full runtime on MO-MaxCut instances.