Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
arXiv:2409.01000 · doi:10.1038/s42005-025-02217-8
Abstract
Decoherence severely limits the performance of quantum processors, posing challenges to reliable quantum computation. Probabilistic error cancellation, a quantum error mitigation method, counteracts noise by quasiprobabilistically simulating (non-physical) inverse noise operations. However, existing formulations of physical implementability, quantifying the minimal cost of simulating non-physical operations using physical channels, do not fully account for the experimental constraints, since noise also affects the cancellation process and not all physical channels are experimentally accessible. Here, we generalize the physical implementability to encompass arbitrary convex sets of experimentally available quantum states and operations. Within this generalized framework, we demonstrate noiseless error cancellation with noisy Pauli operations and analyze the bias of noisy cancellation. Furthermore, we establish connections between generalized physical implementability and quantum information measures, e.g., diamond norm, logarithmic negativity, and purity. These findings enhance the practical applicability of probabilistic error cancellation and open new avenues for robust quantum information processing and quantum computing.
References in corpus (31)
- The logarithmic negativity: A full entanglement monotone that is not convex
- Error mitigation for short-depth quantum circuits
- Quantum Error Correction for Quantum Memories
- Quantum Resource Theories
- Quantum Error Mitigation
- Noise tailoring for scalable quantum computation via randomized compiling
- Quantum Process Tomography: Resource Analysis of Different Strategies
- The general structure of quantum resource theories
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Characterizing large-scale quantum computers via cycle benchmarking
- Efficient learning of quantum noise
- Doubling the size of quantum simulators by entanglement forging
- Fundamental limits of quantum error mitigation
- Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
- A general framework for randomized benchmarking
- Efficient estimation of Pauli channels
- Physical accessibility of non-completely positive maps
- Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits
- Circuit knitting with classical communication
- Convex geometry of quantum resource quantification
- Mitigating realistic noise in practical noisy intermediate-scale quantum devices
- Constructing a virtual two-qubit gate by sampling single-qubit operations
- Quasiprobability decompositions with reduced sampling overhead
- Optimal resource cost for error mitigation
- Quantum error mitigation via matrix product operators
- Overhead for simulating a non-local channel with local channels by quasiprobability sampling
- Noise-assisted digital quantum simulation of open systems
- Physical Implementability of Linear Maps and Its Application in Error Mitigation
- Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
- Operational applications of the diamond norm and related measures in quantifying the non-physicality of quantum maps
- Efficiently improving the performance of noisy quantum computers