Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Iterative warm-start optimization with quantum imaginary time evolution
Phillip C. Lotshaw, Titus Morris, Stuart Hadfield +1
Approximate combinatorial optimization is a promising use case for quantum computers. The quantum optimization algorithms often employ a fixed ansatz that evolves an unbiased initi…
quant-ph2024
Performant near-term quantum combinatorial optimization
Titus D. Morris, Ananth Kaushik, Martin Roetteler +1
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an imp…
quant-ph2024
Ancillary entangling Floquet kicks for accelerating quantum algorithms
C. -C. Joseph Wang, Phillip C. Lotshaw, Titus Morris +3
Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the sys…