Pith. sign in

REVIEW 2 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

arxiv 2410.24127 v2 pith:MFQIEMLQ submitted 2024-10-31 quant-ph cond-mat.str-elcs.ITmath.IT

classification quant-phcond-mat.str-elcs.ITmath.IT
keywords randomcircuitscircuitdesignsgatesglobalhaarlocal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Apparent Universal Behavior in Second Moments of Random Quantum Circuits

    quant-ph 2025-10 conditional novelty 7.0 of 10

    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.

  2. Anti-concentration is (almost) all you need

    quant-ph 2025-10 accept novelty 6.0 of 10

    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.

Pith tools