Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2306.16659 · PRX Quantum

Effect of Nonunital Noise on Random-Circuit Sampling

Bill Fefferman, Soumik Ghosh, Michael J. Gullans, Kohdai Kuroiwa, Kunal Sharma

Published Jul 26, 2024• 40 citations
arXivHTMLPDF

Abstract

In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical nonunital noise sources with constant noise rates. We show that even in the presence of unital sources such as the depolarizing channel, the distribution, under the combined noise channel, never resembles a maximally entropic distribution at any depth. To show this, we prove that the output distribution of such circuits never anticoncentrates—meaning that it is never too “flat”—regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths. As a consequence, our results shows that the complexity of random-circuit sampling under realistic noise is still an open question, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results. Published by the American Physical Society 2024

DOI
10.1103/prxquantum.5.030317

Related papers

Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution

Abhinav Deshpande, Pradeep Niroula, Oles Shtanko +3 more

We study the properties of output distributions of noisy random circuits.We obtain upper and lower bounds on the expected distance of the output distribution from the "useless" uniform distribution.These bounds are tight with respect to the dependence on circuit depth.Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits.We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation.Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques.We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.

arXiv:2112.00716•PRX Quantum•Dec 16, 2022•64 citations

A polynomial-time classical sampler for noisy quantum circuits from statistical mechanics

Jon Nelson, Joel Rajakumar, Chao Yin +2 more

Developing classical simulation algorithms for noisy quantum circuits is essential to delineating the limits of quantum advantage. Existing classical sampling approaches for general circuits require circuit depths to grow logarithmically with system size, so that noise drives the global output state close to a trivial state. Here we show that local accumulation of noise at a depth independent of system size is already sufficient. Specifically, we prove that any geometrically local circuit composed of unital operations and interspersed with single-qubit depolarizing noise of strength $p$ after $Θ(p^{-1} \log p^{-1})$ depth can be approximately sampled from a polynomial-time classical computer. This generalizes existing results that impose anticoncentration assumptions or non-universal gate sets in order to obtain a classical sampler at such shallow depths. Our proof maps the output state of the circuit to a polymer model in statistical mechanics, and combines a convergent cluster expansion with hypercontractivity of the depolarizing channel.

quant-pharXiv:2610.00548•Oct 2, 2026•1 citation

Complexity of Local Quantum Circuits under Nonunital Noise

Oles Shtanko, Kunal Sharma

It is widely accepted that noisy quantum devices are limited to logarithmic depth circuits unless midcircuit measurements and error correction are employed. However, this conclusion holds only for unital error channels, such as depolarizing noise. Building on the idea of the “quantum refrigerator” Ben-Or [Quantum refrigerator, arXiv1301.1995 (2013)], we improve upon previous results and show that geometrically local circuits in the presence of nonunital noise, in any dimension d ≥ 1 , can correct errors without midcircuit measurements and extend computation to any depth, with only polylogarithmic overhead in the depth and the number of qubits. This implies that local quantum dynamics subjected to sufficiently weak nonunital noise are computationally universal and nearly as hard to simulate as noiseless dynamics. Additionally, we quantify the contraction property of local random circuits in the presence of nonunital noise.

arXiv:2411.04819•PRX Quantum•Jul 16, 2025•8 citations

Hardness and Complexity Transition of Noisy Random Circuit Sampling

Byeongseon Go, Changhun Oh, Hyunseok Jeong

Random circuit sampling (RCS) is a leading candidate for demonstrating quantum advantage, supported by strong complexity-theoretic evidence of hardness in the ideal setting and by rapid experimental progress to date. In practice, however, noise is unavoidable, and a central problem is to identify the noise-strength boundary between classically simulable and classically hard regimes. In this work, we establish an architecture-general hardness bound for this boundary for the standard local depolarizing noise of strength $γ$. Assuming the standard average-case #P-hardness conjecture for ideal RCS, we show that, for any circuit architecture satisfying this conjecture, noisy RCS on the same architecture remains hard to simulate classically within any inverse-polynomial total variation distance whenever $γ=O(\log n/(nd))$ for $n$-qubit circuits of depth $d$, unless the polynomial hierarchy collapses. Crucially, noisy-RCS hardness follows without any additional conjectural or architecture-specific assumption beyond those already entering the ideal-RCS hardness framework. Our proof combines a low-degree polynomial extrapolation with a monotonicity reduction showing that efficient classical simulation at one depolarizing noise strength implies efficient simulation at every larger strength. Together, these ingredients transfer the standard ideal-RCS hardness conjecture to sampling hardness at a prespecified noise strength. Finally, combining the convergence-to-uniformity result of Dalzell et al. [Commun. Math. Phys. 405, 78 (2024)] with our monotonicity reduction yields efficient classical simulation for $γ=ω(\log n/(nd))$ on layered, regularly connected architectures. Thus, wherever the two architectural settings overlap, this identifies $γ=Θ(\log n/(nd))$ as the asymptotic complexity-transition scale.

