Random quantum circuits transform local noise into global white noise

DOI10.1007/S00220-024-04958-ZarXiv2111.14907OpenAlexW3215183963MaRDI QIDQ6202916FDOQ6202916

Authors: Alexander M. Dalzell, Nicholas Hunter-Jones, Fernando G. S. L. Brandão 

Publication date: 26 March 2024

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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 $p_{extnoisy}$ of a generic noisy circuit instance and the output distribution $p_{extideal}$ of the corresponding noiseless instance shrink exponentially with the expected number of gate-level errors, as $F=extexp(-2sepsilonpmO(sepsilo{n}^2))$, where $epsilon$ is the probability of error per circuit location and $s$ is the number of two-qubit gates. Furthermore, if the noise is incoherent, the output distribution approaches the uniform distribution $p_{extunif}$ at precisely the same rate and can be approximated as $p_{extnoisy}approxF{p}_{extideal}+(1-F)p_{extunif}$, 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 $O(Fepsilonsqrts)$, so the "white-noise approximation" is meaningful when $epsilonsqrtsll1$, a quadratically weaker condition than the $epsilonsll1$ requirement to maintain high fidelity. The bound applies when the circuit size satisfies $sgeqOmega(nlog(n))$ and the inverse error rate satisfies $epsilo{n}^{-1}geqildeOmega(n)$. 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.

Full work available at URL: https://arxiv.org/abs/2111.14907

Mathematics Subject Classification ID

Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx) General quantum mechanics and problems of quantization (81Sxx)

Cites Work

• Computational Complexity
• Title not available (Why is that?)
• A spectral gap theorem in SU\((d)\)
• The computational complexity of linear optics
• Fault-Tolerant Quantum Computation with Constant Error Rate
• Random quantum circuits are approximate 2-designs
• Estimating the coherence of noise
• Decoupling with random quantum circuits
• Local random quantum circuits are approximate polynomial-designs
• The emergence of typical entanglement in two-party random processes
• Holographic duality from random tensor networks
• Erratum to: Onset of random matrix behavior in scrambling systems
• Mixing properties of stochastic quantum Hamiltonians
• 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.
• Fast amplification of QMA
• Title not available (Why is that?)
• Statistical aspects of the quantum supremacy demonstration
• Quantum Supremacy and the Complexity of Random Circuit Sampling

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)