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:2610.02125

Local random quantum circuits converge to the Porter-Thomas distribution in polynomial depth

Aniruddha Sen, Nicholas Hunter-Jones

quant-phcond-mat.stat-mechSubmitted Oct 1, 2026• Announced Oct 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Porter-Thomas statistics are a characteristic feature of the output distribution of random quantum states and, more broadly, chaotic quantum many-body systems. Convergence to Porter-Thomas plays a central role in random circuit sampling and experimental demonstrations of quantum advantage, where the output statistics of low-depth random quantum circuits are expected to be approximately Porter-Thomas, despite the absence of a rigorous proof of convergence. We show that the output distribution of polynomial-depth brickwork random circuits converges inverse-polynomially in total variation distance to the Porter-Thomas distribution. Specifically, consider the output probability distribution over a fixed bitstring of a local random quantum circuit, constructed from nearest-neighbor Haar random gates. Then, for any $m \geq 0$, the distribution corresponding to circuits of depth $O(n^{2m+1}\log(n))$ is at most $O(1/n^m)$ far in total variation distance from the Porter-Thomas distribution. Our proof uses moment bounds from approximate designs, analytic estimates for characteristic functions, and a local anticoncentration property for inverse moments.

AI Summary

The paper asks whether polynomial-depth local random circuits reproduce Porter–Thomas statistics in total variation distance, rather than merely matching finitely many moments. It studies a fixed output bitstring $b$ and the distribution of $p_U(b)=|\langle b|U|0^n\rangle|^2$ over random circuits, not the empirical distribution across bitstrings of a single circuit. The ensemble consists of one-dimensional brickwork circuits with independent nearest-neighbor Haar-random two-qubit gates and periodic boundaries. For circuits forming a $d^{-k}$-approximate unitary $k$-design, with $d=2^n$, the stated bound is $d_{\mathrm{TV}}(p_U(b),p_{\mathrm{Haar}}(b))=O(\sqrt{\log k/k})$. Using a design-depth bound $O(nk)$, this yields error $O(n^{-m})$ at depth $O(n^{2m+1}\log n)$ for fixed $m>0$. The exact Haar probability law is $\mathrm{Beta}(1,d-1)$, whose TV distance from the exponential Porter–Thomas law is $O(2^{-n})$. The proof combines moment control of low-frequency characteristic functions, analytic continuation bounds using the Hadamard three-circle theorem for intermediate frequencies, and mollification to remove high frequencies. The required density regularity follows from a last-gate Beta-mixture representation and an inverse-moment estimate $\mathbb E[R^{-1}]=O(d)$, established through local negative-moment bounds and design-based concentration. The depth bounds are not claimed tight. Sublinear-depth convergence, extensions to other architectures, and convergence under noise remain open. The stated techniques do not yield inverse-exponentially small TV error at polynomial depth.

Little sign of AI-generated textAI use disclosedOverclaims
Generative AI provided some of the main ideas (and figure) in the proof of \cref{thm:inverse-moment}, and the initial ideas for proofs in the Appendix

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
28 pages, 1 figure

Related papers

On the complexity of sampling from shallow Brownian circuits

Gregory S. Bentsen, Bill Fefferman, Soumik Ghosh +2 more

While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitaries, the statistics of constant-depth random quantum circuits are generally less well-understood due to a lack of amenable tools and techniques. We circumvent this barrier by considering a related constant-time Brownian circuit model which shares many similarities with constant-depth random quantum circuits but crucially allows for direct calculations of higher order moments of its output distribution. Using mean-field (large-n) techniques, we fully characterize the output distributions of Brownian circuits at shallow depths and show that they follow a Porter-Thomas distribution, just like in the case of deep circuits, but with a truncated Hilbert space. The access to higher order moments allows for studying the expected and typical Linear Cross-entropy (XEB) benchmark scores achieved by an ideal quantum computer versus the state-of-the-art classical spoofers for shallow Brownian circuits. We discover that for these circuits, while the quantum computer typically scores within a constant factor of the expected value, the classical spoofer suffers from an exponentially larger variance. Numerical evidence suggests that the same phenomenon also occurs in constant-depth discrete random quantum circuits, like those defined over the all-to-all architecture. We conjecture that the same phenomenon is also true for random brickwork circuits in high enough spatial dimension.

