The learnability of Pauli noise
arXiv:2206.06362 · doi:10.1038/s41467-022-35759-4
Abstract
Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today's quantum devices. A well-known issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question of what information about noise is learnable and what is not, which has been unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates, showing that learnable information corresponds to the cycle space of the pattern transfer graph of the gate set, while unlearnable information corresponds to the cut space. This implies the optimality of cycle benchmarking, in the sense that it can learn all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM's CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we give an attempt to characterize the unlearnable information by assuming perfect initial state preparation. However, based on the experimental data, we conclude that this assumption is inaccurate as it yields unphysical estimates, and we obtain a lower bound on state preparation noise.
33 pages, 11 figures. Close to accepted version
References in corpus (4)
Cited by in corpus (29)
- Generative quantum machine learning via denoising diffusion probabilistic models
- A Practical Introduction to Benchmarking and Characterization of Quantum Computers
- Dynamical simulations of many-body quantum chaos on a quantum computer
- Tight bounds on Pauli channel learning without entanglement
- Tensor network noise characterization for near-term quantum computers
- Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
- 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
- A generalized cycle benchmarking algorithm for characterizing mid-circuit measurements
- Pauli Noise Learning for Mid-Circuit Measurements
- Quantum computer error structure probed by quantum error correction syndrome measurements
- Group twirling and noise tailoring for multi-qubit controlled phase gates
- Disti-Mator: an entanglement distillation-based state estimator
- Ansatz-free Hamiltonian learning with Heisenberg-limited scaling
- Efficient self-consistent learning of gate set Pauli noise
- Scoring Anomalous Vertices Through Quantum Walks
- Quantum noise modeling through Reinforcement Learning
- Theory of quantum error mitigation for non-Clifford gates
- Characterizing physical and logical errors in a transversal CNOT via cycle error reconstruction
- Trotterless Simulation of Open Quantum Systems for NISQ Quantum Devices
- Adaptivity is not helpful for Pauli channel learning
- Variational quantum algorithms with invariant probabilistic error cancellation on noisy quantum processors
- Corrupted sensing quantum state tomography
- Benchmarking non-Clifford gates using only Pauli twirling group
- Reduced Sampling Overhead for Probabilistic Error Cancellation by Pauli Error Propagation
- Fermionic Averaged Circuit Eigenvalue Sampling
- Disambiguating Pauli noise in quantum computers
- Mitigating errors in state preparation and measurement with noncomputational states
- Simplifying errors by symmetry and randomisation