Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems
In this article, we propose a postprocessing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-based quantum device. V...
Main Authors: | Tatsuhiko Shirai, Nozomu Togawa |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10472069/ |
Similar Items
-
Ising Machine Approach to the Lecturer–Student Assignment Problem
by: Sora Tomita, et al.
Published: (2024-01-01) -
Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent
by: Xin Yi, et al.
Published: (2024-01-01) -
A GPU-Based Ising Machine With a Multi-Spin-Flip Capability for Constrained Combinatorial Optimization
by: Satoru Jimbo, et al.
Published: (2024-01-01) -
How to Solve Combinatorial Optimization Problems Using Real Quantum Machines: A Recent Survey
by: Sovanmonynuth Heng, et al.
Published: (2022-01-01) -
Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
by: Xiaoyuan Liu, et al.
Published: (2022-01-01)