An iterative nonvariational quantum algorithm using warm-start states and classically computed imaginary time evolution circuits achieves median solutions within 95% of optimal for MaxCut on small 3-regular graphs using only 100 shots, outperforming random and basic classical searches.
Challenges and opportunities in quantum optimization
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
-
Iterative warm-start optimization with quantum imaginary time evolution
An iterative nonvariational quantum algorithm using warm-start states and classically computed imaginary time evolution circuits achieves median solutions within 95% of optimal for MaxCut on small 3-regular graphs using only 100 shots, outperforming random and basic classical searches.