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:2107.13129 · Physical Review A

Freedom of the mixer rotation axis improves performance in the quantum approximate optimization algorithm

Luke C. G. Govia, C. Poole, Mark E. Saffman, Hari Krovi

Published Dec 16, 2021• 17 citations
arXivHTMLPDF

Abstract

Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are particularly attractive candidates for implementation on near-term quantum processors. As hardware realities such as error and qubit connectivity will constrain achievable circuit depth in the near future, new ways to achieve high performance at low depth are of great interest. In this work, we present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation axis in the $XY$ plane of the mixer Hamiltonian. Via numerical simulation, we show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MaxCut problem on graphs of up to seven qubits. Furthermore, we explore the $Z$-phase error mitigation properties of our modified Ansatz, its performance under a realistic error model for a neutral atom quantum processor, and the class of problems it can solve in a single round.

DOI
10.1103/physreva.104.062428

Related papers

An expressive ansatz for low-depth quantum approximate optimisation

V Vijendran, Aritra Das, Dax Enshan Koh +2 more

Abstract The quantum approximate optimisation algorithm (QAOA) is a hybrid quantum–classical algorithm used to approximately solve combinatorial optimisation problems. It involves multiple iterations of a parameterised ansatz that consists of a problem and mixer Hamiltonian, with the parameters being classically optimised. While QAOA can be implemented on near-term quantum hardware, physical limitations such as gate noise, restricted qubit connectivity, and state-preparation-and-measurement (SPAM) errors can limit circuit depth and decrease performance. To address these limitations, this work introduces the eXpressive QAOA (XQAOA), an overparameterised variant of QAOA that assigns more classical parameters to the ansatz to improve its performance at low depths. XQAOA also introduces an additional Pauli-Y component in the mixer Hamiltonian, allowing the mixer to implement arbitrary unitary transformations on each qubit. To benchmark the performance of XQAOA at unit depth, we derive its closed-form expression for the MaxCut problem and compare it to QAOA, Multi-Angle QAOA (MA-QAOA) (Herrman et al 2022 Sci. Rep. 12 6781), a classical-relaxed algorithm, and the state-of-the-art Goemans–Williamson algorithm on a set of unweighted regular graphs with 128 and 256 nodes for degrees ranging from 3 to 10. Our results indicate that at unit depth, XQAOA has benign loss landscapes with local minima concentrated near the global optimum, allowing it to consistently outperform QAOA, MA-QAOA, and the classical-relaxed algorithm on all graph instances and the Goemans–Williamson algorithm on graph instances with degrees greater than 4. Small-scale simulations also reveal that unit-depth XQAOA invariably surpasses both QAOA and MA-QAOA on all tested depths up to five. Additionally, we find an infinite family of graphs for which XQAOA solves MaxCut exactly and analytically show that for some graphs in this family, special cases of XQAOA are capable of achieving a much larger approximation ratio than QAOA. Overall, XQAOA is a more viable choice for variational quantum optimisation on near-term quantum devices, offering competitive performance at low depths.

arXiv:2302.04479•Quantum Science and Technology•Jan 18, 2024•51 citations

Multi-angle quantum approximate optimization algorithm

Rebekah Herrman, Phillip C. Lotshaw, James Ostrowski +2 more

The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.

arXiv:2109.11455•Scientific Reports•Apr 26, 2022•167 citations

Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems

Evgeniy O. Kiktenko, Elizaveta V. Krendeleva, Aleksey K. Fedorov

