Skip to content
DraconiticResearch
Search Sources API
186,625 studies31 sourcesUpdated 47 min ago
PreprintCC BY 4.0arXiv

Resource Analysis of Quantum Optimization Algorithms via Variational Methods

Abstract

Variational Quantum Algorithms (VQAs) are promising approaches for solving combinatorial optimization problems on near-term quantum devices. However, the role played by quantum resources such as entanglement and coherence during the optimization process remains poorly understood. In this work, we investigate the evolution of these resources in two VQAs--the Quantum Approximate Optimization Algorithm (QAOA) and the Feedback-based Algorithm for Quantum Optimization (FALQON)--applied to the Minimum Vertex Cover problem. We employ a variational resource-quantification framework based on the Bures metric and Uhlmann's theorem, in which an auxiliary quantum circuit is optimized to identify the closest resource-free states. This approach allows us to quantify Bures entanglement and Bures coherence of the algorithmic states without requiring full quantum state tomography. For the considered problem instance, QAOA exhibits a pronounced accumulation of entanglement in its initial layers, followed by a progressive reduction as the algorithm converges toward the optimal solution. Its coherence likewise decreases overall with increasing circuit depth, although a finite residual value persists due to the degeneracy of the optimal-solution subspace. In contrast, FALQON exhibits a substantially lower entanglement peak, reached at larger circuit depth, followed by a decay as convergence proceeds. Its coherence decreases smoothly and monotonically together with the optimization error. These results reveal distinct quantum-resource trajectories associated with the two optimization strategies and illustrate how entanglement and coherence evolve as variational quantum states approach solutions of a classical combinatorial optimization problem.

Related

  1. Symmetry-guided algorithms for variational quantum optimization
    Eunjin In, Kristina D. Launey, Darin C. Mumma +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Loan Portfolio Optimization with Variational Quantum Algorithms
    Balaganchi A. Bhargava, Kamlesh Kumar, Gouranga Dinda +4
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Optimization Geometry of QAOA and Variational Quantum Algorithms
    Vojtěch Novák, Ivan Zelinka, Silvie Illésová +2
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  4. Accelerating noisy variational quantum algorithms with physics-informed denoising networks
    Jie Liu, Xin Wang
    Physical Review ResearchPeer-reviewedPublisher termsAtomic, molecular & optical physicsCrossref
  5. Scaling law of variational quantum algorithms
    Ningfeng Wang, Zhengwei Liu
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{dallabona2026resource,
  title = {{Resource Analysis of Quantum Optimization Algorithms via Variational Methods}},
  author = {Vitor Dallabona and Lucas Friedrich and Jonas Maziero},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.29919},
  eprint = {2610.29919},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.29919},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Resource Analysis of Quantum Optimization Algorithms via Variational Methods
AU  - Vitor Dallabona
AU  - Lucas Friedrich
AU  - Jonas Maziero
PY  - 2026
DA  - 2026/10/21
PB  - arXiv
DO  - 10.48550/arxiv.2610.29919
UR  - https://arxiv.org/abs/2610.29919
AB  - Variational Quantum Algorithms (VQAs) are promising approaches for solving combinatorial optimization problems on near-term quantum devices. However, the role played by quantum resources such as entanglement and coherence during the optimization process remains poorly understood. In this work, we investigate the evolution of these resources in two VQAs--the Quantum Approximate Optimization Algorithm (QAOA) and the Feedback-based Algorithm for Quantum Optimization (FALQON)--applied to the Minimum Vertex Cover problem. We employ a variational resource-quantification framework based on the Bures metric and Uhlmann's theorem, in which an auxiliary quantum circuit is optimized to identify the closest resource-free states. This approach allows us to quantify Bures entanglement and Bures coherence of the algorithmic states without requiring full quantum state tomography. For the considered problem instance, QAOA exhibits a pronounced accumulation of entanglement in its initial layers, followed by a progressive reduction as the algorithm converges toward the optimal solution. Its coherence likewise decreases overall with increasing circuit depth, although a finite residual value persists due to the degeneracy of the optimal-solution subspace. In contrast, FALQON exhibits a substantially lower entanglement peak, reached at larger circuit depth, followed by a decay as convergence proceeds. Its coherence decreases smoothly and monotonically together with the optimization error. These results reveal distinct quantum-resource trajectories associated with the two optimization strategies and illustrate how entanglement and coherence evolve as variational quantum states approach solutions of a classical combinatorial optimization problem.
ER  -