quant-pharXiv:2607.20804•Jul 24, 2026•2 citations

Sample-efficient benchmarking of shallow all-to-all random quantum circuits

Gregory Bentsen, Bill Fefferman, Soumik Ghosh +2 more

Random circuit sampling (RCS) remains one of the most competitive frameworks for demonstrating quantum advantage in near-term noisy intermediate-scale quantum (NISQ) hardware. Unfortunately, absent error-correction, existing benchmarks to characterize these experiments, like linear cross-entropy, have been classically spoofed due to noise. Because of this, there are interesting regimes, like shallow-depth random quantum circuits, where sampling is plausibly classically intractable, but no existing benchmark can distinguish between a noisy quantum computer and an adversarial classical spoofer. In this paper, we demonstrate that the nonlinear cross-entropy provides a sample-efficient benchmark for shallow-depth all-to-all random quantum circuits whose score cleanly separates noisy quantum computers from state-of-the-art classical spoofers, even in the presence of depolarizing noise. Further, we develop a binary classifier based on the notion of heavy output generation that features logarithmic sample complexity at short depth. Our evidence comes from exact analytic expressions for all-to-all Brownian circuit ensembles derived using replica tricks, and numerical simulations that corroborate these results for discrete Haar-random unitary circuits.

quant-pharXiv:2605.22909•May 25, 2026•2 citations

Universality in the Anticoncentration of Noisy Quantum Circuits at Finite Depths

Arman Sauliere, Guglielmo Lami, Corentin Boyer +2 more

We present universal properties of anticoncentration in noisy quantum circuits at finite depth. We develop a generic framework for single- and multi-qubit noise channels in the weak-noise limit and introduce an effective description in terms of a . Within this weak-noise regime, we show that distinct noise mechanisms act in a quantitatively similar way, yielding a universal distribution of bit-string probabilities that is largely independent of the microscopic noise channel and of the circuit architecture. We identify three depth-dependent regimes, each characterized by a distinct scaling of cross-entropy benchmarking ( XEB ) with rescaled depth. In the shallow-depth regime, noise effects are perturbatively small; in the intermediate regime, circuit-induced fluctuations and noise compete on equal footing; and in the deep-depth regime, the output distribution becomes effectively classical, up to corrections that are exponentially small in the noise strength. We provide quantitative predictions for anticoncentration in generic finite-depth circuits and benchmark them against numerical simulations, finding excellent agreement even at shallow depths. Moreover, we show that, contrary to previous expectations, the late-time value of XEB provides direct access to the global circuit fidelity, even at large noise strengths. Our results are directly applicable to current quantum processors and demonstrate universal behavior beyond the pure random-matrix-theory regime, which only emerges at asymptotically large depths.

