Random quantum circuits transform local noise into global white noise
From MaRDI portal
Publication:6202916
Abstract: We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. We show that, for local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution of a generic noisy circuit instance and the output distribution of the corresponding noiseless instance shrink exponentially with the expected number of gate-level errors, as , where is the probability of error per circuit location and is the number of two-qubit gates. Furthermore, if the noise is incoherent, the output distribution approaches the uniform distribution at precisely the same rate and can be approximated as , that is, local errors are scrambled by the random quantum circuit and contribute only white noise (uniform output). Importantly, we upper bound the total variation error (averaged over random circuit instance) in this approximation as , so the "white-noise approximation" is meaningful when , a quadratically weaker condition than the requirement to maintain high fidelity. The bound applies when the circuit size satisfies and the inverse error rate satisfies . The white-noise approximation is useful for salvaging the signal from a noisy quantum computation; it was an underlying assumption in complexity-theoretic arguments that low-fidelity random quantum circuits cannot be efficiently sampled classically. Our method is based on a map from second-moment quantities in random quantum circuits to expectation values of certain stochastic processes for which we compute upper and lower bounds.
Recommendations
- Can shallow quantum circuits scramble local noise into global white noise?
- Upper bounds on the noise threshold for fault-tolerant quantum computing
- Classically simulating quantum circuits with local depolarizing noise
- Upper Bounds on the Noise Threshold for Fault-Tolerant Quantum Computing
- Random quantum circuits are approximate 2-designs
Cites work
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- A spectral gap theorem in SU\((d)\)
- Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Complexity-theoretic foundations of quantum supremacy experiments
- Computational Complexity
- Decoupling with random quantum circuits
- Estimating the coherence of noise
- Fast amplification of QMA
- Fault-Tolerant Quantum Computation with Constant Error Rate
- Holographic duality from random tensor networks
- Local random quantum circuits are approximate polynomial-designs
- Mixing properties of stochastic quantum Hamiltonians
- Quantum Supremacy and the Complexity of Random Circuit Sampling
- Random quantum circuits are approximate 2-designs
- Statistical aspects of the quantum supremacy demonstration
- The computational complexity of linear optics
- The emergence of typical entanglement in two-party random processes
This page was built for publication: Random quantum circuits transform local noise into global white noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202916)