Corpus ID: 236469230

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

  title={Freedom of mixer rotation-axis improves performance in the quantum approximate optimization algorithm},
  author={L. C. G. Govia and Colin Poole and Mark Saffman and Hari Krovi},
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… Expand

Figures from this paper


From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter. Expand
Error mitigation extends the computational reach of a noisy quantum processor
This work applies the error mitigation protocol to mitigate errors in canonical single- and two-qubit experiments and extends its application to the variational optimization of Hamiltonians for quantum chemistry and magnetism. Expand
XY mixers: Analytical and numerical results for the quantum alternating operator ansatz
The quantum alternating operator ansatz (QAOA) is a promising gate-model metaheuristic for combinatorial optimization. Applying the algorithm to problems with constraints presents an implementationExpand
Self-verifying variational quantum simulation of lattice models
Experiments are presented that demonstrate self-verifying, hybrid, variational quantum simulation of lattice models in condensed matter and high-energy physics, enabling the study of a wide variety of previously intractable target models. Expand
Quantum-optimal-control-inspired ansatz for variational quantum algorithms
A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. This circuit is most commonly designed to respect theExpand
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
The experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms is demonstrated, determining the ground-state energy for molecules of increasing size, up to BeH2. Expand
Quantum chemistry calculations on a trapped-ion quantum simulator
Quantum-classical hybrid algorithms are emerging as promising candidates for near-term practical applications of quantum information processors in a wide variety of fields ranging from chemistry toExpand
An adaptive variational algorithm for exact molecular simulations on a quantum computer
A new variational hybrid quantum-classical algorithm which allows the system being simulated to determine its own optimal state, and highlights the potential of the adaptive algorithm for exact simulations with present-day and near-term quantum hardware. Expand
A Quantum Approximate Optimization Algorithm
We introduce a quantum algorithm that produces approximate solutions for combinatorial optimization problems. The algorithm depends on a positive integer p and the quality of the approximationExpand
A quantum alternating operator ansatz with hard and soft constraints for lattice protein folding
Gate-based universal quantum computers form a rapidly evolving field of quantum computing hardware technology. In previous work, we presented a quantum algorithm for lattice protein folding on aExpand