The quantum approximate optimization algorithm (QAOA) is among the leading candidates for achieving quantum advantage on near-term processors. While typically implemented with a transverse-field mixer (XM-QAOA), the Grover-mixer variant (GM-QAOA) offers a compelling alternative due to its global search capabilities. This work investigates the application of GM-QAOA to higher-order unconstrained binary optimization (HUBO) problems, also known as polynomial unconstrained binary optimization (PUBO), which form a general class of combinatorial optimization problems involving multivariable interactions. We present a comprehensive numerical study demonstrating that GM-QAOA, unlike XM-QAOA, exhibits monotonic improvement in performance with circuit depth and achieves superior results for HUBO problems within a layerwise optimization framework. An important component of our approach is an analytical framework for modeling GM-QAOA dynamics, which enables a classical approximation of the optimal parameters and helps reduce the optimization overhead. Our resource-efficient parametrized version of GM-QAOA nearly matches the performance of the version optimized using the layerwise approach while being significantly less demanding, making it a highly effective approach for complex optimization tasks. These findings highlight the potential of GM-QAOA and provide a practical pathway for its implementation on current quantum hardware.

quant-pharXiv:2512.23026•Physical Review A•Dec 30, 2025•5 citations

Enhancing QAOA Ansatz via Multi-Parameterized Layer and Blockwise Optimization

Francesca De Falco, Leonardo Lavagna, Andrea Ceschini +2 more

The Quantum Approximate Optimization Algorithm (QAOA) is a leading variational approach for combinatorial problems, yet its performance on NISQ hardware is limited depthbounds and challenging parameter landscapes. We propose Enhanced QAOA (EQAOA), a modified ansatz that appends a compact multi-parameter layer and uses a blockwise optimization scheme. This design preserves the QAOA evolution while broadening the candidate solution space and easing solution exploration. Applied to the MaxCut problem across diverse graph families, EQAOA achieves, with an order of magnitude smaller circuit depth, approximation ratios comparable to QAOA, using a single cost–mixer layer, thus reducing gate counts by up to fivefold, as supported by experiments. Moreover, ablation studies prove that blockwise fine-tuning is crucial to deliver higher-quality solutions at shallower depth, offering a practical, quantum hardware-efficient alternative for signal processing applications.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 21, 2026•2 citations

Quantum Approximate Optimization Algorithm with Fixed Number of Parameters

Sebastián Saavedra-Pino, Ricardo Quispe-Mendizábal, Gabriel Alvarado Barrios +3 more

We introduce a novel quantum optimization paradigm: the Fixed-Parameter-Count Quantum Approximate Optimization Algorithm (FPC-QAOA). It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth. By separating schedule function optimization from circuit digitization, FPC-QAOA enables accurate schedule approximations with minimal parameters while supporting arbitrarily deep digitized adiabatic evolutions, constrained only by NISQ hardware capabilities. This separation allows depth to scale without expanding the classical search space, mitigating overparameterization and optimization challenges typical of deep QAOA circuits, such as barren plateaus-like behaviors. We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA with nearly constant classical effort and significantly fewer quantum circuit evaluations. Experiments on the IBM Kingston superconducting processor with up to 50 qubits confirm robustness and hardware efficiency under realistic noise. These results position FPC-QAOA as a practical and scalable paradigm for variational quantum optimization on near-term quantum devices.

quant-pharXiv:2512.21181•EPJ Quantum Technology•Dec 25, 2025•3 citations

Phantom Edges in the Problem Hamiltonian: A Method for Increasing Performance and Graph Visibility for QAOA

Quinn Langfitt, Reuben Tate, Stephan Eidenbenz

The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm that can be used to approximately solve combinatorial optimization problems. However, a major limitation of QAOA is that it is a "local" algorithm for finite circuit depths, meaning it can only optimize over local properties of the graph. In this paper, we present Phantom-Qaoa, a new QAOA ansatz that introduces only one additional parameter to the standard ansatz—regardless of system size—allowing QAOA to "see" more of the graph at a given depth p. We achieve this by modifying the target graph to include additional α-weighted edges, with α serving as a tunable parameter. This modified graph is then used to construct the phase operator and allows QAOA to explore a wider range of the graph’s features. We derive a general formula for our new ansatz at p = 1 and analytically show an improvement in the approximation ratio for cycle graphs. We also provide numerical experiments that demonstrate significant improvements in the approximation ratio for the Max-Cut problem over the standard QAOA ansatz for p = 1 and p = 2 on random regular graphs up to 16 nodes.

