Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization

Abstract

Quantum alternating operator ansatz (QAOA) has a strong connection to the adiabatic algorithm, which it can approximate with sufficient depth. However, it is unclear to what extent the lessons from the adiabatic regime apply to QAOA as executed in practice with small to moderate depth. In this paper, we demonstrate that the intuition from the adiabatic algorithm applies to the task of choosing the QAOA initial state. Specifically, we observe that the best performance is obtained when the initial state of QAOA is set to be the ground state of the mixing Hamiltonian, as required by the adiabatic algorithm. We provide numerical evidence using the examples of constrained portfolio optimization problems with both low ($p\le 3$) and high ($p=100$) QAOA depth. Additionally, we successfully apply QAOA with XY mixer to portfolio optimization on a trapped-ion quantum processor using 32 qubits and discuss our findings in near-term experiments.

14 pages, 12 figures, accepted by npj Quantum Information

References in corpus (40)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Adiabatic Quantum Computing
• Parameterized quantum circuits as machine learning models
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum computing for finance
• Warm-starting quantum optimization
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• $XY$-mixers: analytical and numerical results for QAOA
• Quantum circuits for strongly correlated quantum systems
• Quantum annealing initialization of the quantum approximate optimization algorithm
• Optimal Protocols in Quantum Annealing and QAOA Problems
• Digitized-counterdiabatic quantum approximate optimization algorithm
• Parameter Transfer for Quantum Approximate Optimization of Weighted MaxCut
• Digitized-Counterdiabatic Quantum Algorithm for Protein Folding
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Classical symmetries and the Quantum Approximate Optimization Algorithm
• Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
• Constrained mixers for the quantum approximate optimization algorithm
• Ordering of Trotterization: Impact on Errors in Quantum Simulation of Electronic Structure
• A Divide-and-Conquer Approach to Dicke State Preparation
• Digitized-Counterdiabatic Quantum Optimization
• Short-Depth Circuits for Dicke State Preparation
• Constrained Optimization via Quantum Zeno Dynamics
• Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths
• QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
• Quantum Image Segmentation Based on Grayscale Morphology
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries
• Approximating the quantum approximate optimization algorithm with digital-analog interactions
• Approaches to Constrained Quantum Approximate Optimization
• Shortcuts to Quantum Approximate Optimization Algorithm
• Lower Bounds on Quantum Annealing Times
• Quantum Local Search with the Quantum Alternating Operator Ansatz
• Success of digital adiabatic simulation with large Trotter step
• Characterizing Error Mitigation by Symmetry Verification in QAOA
• Exploiting In-Constraint Energy in Constrained Variational Quantum Optimization
• QuYBE -- An Algebraic Compiler for Quantum Circuit Compression

Cited by in corpus (20)

• Quantum computing for finance
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Constrained Optimization via Quantum Zeno Dynamics
• Parameter Setting in Quantum Approximate Optimization of Weighted Problems
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Quantum-machine-assisted Drug Discovery
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Symmetric quantum states: a review of recent progress
• Efficient DCQO Algorithm within the Impulse Regime for Portfolio Optimization
• Decomposition Pipeline for Large-Scale Portfolio Optimization with Applications to Near-Term Quantum Computing
• Efficient Quantum Circuits based on the Quantum Natural Gradient
• Alleviating the quantum Big-$M$ problem
• Quantum encoder for fixed Hamming-weight subspaces
• A Cyclic Layerwise QAOA Training
• Approximate Quadratization of High-Order Hamiltonians for Combinatorial Quantum Optimization
• Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
• Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers
• Variational Quantum Algorithm Landscape Reconstruction by Low-Rank Tensor Completion
• iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
• Multiclass Portfolio Optimization via Variational Quantum Eigensolver with Dicke State Ansatz