Error Mitigation for Deep Quantum Optimization Circuits by Leveraging Problem Symmetries

Abstract

High error rates and limited fidelity of quantum gates in near-term quantum devices are the central obstacles to successful execution of the Quantum Approximate Optimization Algorithm (QAOA). In this paper we introduce an application-specific approach for mitigating the errors in QAOA evolution by leveraging the symmetries present in the classical objective function to be optimized. Specifically, the QAOA state is projected into the symmetry-restricted subspace, with projection being performed either at the end of the circuit or throughout the evolution. Our approach improves the fidelity of the QAOA state, thereby increasing both the accuracy of the sample estimate of the QAOA objective and the probability of sampling the binary string corresponding to that objective value. We demonstrate the efficacy of the proposed methods on QAOA applied to the MaxCut problem, although our methods are general and apply to any objective function with symmetries, as well as to the generalization of QAOA with alternative mixers. We experimentally verify the proposed methods on an IBM Quantum processor, utilizing up to 5 qubits. When leveraging a global bit-flip symmetry, our approach leads to a 23% average improvement in quantum state fidelity.

minor updates (additional citation, clarified language)

References in corpus (13)

• Surface codes: Towards practical large-scale quantum computation
• A Quantum Approximate Optimization Algorithm
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
• Learning to learn with quantum neural networks via classical neural networks
• Generalized swap networks for near-term quantum computing
• Empirical performance bounds for quantum approximate optimization
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
• Exploiting Symmetry Reduces the Cost of Training QAOA
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Tensor Network Quantum Simulator With Step-Dependent Parallelization
• 6-qubit Optimal Clifford Circuits
• Limitations of optimization algorithms on noisy quantum devices

Cited by in corpus (15)

• Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Alignment between Initial State and Mixer Improves QAOA Performance for Constrained Optimization
• Constrained Optimization via Quantum Zeno Dynamics
• QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Quantum Error Mitigation by Pauli Check Sandwiching
• Multi-Angle QAOA Does Not Always Need All Its Angles
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
• Characterizing Error Mitigation by Symmetry Verification in QAOA
• Enabling High Performance Debugging for Variational Quantum Algorithms using Compressed Sensing
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• Quantum Approximate Optimization Algorithm with Sparsified Phase Operator
• Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
• Symmetry-based quantum algorithms for open-shop scheduling with hard constraints