Journal
PHYSICAL REVIEW A
Volume 104, Issue 6, Pages -Publisher
AMER PHYSICAL SOC
DOI: 10.1103/PhysRevA.104.062428
Keywords
-
Categories
Funding
- DARPA-ONISQ [HR001120C0068]
- DOE [DE-SC0019465]
- U.S. Department of Energy (DOE) [DE-SC0019465] Funding Source: U.S. Department of Energy (DOE)
Ask authors/readers for more resources
This research presents a modification to the QAOA algorithm by adding additional variational parameters, resulting in high performance in solving the MaxCut problem at low depth, and explores its potential for solving other problems effectively.
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available