2 papers
quant-ph2025
Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz
Zichang He, Rudy Raymond, Ruslan Shaydulin +1
Solving hard optimization problems is one of the most promising application domains for quantum computers due to the ubiquity of such problems in industry and the availability of b…
quant-ph2025
Recursive Quantum Relaxation for Combinatorial Optimization Problems
Ruho Kondo, Yuki Sato, Rudy Raymond +1
Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attribute…