arXiv:2411.04169•Nov 6, 2024•4 citations

Random Quantum Circuits Beyond Moment Matching

Shih-Han Hung

Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong $\varepsilon$-approximate unitary $k$-design on $n$ qubits, the distribution of each output probability is within $O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)$ in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters $1$ and $2^n-1$. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance $O(k^{-1/2}+\varepsilon)$. Every strong $\varepsilon$-approximate unitary $k$-design invariant on $\log k+O(1)$ qubits achieves error $2^{-Ω(k)}+O(\varepsilon)$ in Kolmogorov distance and $2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))$ in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong $\varepsilon$-approximate $k$-design is concentrated around its Haar value $n-Θ(1)$: its mean differs from the Haar mean by $O(k^{-1/4}+\varepsilon^{1/2})$ and its standard deviation is $O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})$. Consequently, a trusted device sampling such circuits generates $n-O(1)$ bits of entropy per sample, which makes them useful for random number generation.

quant-pharXiv:2610.02135•Oct 2, 2026•0 citations

Fermionic Porter-Thomas statistics and their emergence in random matchgate circuits

Guglielmo Lami

For Haar-random quantum states, measurement probabilities follow the universal Porter--Thomas distribution. This implies anticoncentration, i.e.\ the spreading of probability over exponentially many outcomes, a key property underlying random-circuit-sampling experiments. We derive the exact analogue of the Porter--Thomas law for random fermionic Gaussian states, both with and without particle-number conservation. We also consider Clifford Gaussian states, for which the problem maps onto a simple model of arcs and loops. For large systems the probabilities become log-normally distributed, with moments growing polynomially in system size. Free-fermion states thus anticoncentrate only up to polynomial factors. We then show how this fermionic Porter--Thomas law emerges in random one-dimensional brickwork matchgate circuits. A simple single-arc approximation accurately describes the full distribution of probabilities, revealing an early diffusive regime followed by a slow relaxation on times scaling as the square of the system size. We rigorously prove that depths growing almost quadratically with system size are required for the collision probability to converge. Finally, we show that ideal free-fermion sampling yields large linear cross-entropy scores, and propose a log-based benchmark with an exact fermionic normalization.

arXiv:2611.05479•Nov 3, 2026•0 citations

Observation of Universal Quantum Chaos at Shallow Depths

Arman Sauliere, Guglielmo Lami, Hugo Lóio +5 more

Universal statistical laws are a hallmark of quantum chaos. A natural route to probing them in quantum circuits is offered by the statistics of output probabilities, which for sufficiently deep chaotic circuits approach the Porter--Thomas distribution. Here we show, theoretically and experimentally, that the approach to this limit is itself universal, and is organized into geometry-dependent universality classes. At shallow depths, growing only logarithmically with system size, we derive universal output-probability distributions that differ markedly from Porter--Thomas statistics, and we test them on a programmable superconducting processor. Two-dimensional lattices, open one-dimensional chains, and periodic rings exhibit distinct universal forms, retaining signatures of geometry and boundary topology within the same logarithmic-depth regime. Within each class, the distributions depend on only two parameters: an effective many-body Thouless scale and the accumulated number of incoherent errors. Extracting these directly from measured bitstring frequencies provides access to scrambling, entanglement growth of the target state, and global fidelity, without reconstructing or classically simulating the implemented circuit. We also identify a noise-driven transition between output statistics retaining system-wide quantum correlations and those reproducible by independent small patches. Our results establish universality beyond Porter--Thomas statistics as a quantitative tool for characterizing noisy quantum processors.

quant-pharXiv:2609.28623•Sep 25, 2026•1 citation

Fourier analysis of sampling from noisy chaotic quantum circuits

