2 papers
quant-ph2026
Efficient Simulation of Szegedy Quantum Walk Formulations and Algorithms
Sergio A. Ortega, Daniel K. Park
Quantum walks provide a versatile framework for quantum algorithms across a wide range of applications. We develop efficient classical simulation methods for Szegedy quantum walks…
quant-ph2026
Finite Imaginary-Time Evolution for Polynomial Unconstrained Binary Optimization
Jaehee Kim, Juhyeon Kim, Gwonhak Lee +4
Imaginary-time evolution is a standard primitive for ground-state preparation but is nonunitary, precluding direct quantum implementation. We develop Finite Imaginary-Time Evolutio…