Error Mitigation for Quantum Optimization Circuits by Leveraging Problem Symmetries

ORAL

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). 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 at the end of the circuit. 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 provide formulas for fidelity improvement from the application of our techniques and evaluate the proposed methods both in simulation and on multiple quantum processors.

*This work was supported in part by the U.S. Department of Energy (DOE), Office of Science, Office of Advanced Scientific Computing Research AIDE-QC and FAR-QC projects and by the Argonne LDRD program under contract number DE-AC02-06CH11357.

Publication: https://arxiv.org/abs/2106.04410
https://arxiv.org/abs/2111.xxxx

Presenters

  • Ashish KAKKAR

    • University of Kentucky

Authors

  • Ashish KAKKAR

    • University of Kentucky
  • Alexey Galda

    • Menten AI
    • University of Chicago
    • Menten AI, Inc.
  • Jeffrey Larson

    • Argonne National Laboratory
  • Ruslan Shaydulin

    • Argonne National Laboratory