3 papers
quant-ph2026
A reduction scheme for general-order Ising-like Hamiltonians in quantum heuristic solvers
Chengsi Mao, Pavel Mosharev, Yao Wang +1
The Ising model is ubiquitous in various optimization problems but notoriously difficult to solve due to combinatorial explosion. In view of this, Hamiltonian reduction is a useful…
quant-ph2025
Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits
Xuhao Zhu, Zuoheng Zou, Feitong Jin +31
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problem…
cs.DS2025
Cost-driven prunings for iterative solving of constrained routing problem with SRLG-disjoint protection
P. A. Mosharev, Choon-Meng Lee, Xu Shu +2
The search for the optimal pair of active and protection paths in a network with Shared Risk Link Groups (SRLG) is a challenging but high-value problem in the industry that is inev…