Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Slack-Free Deep-Unfolded Combinatorial Optimization Solver for Inequality Constraints
Ryo Hagiwara, Shunta Arai, Satoshi Takabe
Quantum annealing (QA) is used to solve combinatorial optimization problems (COPs). When COPs are implemented on quantum annealers, they are typically encoded as quadratic unconstr…
quant-ph2025
Transfer Learning for Deep-Unfolded Combinatorial Optimization Solver with Quantum Annealer
Ryo Hagiwara, Shunta Arai, Satoshi Takabe
Quantum annealing (QA) has attracted research interest as a sampler and combinatorial optimization problem (COP) solver. A recently proposed sampling-based solver for QA significan…
quant-ph2024
Deep Unfolded Local Quantum Annealing
Shunta Arai, Satoshi Takabe
Local quantum annealing (LQA), an iterative algorithm, is designed to solve combinatorial optimization problems. It draws inspiration from QA, which utilizes adiabatic time evoluti…