Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2007.01004 · Quantum Information Processing

Combinatorial optimization through variational quantum power method

Ammar Daskin

Published Oct 1, 2021• 5 citations
arXivHTMLPDF
DOI
10.1007/s11128-021-03283-x

Related papers

Combinatorial Optimization and Quantum Computers

Alexandre Gondran, Michel Gondran

•Feb 7, 2020•0 citations

From Theory to Practice: Analyzing Variational Quantum Power Method for Quantum Optimization of QUBO Problems

Ammar Daskin

The variational quantum power method (VQPM), which adapts the classical power iteration algorithm for quantum settings, has shown promise for eigenvector estimation and optimization on quantum hardware. In this work, we provide a comprehensive theoretical and numerical analysis of VQPM by investigating its convergence, robustness, and qubit locking mechanisms. We present detailed strategies for applying VQPM to QUBO problems by leveraging these locking mechanisms, establishing systematic guidelines for their practical applications. Furthermore, we provide a comparative study against the Quantum Approximate Optimization Algorithm (QAOA). Our analysis evaluates classical optimization behaviors and evaluates performance using localized Hamming distance (bit difference of the combinatorial solution). Scaling simulations up to $n=18$ qubits demonstrate that the success probability in VQPM exhibits notable resilience. Finally, we evaluate VQPM under realistic quantum noise using the IBM Qiskit Aer framework. Our results indicate that VQPM serves as an effective quantum optimization algorithm for combinatorial problems, and this work can serve as an initial guideline for such applications.

arXiv:2505.12990•May 19, 2025•2 citations

Filtering variational quantum algorithms for combinatorial optimization

David Amaro, Carlo Modica, Matthias Rosenkranz +3 more

Abstract Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the filtering variational quantum eigensolver which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the quantum approximate optimization algorithm. We also demonstrate the experimental feasibility of our algorithms on a Quantinuum trapped-ion quantum processor powered by Honeywell.

arXiv:2106.10055•Quantum Science and Technology•Nov 29, 2021•144 citations

Enhancing Combinatorial Optimization with Quantum Generative Models

Francisco Fernandez Alcazar, Alejandro Perdomo‐Ortiz

Bulletin of the American Physical Society•Mar 18, 2021•0 citations

Twisted hybrid algorithms for combinatorial optimization

Libor Caha, Alexander Kliesch, Robert König

Abstract Proposed hybrid algorithms encode a combinatorial cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. Classical processing is typically only used for the choice of variational parameters following gradient descent. As a consequence, these approaches are limited by the descriptive power of the associated states. We argue that for certain combinatorial optimization problems, such algorithms can be hybridized further, thus harnessing the power of efficient non-local classical processing. Specifically, we consider combining a quantum variational ansatz with a greedy classical post-processing procedure for the MaxCut-problem on three-regular graphs. We show that the average cut-size produced by this method can be quantified in terms of the energy of a modified problem Hamiltonian. This motivates the consideration of an improved algorithm which variationally optimizes the energy of the modified Hamiltonian. We call this a twisted hybrid algorithm since the additional classical processing step is combined with a different choice of variational parameters. We exemplify the viability of this method using the quantum approximate optimization algorithm (QAOA), giving analytic lower bounds on the expected approximation ratios achieved by twisted QAOA. We observe that for levels p = 1, …, 5, these lower bounds are comparable to the known lower bounds on QAOA at level p + 1 for high-girth graphs. This suggests that using twisted QAOA can reduce the circuit depth by 4 and the number of variational parameters by 2.

arXiv:2203.00717•Quantum Science and Technology•Jul 7, 2022•9 citations

Combinatorial optimization using quantum or classical driven systems

Hayato Goto

Bulletin of the American Physical Society•Mar 16, 2021•0 citations
The variational quantum power method (VQPM), which adapts the classical power iteration algorithm for quantum settings, has shown promise for eigenvector estimation and optimization on quantum hardware. In this work, we provide a comprehensive theoretical and numerical analysis of VQPM by investigating its convergence, robustness, and qubit locking mechanisms. We present detailed strategies for applying VQPM to QUBO problems by leveraging these locking mechanisms, establishing systematic guidelines for their practical applications. Furthermore, we provide a comparative study against the Quantum Approximate Optimization Algorithm (QAOA). Our analysis evaluates classical optimization behaviors and evaluates performance using localized Hamming distance (bit difference of the combinatorial solution). Scaling simulations up to n=18n=18n=18 qubits demonstrate that the success probability in VQPM exhibits notable resilience. Finally, we evaluate VQPM under realistic quantum noise using the IBM Qiskit Aer framework. Our results indicate that VQPM serves as an effective quantum optimization algorithm for combinatorial problems, and this work can serve as an initial guideline for such applications.
Abstract Current gate-based quantum computers have the potential to provide a computational advantage if algorithms use quantum hardware efficiently. To make combinatorial optimization more efficient, we introduce the filtering variational quantum eigensolver which utilizes filtering operators to achieve faster and more reliable convergence to the optimal solution. Additionally we explore the use of causal cones to reduce the number of qubits required on a quantum computer. Using random weighted MaxCut problems, we numerically analyze our methods and show that they perform better than the original VQE algorithm and the quantum approximate optimization algorithm. We also demonstrate the experimental feasibility of our algorithms on a Quantinuum trapped-ion quantum processor powered by Honeywell.
Abstract Proposed hybrid algorithms encode a combinatorial cost function into a problem Hamiltonian and optimize its energy by varying over a set of states with low circuit complexity. Classical processing is typically only used for the choice of variational parameters following gradient descent. As a consequence, these approaches are limited by the descriptive power of the associated states. We argue that for certain combinatorial optimization problems, such algorithms can be hybridized further, thus harnessing the power of efficient non-local classical processing. Specifically, we consider combining a quantum variational ansatz with a greedy classical post-processing procedure for the MaxCut-problem on three-regular graphs. We show that the average cut-size produced by this method can be quantified in terms of the energy of a modified problem Hamiltonian. This motivates the consideration of an improved algorithm which variationally optimizes the energy of the modified Hamiltonian. We call this a twisted hybrid algorithm since the additional classical processing step is combined with a different choice of variational parameters. We exemplify the viability of this method using the quantum approximate optimization algorithm (QAOA), giving analytic lower bounds on the expected approximation ratios achieved by twisted QAOA. We observe that for levels p = 1, …, 5, these lower bounds are comparable to the known lower bounds on QAOA at level p + 1 for high-girth graphs. This suggests that using twisted QAOA can reduce the circuit depth by 4 and the number of variational parameters by 2.