Error mitigation for variational quantum algorithms through mid-circuit measurements

Abstract

Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of physical qubits. However, it is not possible to use memory-consuming techniques for current quantum devices having at most hundreds or at best thousands of physical qubits on their own. For specific problems, valid quantum states have a unique structure as in the case of Fock states and W-states where the Hamming weight is fixed, and the evolution takes place in a smaller subspace of the full Hilbert space. With this pre-knowledge, some errors can be detected in the course of the evolution of the circuit, by filtering the states not obeying the pattern through post-selection. In this paper, we present mid-circuit post-selection schemes for frequently used encodings such as one-hot, binary, gray, and domain-wall encoding. For the particular subspace of one-hot states, we propose a method that works by compressing the full Hilbert space to a smaller subspace, allowing projecting to the desired subspace without using any ancilla qubits. We demonstrate the effectiveness of the approach for the Quantum Alternating Operator Ansatz algorithm. Our method is particularly suitable for the currently available hardware, where measuring and resetting is possible, but classical control conditional operators are not.

22 pages, 12 figures, typos fixed

References in corpus (7)

• A Quantum Approximate Optimization Algorithm
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Quantum approximate optimization is computationally universal
• Tequila: A platform for rapid development of quantum algorithms
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Space-efficient binary optimization for variational computing

Cited by in corpus (12)

• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Biology and medicine in the landscape of quantum advantages
• Understanding domain-wall encoding theoretically and experimentally
• Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers
• A randomized benchmarking suite for mid-circuit measurements
• Preparing quantum many-body scar states on quantum computers
• Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: coloring, routing, scheduling, and other problems
• Resource frugal optimizer for quantum machine learning
• Complete physical characterization of QND measurements via tomography
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• Simulating long-range coherence of atoms and photons in quantum computers
• Symmetry-based quantum algorithms for open-shop scheduling with hard constraints