Variational and Annealing-Based Approaches to Quantum Combinatorial Optimization
- URL: http://arxiv.org/abs/2603.19117v1
- Date: Thu, 19 Mar 2026 16:41:38 GMT
- Title: Variational and Annealing-Based Approaches to Quantum Combinatorial Optimization
- Abstract summary: We first survey the main families of quantum algorithms, including Quantum Annealing, Quantum Approximate Optimization Algorithm (QAOA), Quantum Reinforcement Learning (QRL), and Quantum Generative Modeling (QGM)<n>We then examine the problem classes where quantum technologies currently show evidence of quantum advantage, drawing on established benchmarking initiatives such as QOBLIB, QUARK, QASMBench, and QED-C.<n>These problem classes are subsequently mapped to representative industrial domains, including logistics, finance, and telecommunications.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this work, we review quantum approaches to combinatorial optimization, with the aim of bridging theoretical developments and industrial relevance. We first survey the main families of quantum algorithms, including Quantum Annealing, the Quantum Approximate Optimization Algorithm (QAOA), Quantum Reinforcement Learning (QRL), and Quantum Generative Modeling (QGM). We then examine the problem classes where quantum technologies currently show evidence of quantum advantage, drawing on established benchmarking initiatives such as QOBLIB, QUARK, QASMBench, and QED-C. These problem classes are subsequently mapped to representative industrial domains, including logistics, finance, and telecommunications. Our analysis indicates that quantum annealing currently exhibits the highest level of operational maturity, while QAOA shows promising potential on NISQ-era hardware. In contrast, QRL and QGM emerge as longer-term research directions with significant potential for future industrial impact.
Related papers
- VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - A Survey of Quantum Transformers: Architectures, Challenges and Outlooks [82.4736481748099]
Quantum Transformers integrate the representational power of classical Transformers with the computational advantages of quantum computing.<n>Since 2022, research in this area has rapidly expanded, giving rise to diverse technical paradigms and early applications.<n>This paper presents the first comprehensive, systematic, and in-depth survey of quantum Transformer models.
arXiv Detail & Related papers (2025-04-04T05:40:18Z) - Comprehensive Survey of QML: From Data Analysis to Algorithmic Advancements [2.5686697584463025]
Quantum Machine Learning represents a paradigm shift at the intersection of Quantum Computing and Machine Learning.<n>The field faces significant challenges, including hardware constraints, noise, and limited qubit coherence.<n>This survey aims to provide a foundational resource for advancing Quantum Machine Learning toward practical, real-world applications.
arXiv Detail & Related papers (2025-01-16T13:25:49Z) - Quantum Approximate Optimization: A Computational Intelligence Perspective [1.756184965281354]
We introduce quantum computing and variational quantum algorithms (VQAs)
We explain Farhi et al.'s quantum approximate optimization algorithm (Farhi's QAOA)
We discuss connections of QAOA to relevant domains, such as computational learning theory and genetic algorithms.
arXiv Detail & Related papers (2024-07-09T19:40:23Z) - Quantum Multi-Agent Reinforcement Learning for Aerial Ad-hoc Networks [0.19791587637442667]
This paper presents an aerial communication use case and introduces a hybrid quantum-classical (HQC) ML algorithm to solve it.
Results show a slight increase in performance for the quantum-enhanced solution with respect to a comparable classical algorithm.
These promising results show the potential of QMARL to industrially-relevant complex use cases.
arXiv Detail & Related papers (2024-04-26T15:57:06Z) - A quantum information theoretic analysis of reinforcement learning-assisted quantum architecture search [0.0]
This study investigates RL-QAS for crafting ansatz tailored to variational quantum state diagonalisation problem.
We leverage these insights to devise an entanglement-guided admissible ansatz in QAS to diagonalise random quantum states using optimal resources.
arXiv Detail & Related papers (2024-04-09T09:54:59Z) - Quantum Computing in Logistics and Supply Chain Management an Overview [0.0]
The work explores the integration of quantum computing into logistics and supply chain management.<n>The paper provides an overview of quantum approaches to routing, logistic network design, fleet maintenance, cargo loading, prediction, and scheduling problems.
arXiv Detail & Related papers (2024-02-27T14:04:08Z) - Quantum Imitation Learning [74.15588381240795]
We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL.
We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL)
Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
arXiv Detail & Related papers (2023-04-04T12:47:35Z) - Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the
Race to Practical Quantum Advantage [43.3054117987806]
We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits.
We show this method significantly improves the trainability and performance of PQCs on a variety of problems.
By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
arXiv Detail & Related papers (2022-08-29T15:24:03Z) - Multi-disk clutch optimization using quantum annealing [34.82692226532414]
We develop a new quantum algorithm to solve a problem with significant practical relevance in clutch manufacturing.
It is demonstrated how quantum optimization can play a role in real industrial applications in the manufacturing sector.
arXiv Detail & Related papers (2022-08-11T16:34:51Z) - Recent Advances for Quantum Neural Networks in Generative Learning [98.88205308106778]
Quantum generative learning models (QGLMs) may surpass their classical counterparts.
We review the current progress of QGLMs from the perspective of machine learning.
We discuss the potential applications of QGLMs in both conventional machine learning tasks and quantum physics.
arXiv Detail & Related papers (2022-06-07T07:32:57Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.