14 citations · 19 across the 4 of their papers we have counts for
4 papers
Evaluating the solution performance of the augmented Lagrangian function on Ising machines
Shunsuke Awai, Takuro Itoh, Keita Takahashi +2
We apply the augmented Lagrangian function (ALF) as a formulation for Ising machines and evaluate its performance by time-to-epsilon (\mathrm{TT\varepsilon}). The ALF has been well…
Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka
In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solv…
Quick design of feasible tensor networks for constrained combinatorial optimization
Hyakka Nakada, Kotaro Tanahashi, Shu Tanaka
Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent th…
Annealing-Assisted Column Generation for Inequality-Constrained Combinatorial Optimization Problems
Hiroshi Kanai, Masashi Yamashita, Kotaro Tanahashi +1
Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in pra…