Simplifying errors by symmetry and randomisation

Abstract

We present a set of methods to generate less complex error channels by quantum circuit parallelisation. The resulting errors are simplified as a consequence of their symmetrisation and randomisation. Initially, the case of a single error channel is analysed; these results are then generalised to multiple error channels. Error simplification for each method is shown to be either constant, linear, or exponential in terms of system size. Finally, example applications are provided, along with experiments run on superconducting quantum hardware and numerical simulation. These applications are: (1) reducing the sample complexity of matrix-inversion measurement error mitigation by error symmetrisation, (2) improving the effectiveness of noise-estimation circuit error mitigation by error randomisation, and (3) improving the predictability of noisy circuit performance by error randomisation.

arXiv comment19 pages, 11 figures, additional numerics for time-dependent error stabilisation, corrected typos, some restructuring

References in corpus (29)

• The theory of variational hybrid quantum-classical algorithms
• Error mitigation for short-depth quantum circuits
• Randomized Benchmarking of Quantum Gates
• A Theory of Fault-Tolerant Quantum Computation
• Robust randomized benchmarking of quantum processes
• Validating quantum computers using randomized model circuits
• Noise tailoring for scalable quantum computation via randomized compiling
• Characterizing Quantum Gates via Randomized Benchmarking
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• The Future of Quantum Computing with Superconducting Qubits
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Model-free readout-error mitigation for quantum expectation values
• Mitigating depolarizing noise on quantum computers with noise-estimation circuits
• Three Qubit Randomized Benchmarking
• Measuring the Capabilities of Quantum Computers
• Investigating the limits of randomized benchmarking protocols
• Detector Tomography on IBM 5-qubit Quantum Computers and Mitigation of Imperfect Measurement
• A general framework for randomized benchmarking
• What randomized benchmarking actually measures
• Parallelizing Quantum Circuits
• The learnability of Pauli noise
• Randomized benchmarking for individual quantum gates
• Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Quantum fault tolerance in small experiments
• Leveraging Randomized Compiling for the QITE Algorithm
• Mitigating errors by quantum verification and post-selection
• A comparative code study for quantum fault-tolerance
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking