Fermionic Porter-Thomas statistics and their emergence in random matchgate circuits
Guglielmo Lami
Abstract
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.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado