How to solve combinatorial optimization problems using real quantum machines: A recent survey

S Heng, D Kim, T Kim, Y Han - IEEE Access, 2022 - ieeexplore.ieee.org
A combinatorial optimization problem (COP) is the problem of finding the optimal solution in
a finite set. When the size of the feasible solution set is large, the complexity of the problem …

Spin-variable reduction method for handling linear equality constraints in Ising machines

T Shirai, N Togawa - IEEE Transactions on Computers, 2023 - ieeexplore.ieee.org
We propose a spin-variable reduction method for Ising machines to handle linear equality
constraints in a combinatorial optimization problem. Ising machines including quantum …

Post-processing variational quantum algorithm for constrained combinatorial optimization problems

T Shirai, N Togawa - arxiv preprint arxiv:2309.08120, 2023 - arxiv.org
We propose post-processing variational quantum algorithm (pVQA) for solving constrained
combinatorial optimization problems (COPs). COPs are typically transformed into ground …

Post-processing variationally scheduled quantum algorithm for constrained combinatorial optimization problems

T Shirai, N Togawa - IEEE Transactions on Quantum …, 2024 - ieeexplore.ieee.org
In this article, we propose a postprocessing variationally scheduled quantum algorithm
(pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are …

DAS: A DRAM-Based Annealing System for Solving Large-Scale Combinatorial Optimization Problems

W Deng, Z Wang, Y Guo, J Zhang, Z Wu… - … Conference on Algorithms …, 2023 - Springer
As Moore's law approaches its inevitable end, the performance improvement of traditional
Von Neumann has encountered challenge. Some dedicated computing architecture for …