Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels

Abstract

Twirling is a technique widely used for converting arbitrary noise channels into Pauli channels in error threshold estimations of quantum error correction codes. It is vitally useful both in real experiments and in classical quantum simulations. Minimising the size of the twirling gate set increases the efficiency of simulations and in experiments it might reduce both the number of runs required and the circuit depth (and hence the error burden). Conventional twirling uses the full set of Pauli gates as the set of twirling gates. This article provides a theoretical background for Pauli twirling and a way to construct a twirling gate set with a number of members comparable to the size of the Pauli basis of the given error channel, which is usually much smaller than the full set of Pauli gates. We also show that twirling is equivalent to stabiliser measurements with discarded measurement results, which enables us to further reduce the size of the twirling gate set.

Fixed typos, added another example and improve presentations

References in corpus (11)

• Quantum Computing in the NISQ era and beyond
• Error mitigation for short-depth quantum circuits
• Randomized Benchmarking of Quantum Gates
• Robust randomized benchmarking of quantum processes
• Practical Quantum Error Mitigation for Near-Future Applications
• Low-distance Surface Codes under Realistic Quantum Noise
• Symmetrised Characterisation of Noisy Quantum Processes
• Surface code with decoherence: An analysis of three superconducting architectures
• Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
• Distillation of multipartite entanglement by complementary stabilizer measurements
• Comparison of a quantum error correction threshold for exact and approximate errors

Cited by in corpus (46)

• Mitigating depolarizing noise on quantum computers with noise-estimation circuits
• Exponential Error Suppression for Near-Term Quantum Devices
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Experimental benchmarking of an automated deterministic error suppression workflow for quantum algorithms
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• Twirling and Hamiltonian Engineering via Dynamical Decoupling for GKP Quantum Computing
• Enhancing quantum utility: simulating large-scale quantum spin chains on superconducting quantum computers
• Simulating prethermalization using near-term quantum computers
• Thresholds for the distributed surface code in the presence of memory decoherence
• Performance metrics for the continuous distribution of entanglement in multi-user quantum networks
• Quantum Error Mitigation by Pauli Check Sandwiching
• Lie-algebraic classical simulations for quantum computing
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling
• A Silicon Surface Code Architecture Resilient Against Leakage Errors
• Improved quantum error correction with randomized compiling
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
• Single-Step Parity Check Gate Set for Quantum Error Correction
• Algorithmic Shadow Spectroscopy
• Efficient Assessment of Process Fidelity
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
• Techniques for learning sparse Pauli-Lindblad noise models
• Simulation of open quantum systems via low-depth convex unitary evolutions
• Non-Pauli errors can be efficiently sampled in qudit surface codes
• Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
• Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
• Energy risk analysis with Dynamic Amplitude Estimation and Piecewise Approximate Quantum Compiling
• Optimized Noise Suppression for Quantum Circuits
• Statistics of topological defects across a phase transition in a digital superconducting quantum processor
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Resource-efficient Generalized Quantum Subspace Expansion
• Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits
• Space-time tradeoff in networked virtual distillation
• Purity-Assisted Zero-Noise Extrapolation for Quantum Error Mitigation
• Accurately Simulating the Time Evolution of an Ising Model with Echo Verified Clifford Data Regression on a Superconducting Quantum Computer
• Quantum Utility in Simulating the Real-time Dynamics of the Fermi-Hubbard Model using Superconducting Quantum Computers
• Experimental Quantum Channel Purification
• Error Mitigation of BQP Computations using Measurement-Based Verification
• Dynamic thermalization on noisy quantum hardware
• Mitigating Errors in Analog Quantum Simulation by Hamiltonian Reshaping or Hamiltonian Rescaling
• Reduction of unitary operators, quantum graphs and quantum channels
• Bayesian inference of general noise-model parameters from the syndrome statistics of surface codes
• Optimal randomized measurements for a family of non-linear quantum properties
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation
• Comparison of spin-qubit architectures for quantum error-correcting codes
• Towards Compact Wavefunctions from Quantum-Selected Configuration Interaction
• Incoherent Approximation of Leakage in Quantum Error Correction