REVIEW 8 cited by
More global randomness from less random local gates
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Random circuits giving rise to unitary designs are key tools in quantum information science and many-body physics. In this work, we investigate a class of random quantum circuits with a specific gate structure. Within this framework, we prove that one-dimensional structured random circuits with non-Haar random local gates can exhibit substantially more global randomness compared to Haar random circuits with the same underlying circuit architecture. In particular, we derive all the exact eigenvalues and eigenvectors of the second-moment operators for these structured random circuits under a solvable condition, by establishing a link to the Kitaev chain, and show that their spectral gaps can exceed those of Haar random circuits. Our findings have applications in improving circuit depth bounds for randomized benchmarking and the generation of approximate unitary 2-designs from shallow random circuits.
Forward citations
Cited by 8 Pith papers
-
Low Rank Structure of the Reduced Transition Matrix
The reduced transition matrix in chaotic dual-unitary quantum circuits has low-rank structure with entropy growing at most logarithmically in time, enabling efficient approximation for local expectation values.
-
Apparent Universal Behavior in Second Moments of Random Quantum Circuits
Most random circuit geometries form approximate 2-designs in O(log n) depth with explicit constants; bridge/lollipop graphs need Ω(n²) gates, and 10-20 layers suffice for 50-qubit near-random circuits.
-
Anti-concentration is (almost) all you need
For LU-invariant local random quantum circuits, anti-concentration implies a relative-error state 2-design with error ≈ 4× the anti-concentration error, making the two properties equivalent.
-
Graph-State Circuit Blocks control Entanglement and Scrambling Velocities
LC-inequivalent graph-state blocks in random Clifford circuits yield distinct entanglement velocities v_E and butterfly velocities v_B, correlated with internal entanglement distribution and graph connectivity.
-
Evaluating quantum circuits in the reservoir computing paradigm
Brickwall quantum circuits with Haar-random, dual-unitary, and solvable two-qubit gates serve as effective reservoirs for temporal processing tasks, with performance correlated to circuit dynamics and validated on syn...
-
Evaluating quantum circuits in the reservoir computing paradigm
Brickwall circuits from Haar-random, dual-unitary, and solvable two-qubit gates are tested as quantum reservoirs, showing effective fading memory and prediction accuracy on synthetic time-series data.
-
Lecture Notes on Replica Tensor Networks for Random Quantum Circuits
Lecture notes and accompanying library teach replica tensor network methods to compute circuit-averaged observables in random quantum circuits by mapping them to classical statistical mechanics models.
-
Quantum Chaos and Quantum Information: Interactions and Implications
Quantum chaotic dynamics with positive entropy production universally links to von Neumann entropy and noise modeling in quantum information processing.
Discussion (0). Sign in to comment.