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.
Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
verdicts
UNVERDICTED 3representative citing papers
An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.
Review of quantum computing methods and potential for non-ground-state quantum chemistry including reaction dynamics, mechanisms, and finite temperatures.
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.
-
An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics
An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.