Sergio Boixo, Vadim Smelyanskiy, Hartmut Neven

Sampling from the output distribution of chaotic quantum evolutions, and of pseudo-random universal quantum circuits in particular, has been proposed as a prominent milestone for near-term quantum supremacy. The same paper notes that chaotic distributions are very sensitive to noise, and under quite general noise models converge to the uniform distribution over bit-strings exponentially in the number of gates. On the one hand, for increasing number of gates, it suffices to choose bit-strings at random to approximate the noisy distribution with fixed statistical distance. On the other hand, cross-entropy benchmarking can be used to gauge the fidelity of an experiment, and the distance to the uniform distribution. We estimate that state-of-the-art classical supercomputers would fail to simulate high-fidelity chaotic quantum circuits with approximately fifty qubits and depth forty. A recent interesting paper proposed a different approximation algorithm to a noisy distribution, extending previous results on the Fourier analysis of commuting quantum circuits. Using the statistical properties of the Porter-Thomas distribution, we show that this new approximation algorithm does not improve random guessing, in polynomial time. Therefore, it confirms previous results and does not represent an additional challenge to the suggested failure stated above.

arXiv:1708.01875•Aug 6, 2017•28 citations

Ideal random quantum circuits pass the LXEB test

Nicholas Hunter-Jones, Jonas Haferkamp

We show that noiseless random quantum circuits pass the linear cross-entropy benchmark (LXEB) test with high probability. If the circuits are linear depth, and thus form unitary 4-designs, the LXEB test is passed with probability $1-O(1/\sqrt{k})$, where $k$ is the number of independently drawn samples from the output distribution of the random circuit. If the circuits are of depth $\tilde O(n^2)$, and thus form unitary $n$-designs, the LXEB test is passed with probability $1-O(e^{-k \log(n)/n})$. In proving our results, we show strong concentration of the random circuit collision probability at linear depth and establish that the tails of the distribution of random circuit output probabilities start to resemble Porter-Thomas at near-quadratic depths. Our analysis employs higher moments and high-degree approximate designs.

