Solving Nonnative Combinatorial Optimization Problems Using Hybrid Quantum–Classical Algorithms
Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quantum circuits, adiabatic protocols, and quantum ann...
Saved in:
Main Authors: | Jonathan Wurtz, Stefan H. Sack, Sheng-Tao Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Transactions on Quantum Engineering |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10636813/ |
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) -
Postprocessing Variationally Scheduled Quantum Algorithm for Constrained Combinatorial Optimization Problems
by: Tatsuhiko Shirai, et al.
Published: (2024-01-01) -
Noise Robustness of Quantum Relaxation for Combinatorial Optimization
by: Kentaro Tamura, et al.
Published: (2024-01-01) -
Quantum algorithms for enhanced educational technologies
by: Basil Hanafi, et al.
Published: (2025-01-01) -
Multidisk Clutch Optimization Using Quantum Annealing
by: D. John Malcolm, et al.
Published: (2024-01-01)