arXiv:2411.05216•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•3 citations
Variational quantum algorithms such as the quantum approximate optimization algorithm (QAOA) are particularly attractive candidates for implementation on near-term quantum processors. As hardware realities such as error and qubit connectivity will constrain achievable circuit depth in the near future, new ways to achieve high performance at low depth are of great interest. In this work, we present a modification to QAOA that adds additional variational parameters in the form of freedom of the rotation axis in the XYXYXY plane of the mixer Hamiltonian. Via numerical simulation, we show that this leads to a drastic performance improvement over standard QAOA at finding solutions to the MaxCut problem on graphs of up to seven qubits. Furthermore, we explore the ZZZ-phase error mitigation properties of our modified Ansatz, its performance under a realistic error model for a neutral atom quantum processor, and the class of problems it can solve in a single round.
Abstract The quantum approximate optimisation algorithm (QAOA) is a hybrid quantum–classical algorithm used to approximately solve combinatorial optimisation problems. It involves multiple iterations of a parameterised ansatz that consists of a problem and mixer Hamiltonian, with the parameters being classically optimised. While QAOA can be implemented on near-term quantum hardware, physical limitations such as gate noise, restricted qubit connectivity, and state-preparation-and-measurement (SPAM) errors can limit circuit depth and decrease performance. To address these limitations, this work introduces the eXpressive QAOA (XQAOA), an overparameterised variant of QAOA that assigns more classical parameters to the ansatz to improve its performance at low depths. XQAOA also introduces an additional Pauli-Y component in the mixer Hamiltonian, allowing the mixer to implement arbitrary unitary transformations on each qubit. To benchmark the performance of XQAOA at unit depth, we derive its closed-form expression for the MaxCut problem and compare it to QAOA, Multi-Angle QAOA (MA-QAOA) (Herrman et al 2022 Sci. Rep. 12 6781), a classical-relaxed algorithm, and the state-of-the-art Goemans–Williamson algorithm on a set of unweighted regular graphs with 128 and 256 nodes for degrees ranging from 3 to 10. Our results indicate that at unit depth, XQAOA has benign loss landscapes with local minima concentrated near the global optimum, allowing it to consistently outperform QAOA, MA-QAOA, and the classical-relaxed algorithm on all graph instances and the Goemans–Williamson algorithm on graph instances with degrees greater than 4. Small-scale simulations also reveal that unit-depth XQAOA invariably surpasses both QAOA and MA-QAOA on all tested depths up to five. Additionally, we find an infinite family of graphs for which XQAOA solves MaxCut exactly and analytically show that for some graphs in this family, special cases of XQAOA are capable of achieving a much larger approximation ratio than QAOA. Overall, XQAOA is a more viable choice for variational quantum optimisation on near-term quantum devices, offering competitive performance at low depths.
The quantum approximate optimization algorithm (QAOA) generates an approximate solution to combinatorial optimization problems using a variational ansatz circuit defined by parameterized layers of quantum evolution. In theory, the approximation improves with increasing ansatz depth but gate noise and circuit complexity undermine performance in practice. Here, we investigate a multi-angle ansatz for QAOA that reduces circuit depth and improves the approximation ratio by increasing the number of classical parameters. Even though the number of parameters increases, our results indicate that good parameters can be found in polynomial time for a test dataset we consider. This new ansatz gives a 33% increase in the approximation ratio for an infinite family of MaxCut instances over QAOA. The optimal performance is lower bounded by the conventional ansatz, and we present empirical results for graphs on eight vertices that one layer of the multi-angle anstaz is comparable to three layers of the traditional ansatz on MaxCut problems. Similarly, multi-angle QAOA yields a higher approximation ratio than QAOA at the same depth on a collection of MaxCut instances on fifty and one-hundred vertex graphs. Many of the optimized parameters are found to be zero, so their associated gates can be removed from the circuit, further decreasing the circuit depth. These results indicate that multi-angle QAOA requires shallower circuits to solve problems than QAOA, making it more viable for near-term intermediate-scale quantum devices.
The quantum approximate optimization algorithm (QAOA) is among the leading candidates for achieving quantum advantage on near-term processors. While typically implemented with a transverse-field mixer (XM-QAOA), the Grover-mixer variant (GM-QAOA) offers a compelling alternative due to its global search capabilities. This work investigates the application of GM-QAOA to higher-order unconstrained binary optimization (HUBO) problems, also known as polynomial unconstrained binary optimization (PUBO), which form a general class of combinatorial optimization problems involving multivariable interactions. We present a comprehensive numerical study demonstrating that GM-QAOA, unlike XM-QAOA, exhibits monotonic improvement in performance with circuit depth and achieves superior results for HUBO problems within a layerwise optimization framework. An important component of our approach is an analytical framework for modeling GM-QAOA dynamics, which enables a classical approximation of the optimal parameters and helps reduce the optimization overhead. Our resource-efficient parametrized version of GM-QAOA nearly matches the performance of the version optimized using the layerwise approach while being significantly less demanding, making it a highly effective approach for complex optimization tasks. These findings highlight the potential of GM-QAOA and provide a practical pathway for its implementation on current quantum hardware.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading variational approach for combinatorial problems, yet its performance on NISQ hardware is limited depthbounds and challenging parameter landscapes. We propose Enhanced QAOA (EQAOA), a modified ansatz that appends a compact multi-parameter layer and uses a blockwise optimization scheme. This design preserves the QAOA evolution while broadening the candidate solution space and easing solution exploration. Applied to the MaxCut problem across diverse graph families, EQAOA achieves, with an order of magnitude smaller circuit depth, approximation ratios comparable to QAOA, using a single cost–mixer layer, thus reducing gate counts by up to fivefold, as supported by experiments. Moreover, ablation studies prove that blockwise fine-tuning is crucial to deliver higher-quality solutions at shallower depth, offering a practical, quantum hardware-efficient alternative for signal processing applications.
We introduce a novel quantum optimization paradigm: the Fixed-Parameter-Count Quantum Approximate Optimization Algorithm (FPC-QAOA). It is a scalable variational framework that maintains a constant number of trainable parameters regardless of the number of qubits, Hamiltonian complexity, or circuit depth. By separating schedule function optimization from circuit digitization, FPC-QAOA enables accurate schedule approximations with minimal parameters while supporting arbitrarily deep digitized adiabatic evolutions, constrained only by NISQ hardware capabilities. This separation allows depth to scale without expanding the classical search space, mitigating overparameterization and optimization challenges typical of deep QAOA circuits, such as barren plateaus-like behaviors. We benchmark FPC-QAOA on random MaxCut instances and the Tail Assignment Problem, achieving performance comparable to or better than standard QAOA with nearly constant classical effort and significantly fewer quantum circuit evaluations. Experiments on the IBM Kingston superconducting processor with up to 50 qubits confirm robustness and hardware efficiency under realistic noise. These results position FPC-QAOA as a practical and scalable paradigm for variational quantum optimization on near-term quantum devices.
The Quantum Approximate Optimization Algorithm (QAOA) is a variational quantum algorithm that can be used to approximately solve combinatorial optimization problems. However, a major limitation of QAOA is that it is a "local" algorithm for finite circuit depths, meaning it can only optimize over local properties of the graph. In this paper, we present Phantom-Qaoa, a new QAOA ansatz that introduces only one additional parameter to the standard ansatz—regardless of system size—allowing QAOA to "see" more of the graph at a given depth p. We achieve this by modifying the target graph to include additional α-weighted edges, with α serving as a tunable parameter. This modified graph is then used to construct the phase operator and allows QAOA to explore a wider range of the graph’s features. We derive a general formula for our new ansatz at p = 1 and analytically show an improvement in the approximation ratio for cycle graphs. We also provide numerical experiments that demonstrate significant improvements in the approximation ratio for the Max-Cut problem over the standard QAOA ansatz for p = 1 and p = 2 on random regular graphs up to 16 nodes.