arXiv:2508.14975•PRX Quantum•Mar 17, 2026•11 citations
In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical nonunital noise sources with constant noise rates. We show that even in the presence of unital sources such as the depolarizing channel, the distribution, under the combined noise channel, never resembles a maximally entropic distribution at any depth. To show this, we prove that the output distribution of such circuits never anticoncentrates—meaning that it is never too “flat”—regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths. As a consequence, our results shows that the complexity of random-circuit sampling under realistic noise is still an open question, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results. Published by the American Physical Society 2024
We study the properties of output distributions of noisy random circuits.We obtain upper and lower bounds on the expected distance of the output distribution from the "useless" uniform distribution.These bounds are tight with respect to the dependence on circuit depth.Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits.We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation.Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques.We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.
Developing classical simulation algorithms for noisy quantum circuits is essential to delineating the limits of quantum advantage. Existing classical sampling approaches for general circuits require circuit depths to grow logarithmically with system size, so that noise drives the global output state close to a trivial state. Here we show that local accumulation of noise at a depth independent of system size is already sufficient. Specifically, we prove that any geometrically local circuit composed of unital operations and interspersed with single-qubit depolarizing noise of strength ppp after Θ(p−1log⁡p−1)Θ(p^{-1} \log p^{-1})Θ(p−1logp−1) depth can be approximately sampled from a polynomial-time classical computer. This generalizes existing results that impose anticoncentration assumptions or non-universal gate sets in order to obtain a classical sampler at such shallow depths. Our proof maps the output state of the circuit to a polymer model in statistical mechanics, and combines a convergent cluster expansion with hypercontractivity of the depolarizing channel.
It is widely accepted that noisy quantum devices are limited to logarithmic depth circuits unless midcircuit measurements and error correction are employed. However, this conclusion holds only for unital error channels, such as depolarizing noise. Building on the idea of the “quantum refrigerator” Ben-Or [Quantum refrigerator, arXiv1301.1995 (2013)], we improve upon previous results and show that geometrically local circuits in the presence of nonunital noise, in any dimension d ≥ 1 , can correct errors without midcircuit measurements and extend computation to any depth, with only polylogarithmic overhead in the depth and the number of qubits. This implies that local quantum dynamics subjected to sufficiently weak nonunital noise are computationally universal and nearly as hard to simulate as noiseless dynamics. Additionally, we quantify the contraction property of local random circuits in the presence of nonunital noise.
Random circuit sampling (RCS) is a leading candidate for demonstrating quantum advantage, supported by strong complexity-theoretic evidence of hardness in the ideal setting and by rapid experimental progress to date. In practice, however, noise is unavoidable, and a central problem is to identify the noise-strength boundary between classically simulable and classically hard regimes. In this work, we establish an architecture-general hardness bound for this boundary for the standard local depolarizing noise of strength γγγ. Assuming the standard average-case #P-hardness conjecture for ideal RCS, we show that, for any circuit architecture satisfying this conjecture, noisy RCS on the same architecture remains hard to simulate classically within any inverse-polynomial total variation distance whenever γ=O(log⁡n/(nd))γ=O(\log n/(nd))γ=O(logn/(nd)) for nnn-qubit circuits of depth ddd, unless the polynomial hierarchy collapses. Crucially, noisy-RCS hardness follows without any additional conjectural or architecture-specific assumption beyond those already entering the ideal-RCS hardness framework. Our proof combines a low-degree polynomial extrapolation with a monotonicity reduction showing that efficient classical simulation at one depolarizing noise strength implies efficient simulation at every larger strength. Together, these ingredients transfer the standard ideal-RCS hardness conjecture to sampling hardness at a prespecified noise strength. Finally, combining the convergence-to-uniformity result of Dalzell et al. [Commun. Math. Phys. 405, 78 (2024)] with our monotonicity reduction yields efficient classical simulation for γ=ω(log⁡n/(nd))γ=ω(\log n/(nd))γ=ω(logn/(nd)) on layered, regularly connected architectures. Thus, wherever the two architectural settings overlap, this identifies γ=Θ(log⁡n/(nd))γ=Θ(\log n/(nd))γ=Θ(logn/(nd)) as the asymptotic complexity-transition scale.
Random circuit sampling (RCS) remains one of the most competitive frameworks for demonstrating quantum advantage in near-term noisy intermediate-scale quantum (NISQ) hardware. Unfortunately, absent error-correction, existing benchmarks to characterize these experiments, like linear cross-entropy, have been classically spoofed due to noise. Because of this, there are interesting regimes, like shallow-depth random quantum circuits, where sampling is plausibly classically intractable, but no existing benchmark can distinguish between a noisy quantum computer and an adversarial classical spoofer. In this paper, we demonstrate that the nonlinear cross-entropy provides a sample-efficient benchmark for shallow-depth all-to-all random quantum circuits whose score cleanly separates noisy quantum computers from state-of-the-art classical spoofers, even in the presence of depolarizing noise. Further, we develop a binary classifier based on the notion of heavy output generation that features logarithmic sample complexity at short depth. Our evidence comes from exact analytic expressions for all-to-all Brownian circuit ensembles derived using replica tricks, and numerical simulations that corroborate these results for discrete Haar-random unitary circuits.
We present universal properties of anticoncentration in noisy quantum circuits at finite depth. We develop a generic framework for single- and multi-qubit noise channels in the weak-noise limit and introduce an effective description in terms of a . Within this weak-noise regime, we show that distinct noise mechanisms act in a quantitatively similar way, yielding a universal distribution of bit-string probabilities that is largely independent of the microscopic noise channel and of the circuit architecture. We identify three depth-dependent regimes, each characterized by a distinct scaling of cross-entropy benchmarking ( XEB ) with rescaled depth. In the shallow-depth regime, noise effects are perturbatively small; in the intermediate regime, circuit-induced fluctuations and noise compete on equal footing; and in the deep-depth regime, the output distribution becomes effectively classical, up to corrections that are exponentially small in the noise strength. We provide quantitative predictions for anticoncentration in generic finite-depth circuits and benchmark them against numerical simulations, finding excellent agreement even at shallow depths. Moreover, we show that, contrary to previous expectations, the late-time value of XEB provides direct access to the global circuit fidelity, even at large noise strengths. Our results are directly applicable to current quantum processors and demonstrate universal behavior beyond the pure random-matrix-theory regime, which only emerges at asymptotically large depths.