Efficient estimation of Pauli channels

Abstract

Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance. Here we prove several results on efficiently learning Pauli channels, and more generally the Pauli projection of a quantum channel. We first derive a procedure for learning a Pauli channel on $n$ qubits with high probability to a relative precision $\epsilon$ using $O\left({\epsilon }^{-2}n{2}^n\right)$ measurements, which is efficient in the Hilbert space dimension. The estimate is robust to state preparation and measurement errors which, together with the relative precision, makes it especially appropriate for applications involving characterization of high-accuracy quantum gates. Next we show that the error rates for an arbitrary set of $s$ Pauli errors can be estimated to a relative precision $\epsilon$ using $O({\epsilon }^{-4}\log s\log s/\epsilon )$ measurements. Finally, we show that when the Pauli channel is given by a Markov field with at most $k$-local correlations, we can learn an entire $n$-qubit Pauli channel to relative precision $\epsilon$ with only $O_k\left({\epsilon }^{-2}{n}^2\log n\right)$ measurements, which is efficient in the number of qubits. These results enable a host of applications beyond just characterizing noise in a large-scale quantum system: they pave the way to tailoring quantum codes, optimizing decoders, and customizing fault tolerance procedures to suit a particular device.

31 pages, 1 figure; v3 some typos fixed

References in corpus (20)

• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Randomized Benchmarking of Quantum Gates
• Efficient quantum state tomography
• High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
• Characterization of addressability by simultaneous randomized benchmarking
• Symmetrised Characterisation of Noisy Quantum Processes
• Fault-tolerant quantum computation against biased noise
• Tailoring surface codes for highly biased noise
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Direct randomized benchmarking for multi-qubit devices
• Performance of quantum error correction with coherent errors
• Coherence in quantum error-correcting codes
• Advantages of versatile neural-network decoding for topological codes
• Compressed sensing quantum process tomography for superconducting quantum gates
• Recovering quantum gates from few average gate fidelities
• Analysing correlated noise on the surface code using adaptive decoding algorithms
• Real Randomized Benchmarking
• Scalable reconstruction of unitary processes and Hamiltonians
• Randomized Benchmarking with Restricted Gate Sets
• Rolling quantum dice with a superconducting qubit

Cited by in corpus (91)

• Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
• The XZZX Surface Code
• Model-free readout-error mitigation for quantum expectation values
• Robust shadow estimation
• Classical Shadows With Noise
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Multi-exponential Error Extrapolation and Combining Error Mitigation Techniques for NISQ Applications
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Out-of-distribution generalization for learning quantum dynamics
• Quantum coding with low-depth random circuits
• Nonstabilizerness determining the hardness of direct fidelity estimation
• Quantum advantages for Pauli channel estimation
• Noise-assisted digital quantum simulation of open systems
• Robust and Efficient Hamiltonian Learning
• The learnability of Pauli noise
• Modeling and mitigation of cross-talk effects in readout noise with applications to the Quantum Approximate Optimization Algorithm
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Simulating and mitigating crosstalk
• Classical shadows with Pauli-invariant unitary ensembles
• Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
• Pauli error estimation via Population Recovery
• Non-trivial symmetries in quantum landscapes and their resilience to quantum noise
• Learning correlated noise in a 39-qubit quantum processor
• Estimating gate-set properties from random sequences
• Efficiently improving the performance of noisy quantum computers
• Compressive gate set tomography
• Learning shallow quantum circuits
• Pauli channels can be estimated from syndrome measurements in quantum error correction
• Learning Quantum Processes and Hamiltonians via the Pauli Transfer Matrix
• Error-mitigated fermionic classical shadows on noisy quantum devices
• Demonstrating scalable randomized benchmarking of universal gate sets
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Experimental accreditation of outputs of noisy quantum computers
• Entanglement-Free Parameter Estimation of Generalized Pauli Channels
• Conditionally rigorous mitigation of multiqubit measurement errors
• Learning logical Pauli noise in quantum error correction
• Leveraging Randomized Compiling for the QITE Algorithm
• Robustly learning the Hamiltonian dynamics of a superconducting quantum processor
• Tight bounds on Pauli channel learning without entanglement
• Benchmarking quantum logic operations relative to thresholds for fault tolerance
• Simulating noisy quantum channels via quantum state preparation algorithms
• Efficient Assessment of Process Fidelity
• Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
• Fully scalable randomized benchmarking without motion reversal
• Optimized noise-assisted simulation of the Lindblad equation with time-dependent coefficients on a noisy quantum processor
• Techniques for learning sparse Pauli-Lindblad noise models
• Pauli Decomposition via the Fast Walsh-Hadamard Transform
• Stability of classical shadows under gate-dependent noise
• Quantum subspace expansion in the presence of hardware noise
• Virtual distillation with noise dilution
• Mitigating Quantum Errors via Truncated Neumann Series
• A generalized cycle benchmarking algorithm for characterizing mid-circuit measurements
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis
• Pauli Noise Learning for Mid-Circuit Measurements
• Efficient diagnostics for quantum error correction
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Navigating the noise-depth tradeoff in adiabatic quantum circuits
• Scalable fast benchmarking for individual quantum gates with local twirling
• Group twirling and noise tailoring for multi-qubit controlled phase gates
• Disti-Mator: an entanglement distillation-based state estimator
• Efficient self-consistent learning of gate set Pauli noise
• ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures
• Estimating the bias of CX gates via character randomized benchmarking
• Pauli transfer matrix direct reconstruction: channel characterization without full process tomography
• Synchronization for Fault-Tolerant Quantum Computers
• Lower Bounds on Learning Pauli Channels with Individual Measurements
• Multiqubit noise deconvolution and characterization
• Quantum simulation of Pauli channels and dynamical maps: algorithm and implementation
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Error Mitigation Thresholds in Noisy Random Quantum Circuits
• Automated quantum error mitigation based on probabilistic error reduction
• Detecting and Eliminating Quantum Noise of Quantum Measurements
• Theory of quantum error mitigation for non-Clifford gates
• Quantum Software Ecosystem Design
• Learning the noise fingerprint of quantum devices
• Bosonic randomized benchmarking with passive transformations
• Agnostic Process Tomography
• Characterizing physical and logical errors in a transversal CNOT via cycle error reconstruction
• Learning the structure of any Hamiltonian from minimal assumptions
• Corrupted sensing quantum state tomography
• Real-time adaptation of quantum noise channel estimates
• Adaptivity is not helpful for Pauli channel learning
• Dual Map Framework for Noise Characterization of Quantum Computers
• Quantum Noise Sensing by generating Fake Noise
• Optimizing Circuit Reusing and its Application in Randomized Benchmarking
• Fermionic Averaged Circuit Eigenvalue Sampling
• Decoded Quantum Interferometry Under Noise
• Beating the Optimal Verification of Entangled States via Collective Strategies
• Disambiguating Pauli noise in quantum computers
• On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning
• Approximate Quantum Error Correction with 1D Log-Depth Circuits