arXiv subjects

Arman Sauliere

Publications and source records attributed to Arman Sauliere.

4 recordsLinked to original sources

arXiv2026

Observation of Universal Quantum Chaos at Shallow Depths

Universal statistical laws are a hallmark of quantum chaos, usually associated with the loss of spatial structure. Here we show, theoretically and experimentally, that universality emerges already at shallow depths in chaotic quantum circuits. We derive universal distributions of output-probability fluctuations and test them on a programmable superconducting processor. Two-dimensional lattices, open one-dimensional chains, and periodic rings exhibit distinct universality classes, retaining signatures of geometry and boundary topology before full random-matrix behavior emerges. Within each class, the distributions depend on only two parameters: an effective many-body Thouless length 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 finite-depth universality as a practical tool for probing deep properties of quantum processors.

quant-ph↗

arXiv2026

Error-Correction Transitions in Finite-Depth Quantum Channels

We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially local interaction gates. We analyze both noise acting after the encoding and noise affecting the encoding circuit itself. Using the coherent information as a metric, we show that in both cases the infinite depth limit is governed by random matrix theory, which predicts a universal phase transition at a critical noise rate. This critical point separates an error correcting phase, in which encoded information is preserved, from a phase in which it is irretrievably lost. Going beyond the infinite depth limit, we characterize the systematic finite depth deviations from random matrix universality. In particular, we show that these deviations behave parametrically differently depending on whether the noise acts after the encoding or also affects the encoding itself. For noiseless encoders, the approach is exponential in circuit depth, although boundary effects can delay perfect encoding relative to the circuit design time. For noisy encoders, we find that the circuit fidelity effectively replaces the Hashing bound, and perfect encoding is approached polynomially with depth.

quant-ph↗

arXiv2026

Universality in the Anticoncentration of Noisy Quantum Circuits at Finite Depths

We present universal properties of anticoncentration in weakly 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 random matrix product operator (RMPO). 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.

quant-ph↗

arXiv2025

Universality in the Anticoncentration of Chaotic Quantum Circuits

We identify a \emph{universal functional form} that governs anticoncentration in random quantum circuits-one that holds across diverse circuit architectures and depths, and crucially remains valid even at finite system sizes and shallow depth. We support this claim through analytical results for ensembles of random tensor-network states and random-phase models. This compact, universal expression for the output bitstring probability distribution is fully characterized by just two fitting parameters, as validated through extensive numerical simulations. Our findings underscore the pivotal role of finite-size and finite-depth effects in shaping anticoncentration and introduce a practical framework for benchmarking quantum devices using shallow circuits, thereby enabling validation of systems significantly larger than previously accessible.

quant-ph↗