Quantum Optimization with a Novel Gibbs Objective Function and Ansatz Architecture Search

Abstract

The Quantum Approximate Optimization Algorithm (QAOA) is a standard method for combinatorial optimization with a gate-based quantum computer. The QAOA consists of a particular ansatz for the quantum circuit architecture, together with a prescription for choosing the variational parameters of the circuit. We propose modifications to both. First, we define the Gibbs objective function and show that it is superior to the energy expectation value for use as an objective function in tuning the variational parameters. Second, we describe an Ansatz Architecture Search (AAS) algorithm for searching the discrete space of quantum circuit architectures near the QAOA to find a better ansatz. Applying these modifications for a complete graph Ising model results in a $244.7\%$ median relative improvement in the probability of finding a low-energy state while using $33.3\%$ fewer two-qubit gates. For Ising models on a 2d grid we similarly find $44.4\%$ median improvement in the probability with a $20.8\%$ reduction in the number of two-qubit gates. This opens a new research field of quantum circuit architecture design for quantum optimization algorithms.

References in corpus (7)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• The theory of variational hybrid quantum-classical algorithms
• Optimization of Molecules via Deep Reinforcement Learning
• Improving Variational Quantum Optimization using CVaR
• Exploring Randomly Wired Neural Networks for Image Recognition
• A Universal Training Algorithm for Quantum Deep Learning

Cited by in corpus (52)

• Noisy intermediate-scale quantum (NISQ) algorithms
• A Review on Quantum Approximate Optimization Algorithm and its Variants
• Quantum circuit architecture search for variational quantum algorithms
• Challenges and Opportunities in Quantum Optimization
• Differentiable Quantum Architecture Search
• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Recent advances for quantum classifiers
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Neural Predictor based Quantum Architecture Search
• Reinforcement Learning for Many-Body Ground-State Preparation Inspired by Counterdiabatic Driving
• Variational Quantum-Neural Hybrid Eigensolver
• Empirical performance bounds for quantum approximate optimization
• Quantum Graph Neural Networks
• Adaptive pruning-based optimization of parameterized quantum circuits
• Markovian Quantum Neuroevolution for Machine Learning
• Quantum variational optimization: The role of entanglement and problem hardness
• Robust resource-efficient quantum variational ansatz through evolutionary algorithm
• Low depth mechanisms for quantum optimization
• Quantum Architecture Search: A Survey
• Evaluation of QAOA based on the approximation ratio of individual samples
• Quantum Architecture Search with Meta-learning
• Quantum Approximate Optimization Algorithm with Adaptive Bias Fields
• Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Hierarchical quantum circuit representations for neural architecture search
• Quantifying the efficiency of state preparation via quantum variational eigensolvers
• An evolving objective function for improved variational quantum optimisation
• Numerical Evidence for Exponential Speed-up of QAOA over Unstructured Search for Approximate Constrained Optimization
• An introduction to variational quantum algorithms for combinatorial optimization problems
• Simulations of Frustrated Ising Hamiltonians with Quantum Approximate Optimization
• GSQAS: Graph Self-supervised Quantum Architecture Search
• FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuits
• Variational Quantum Cloning: Improving Practicality for Quantum Cryptanalysis
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols
• A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
• Noise-Robust End-to-End Quantum Control using Deep Autoregressive Policy Networks
• Exploring the neighborhood of 1-layer QAOA with Instantaneous Quantum Polynomial circuits
• Analytical results for the Quantum Alternating Operator Ansatz with Grover Mixer
• Rapid quantum approaches for combinatorial optimisation inspired by optimal state-transfer
• Simulating thermodynamic properties of dinuclear metal complexes using Variational Quantum Algorithms
• Random Natural Gradient
• Maximising Quantum-Computing Expressive Power through Randomised Circuits
• Quantum mean value approximator for hard integer value problems
• Tabu-driven Quantum Neighborhood Samplers
• Charged particle reconstruction for future high energy colliders with Quantum Approximate Optimization Algorithm
• Adiabatic quantum computing with parameterized quantum circuits
• Multi-target quantum compilation algorithm
• Improving the Quantum Approximate Optimization Algorithm with postselection
• Generating Generalised Ground-State Ansatzes from Few-Body Examples
• A coherent approach to quantum-classical optimization
• An Analysis of the Quantum Approximation Optimisation Algorithm