Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints

Abstract

We introduce multiple parametrized circuit ansätze and present the results of a numerical study comparing their performance with a standard Quantum Alternating Operator Ansatz approach. The ansätze are inspired by mixing and phase separation in the QAOA, and also motivated by compilation considerations with the aim of running on near-term superconducting quantum processors. The methods are tested on random instances of a weighted quadratic binary constrained optimization problem that is fully connected for which the space of feasible solutions has constant Hamming weight. For the parameter setting strategies and evaluation metric used, the average performance achieved by the QAOA is effectively matched by the one obtained by a "mixer-phaser" ansatz that can be compiled in less than half-depth of standard QAOA on most superconducting qubit processors.

arXiv comment8 pages including references, 5 figures - presented at quantum techniques in machine learning (QTML) 2020 - Revision v2 includes clarifications and corrects typos

References in corpus (38)

• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Noisy intermediate-scale quantum (NISQ) algorithms
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Hartree-Fock on a superconducting qubit quantum computer
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• A Theory of Trotter Error
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• Optimal Quantum Circuits for General Two-Qubit Gates
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Obstacles to State Preparation and Variational Optimization from Symmetry Protection
• Warm-starting quantum optimization
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz
• Improving Variational Quantum Optimization using CVaR
• Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
• $XY$-mixers: analytical and numerical results for QAOA
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Reachability Deficits in Quantum Approximate Optimization
• Compiling quantum circuits to realistic hardware architectures using temporal planners
• Optimal Protocols in Quantum Annealing and QAOA Problems
• Deterministic Preparation of Dicke States
• Parameter Concentration in Quantum Approximate Optimization
• Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
• Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search
• Implementation of the XY interaction family with calibration of a single pulse
• From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
• Quantum Algorithms for Fixed Qubit Architectures
• Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks
• The Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
• Quantum variational optimization: The role of entanglement and problem hardness
• Abrupt Transitions in Variational Quantum Circuit Training
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Analytical Framework for Quantum Alternating Operator Ansätze
• Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries
• Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth
• Progress towards analytically optimal angles in quantum approximate optimisation

Cited by in corpus (9)

• Benchmarking the performance of portfolio optimization with QAOA
• Graph neural network initialisation of quantum approximate optimisation
• Constrained Optimization via Quantum Zeno Dynamics
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
• QAOA with $N\cdot p\ge 200$
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
• Efficient Quantum Circuits based on the Quantum Natural Gradient