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...
Saved in:
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/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
by: Jonathan Wurtz, et al.
Published: (2024-01-01) -
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
by: Bryce Fuller, et al.
Published: (2024-01-01) -
Noise Robustness of Quantum Relaxation for Combinatorial Optimization
by: Kentaro Tamura, et al.
Published: (2024-01-01) -
Hybrid subQUBO Annealing With a Correction Process for Multi-Day Intermodal Trip Planning
by: Tatsuya Noguchi, et al.
Published: (2025-01-01) -
Variational Estimation of Optimal Signal States for Quantum Channels
by: Leonardo Oleynik, et al.
Published: (2024-01-01)