quant-pharXiv:2602.22692•Feb 27, 2026•2 citations
Porter-Thomas statistics are a characteristic feature of the output distribution of random quantum states and, more broadly, chaotic quantum many-body systems. Convergence to Porter-Thomas plays a central role in random circuit sampling and experimental demonstrations of quantum advantage, where the output statistics of low-depth random quantum circuits are expected to be approximately Porter-Thomas, despite the absence of a rigorous proof of convergence. We show that the output distribution of polynomial-depth brickwork random circuits converges inverse-polynomially in total variation distance to the Porter-Thomas distribution. Specifically, consider the output probability distribution over a fixed bitstring of a local random quantum circuit, constructed from nearest-neighbor Haar random gates. Then, for any m≥0m \geq 0m≥0, the distribution corresponding to circuits of depth O(n2m+1log⁡(n))O(n^{2m+1}\log(n))O(n2m+1log(n)) is at most O(1/nm)O(1/n^m)O(1/nm) far in total variation distance from the Porter-Thomas distribution. Our proof uses moment bounds from approximate designs, analytic estimates for characteristic functions, and a local anticoncentration property for inverse moments.
The paper asks whether polynomial-depth local random circuits reproduce Porter–Thomas statistics in total variation distance, rather than merely matching finitely many moments. It studies a fixed output bitstring bbb and the distribution of pU(b)=∣⟨b∣U∣0n⟩∣2p_U(b)=|\langle b|U|0^n\rangle|^2pU​(b)=∣⟨b∣U∣0n⟩∣2 over random circuits, not the empirical distribution across bitstrings of a single circuit. The ensemble consists of one-dimensional brickwork circuits with independent nearest-neighbor Haar-random two-qubit gates and periodic boundaries.
For circuits forming a d−kd^{-k}d−k-approximate unitary kkk-design, with d=2nd=2^nd=2n, the stated bound is dTV(pU(b),pHaar(b))=O(log⁡k/k)d_{\mathrm{TV}}(p_U(b),p_{\mathrm{Haar}}(b))=O(\sqrt{\log k/k})dTV​(pU​(b),pHaar​(b))=O(logk/k​). Using a design-depth bound O(nk)O(nk)O(nk), this yields error O(n−m)O(n^{-m})O(n−m) at depth O(n2m+1log⁡n)O(n^{2m+1}\log n)O(n2m+1logn) for fixed m>0m>0m>0. The exact Haar probability law is Beta(1,d−1)\mathrm{Beta}(1,d-1)Beta(1,d−1), whose TV distance from the exponential Porter–Thomas law is O(2−n)O(2^{-n})O(2−n).
The proof combines moment control of low-frequency characteristic functions, analytic continuation bounds using the Hadamard three-circle theorem for intermediate frequencies, and mollification to remove high frequencies. The required density regularity follows from a last-gate Beta-mixture representation and an inverse-moment estimate E[R−1]=O(d)\mathbb E[R^{-1}]=O(d)E[R−1]=O(d), established through local negative-moment bounds and design-based concentration.
The depth bounds are not claimed tight. Sublinear-depth convergence, extensions to other architectures, and convergence under noise remain open. The stated techniques do not yield inverse-exponentially small TV error at polynomial depth.
While many statistical properties of deep random quantum circuits can be deduced, often rigorously and other times heuristically, by an approximation to global Haar-random unitaries, the statistics of constant-depth random quantum circuits are generally less well-understood due to a lack of amenable tools and techniques. We circumvent this barrier by considering a related constant-time Brownian circuit model which shares many similarities with constant-depth random quantum circuits but crucially allows for direct calculations of higher order moments of its output distribution. Using mean-field (large-n) techniques, we fully characterize the output distributions of Brownian circuits at shallow depths and show that they follow a Porter-Thomas distribution, just like in the case of deep circuits, but with a truncated Hilbert space. The access to higher order moments allows for studying the expected and typical Linear Cross-entropy (XEB) benchmark scores achieved by an ideal quantum computer versus the state-of-the-art classical spoofers for shallow Brownian circuits. We discover that for these circuits, while the quantum computer typically scores within a constant factor of the expected value, the classical spoofer suffers from an exponentially larger variance. Numerical evidence suggests that the same phenomenon also occurs in constant-depth discrete random quantum circuits, like those defined over the all-to-all architecture. We conjecture that the same phenomenon is also true for random brickwork circuits in high enough spatial dimension.
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong ε\varepsilonε-approximate unitary kkk-design on nnn qubits, the distribution of each output probability is within O(k−1/2(1+k/2n)−1/2+ε)O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)O(k−1/2(1+k/2n)−1/2+ε) in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters 111 and 2n−12^n-12n−1. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance O(k−1/2+ε)O(k^{-1/2}+\varepsilon)O(k−1/2+ε). Every strong ε\varepsilonε-approximate unitary kkk-design invariant on log⁡k+O(1)\log k+O(1)logk+O(1) qubits achieves error 2−Ω(k)+O(ε)2^{-Ω(k)}+O(\varepsilon)2−Ω(k)+O(ε) in Kolmogorov distance and 2−Ω(k)+O(εlog⁡(2/ε))2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))2−Ω(k)+O(εlog(2/ε)) in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong ε\varepsilonε-approximate kkk-design is concentrated around its Haar value n−Θ(1)n-Θ(1)n−Θ(1): its mean differs from the Haar mean by O(k−1/4+ε1/2)O(k^{-1/4}+\varepsilon^{1/2})O(k−1/4+ε1/2) and its standard deviation is O(2−n/2+k−1/8+ε1/4)O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})O(2−n/2+k−1/8+ε1/4). Consequently, a trusted device sampling such circuits generates n−O(1)n-O(1)n−O(1) bits of entropy per sample, which makes them useful for random number generation.
For Haar-random quantum states, measurement probabilities follow the universal Porter--Thomas distribution. This implies anticoncentration, i.e.\ the spreading of probability over exponentially many outcomes, a key property underlying random-circuit-sampling experiments. We derive the exact analogue of the Porter--Thomas law for random fermionic Gaussian states, both with and without particle-number conservation. We also consider Clifford Gaussian states, for which the problem maps onto a simple model of arcs and loops. For large systems the probabilities become log-normally distributed, with moments growing polynomially in system size. Free-fermion states thus anticoncentrate only up to polynomial factors. We then show how this fermionic Porter--Thomas law emerges in random one-dimensional brickwork matchgate circuits. A simple single-arc approximation accurately describes the full distribution of probabilities, revealing an early diffusive regime followed by a slow relaxation on times scaling as the square of the system size. We rigorously prove that depths growing almost quadratically with system size are required for the collision probability to converge. Finally, we show that ideal free-fermion sampling yields large linear cross-entropy scores, and propose a log-based benchmark with an exact fermionic normalization.
Universal statistical laws are a hallmark of quantum chaos. A natural route to probing them in quantum circuits is offered by the statistics of output probabilities, which for sufficiently deep chaotic circuits approach the Porter--Thomas distribution. Here we show, theoretically and experimentally, that the approach to this limit is itself universal, and is organized into geometry-dependent universality classes. At shallow depths, growing only logarithmically with system size, we derive universal output-probability distributions that differ markedly from Porter--Thomas statistics, and we test them on a programmable superconducting processor. Two-dimensional lattices, open one-dimensional chains, and periodic rings exhibit distinct universal forms, retaining signatures of geometry and boundary topology within the same logarithmic-depth regime. Within each class, the distributions depend on only two parameters: an effective many-body Thouless scale and the accumulated number of incoherent errors. Extracting these directly from measured bitstring frequencies provides access to scrambling, entanglement growth of the target state, and global fidelity, without reconstructing or classically simulating the implemented circuit. We also identify a noise-driven transition between output statistics retaining system-wide quantum correlations and those reproducible by independent small patches. Our results establish universality beyond Porter--Thomas statistics as a quantitative tool for characterizing noisy quantum processors.
Sampling from the output distribution of chaotic quantum evolutions, and of pseudo-random universal quantum circuits in particular, has been proposed as a prominent milestone for near-term quantum supremacy. The same paper notes that chaotic distributions are very sensitive to noise, and under quite general noise models converge to the uniform distribution over bit-strings exponentially in the number of gates. On the one hand, for increasing number of gates, it suffices to choose bit-strings at random to approximate the noisy distribution with fixed statistical distance. On the other hand, cross-entropy benchmarking can be used to gauge the fidelity of an experiment, and the distance to the uniform distribution. We estimate that state-of-the-art classical supercomputers would fail to simulate high-fidelity chaotic quantum circuits with approximately fifty qubits and depth forty. A recent interesting paper proposed a different approximation algorithm to a noisy distribution, extending previous results on the Fourier analysis of commuting quantum circuits. Using the statistical properties of the Porter-Thomas distribution, we show that this new approximation algorithm does not improve random guessing, in polynomial time. Therefore, it confirms previous results and does not represent an additional challenge to the suggested failure stated above.
We show that noiseless random quantum circuits pass the linear cross-entropy benchmark (LXEB) test with high probability. If the circuits are linear depth, and thus form unitary 4-designs, the LXEB test is passed with probability 1−O(1/k)1-O(1/\sqrt{k})1−O(1/k​), where kkk is the number of independently drawn samples from the output distribution of the random circuit. If the circuits are of depth O~(n2)\tilde O(n^2)O~(n2), and thus form unitary nnn-designs, the LXEB test is passed with probability 1−O(e−klog⁡(n)/n)1-O(e^{-k \log(n)/n})1−O(e−klog(n)/n). In proving our results, we show strong concentration of the random circuit collision probability at linear depth and establish that the tails of the distribution of random circuit output probabilities start to resemble Porter-Thomas at near-quadratic depths. Our analysis employs higher moments and high-degree approximate designs.