IEEE International Conference on Quantum Computing and Engineering (QCE)
Multi-Stage Quantum Walk for Constrained Combinatorial Optimization with Equality Constraints
T Hattori, Paul A. Warburton, Shu Tanaka
Abstract
Multi-stage quantum walks (MSQW) are a promising near-term quantum algorithm. Although studies on MSQW have recently been cultivated, there is still limited evidence regarding their effectiveness for constrained combinatorial optimization problems (COPs). This study applied methods proposed in previous studies, which restrict the quantum state to a feasible space and are effective for quantum annealing, to MSQW. As a result, we reveal that the proposed method has the potential to efficiently solve constrained COPs compared to penalty-based naive formulations.