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.

arXiv comment22 pages, 12 figures, typos fixed

References in corpus (49)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• Quantum Simulation
• Ising formulations of many NP problems
• The theory of variational hybrid quantum-classical algorithms
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A Quantum Approximate Optimization Algorithm
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Circuit Learning
• Error mitigation for short-depth quantum circuits
• Scalable Quantum Simulation of Molecular Energies
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Hartree-Fock on a superconducting qubit quantum computer
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum-assisted quantum compiling
• Mitigating measurement errors in multi-qubit experiments
• Learning the quantum algorithm for state overlap
• Low-cost error mitigation by symmetry verification
• Error-mitigated digital quantum simulation
• Learning-based quantum error mitigation
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Mitigation of readout noise in near-term quantum devices by classical post-processing based on detector tomography
• Bell's theorem with and without inequalities for the three-qubit Greenberger-Horne-Zeilinger and W states
• $XY$-mixers: analytical and numerical results for QAOA
• Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer
• Reachability Deficits in Quantum Approximate Optimization
• Resource-efficient digital quantum simulation of $d$-level systems for photonic, vibrational, and spin-$s$ Hamiltonians
• Exponential Error Suppression for Near-Term Quantum Devices
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Deterministic Preparation of Dicke States
• Domain wall encoding of discrete variables for quantum annealing and QAOA
• On the Universality of the Quantum Approximate Optimization Algorithm
• A quantum algorithm to train neural networks using low-depth circuits
• Quantum approximate optimization is computationally universal
• Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
• Tequila: A platform for rapid development of quantum algorithms
• Unconstrained Binary Models of the Travelling Salesman Problem Variants for Quantum Optimization
• Efficient correction of multiqubit measurement errors
• Flight Gate Assignment with a Quantum Annealer
• Efficient encoding of the weighted MAX k-CUT on a quantum computer using QAOA
• The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case Examples
• Classical and Quantum Bounded Depth Approximation Algorithms
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• Quantum algorithms with local particle number conservation: noise effects and error correction
• Practical Integer-to-Binary Mapping for Quantum Annealers
• Classical and Quantum Algorithms for Orthogonal Neural Networks
• Quantum computing approach to railway dispatching and conflict management optimization on single-track railway lines
• 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