Noise Robustness of Quantum Relaxation for Combinatorial Optimization
Relaxation is a common way for dealing with combinatorial optimization problems. Quantum random-access optimization (QRAO) is a quantum-relaxation-based optimizer that uses fewer qubits than the number of bits in the original problem by encoding multiple variables per qubit using quantum random-acce...
Saved in:
Main Authors: | Kentaro Tamura, Yohichi Suzuki, Rudy Raymond, C. Hiroshi Watanabe, Yuki Sato, Ruho Kondo, Michihiko Sugawara, Naoki Yamamoto |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10623712/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
by: Bryce Fuller, et al.
Published: (2024-01-01) -
Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
by: Jonathan Wurtz, et al.
Published: (2024-01-01) -
Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems
by: Tatsuhiko Shirai, et al.
Published: (2024-01-01) -
Graph Coarsening Approach to the Vehicle Routing Problem: An Approximation Strategy
by: Katarzyna Nalecz-Charkiewicz, et al.
Published: (2025-01-01) -
Multidisk Clutch Optimization Using Quantum Annealing
by: D. John Malcolm, et al.
Published: (2024-01-01)