Pith. sign in

REVIEW 2 major objections 5 minor 85 references

Strong unitary designs in optimal depth and space

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read For any fixed design order and error tolerance, strong approximate unitary designs can be generated in optimal $\Theta(\log n)$ all-to-all circuit depth using only the $n$ physical qubits.

desk verdict Strong unitary designs in optimal Theta(log n) depth on the system qubits, with a genuinely new worst-case Pauli-mixing proof for perfect-matching circuits; the core looks right, but the result leans on an imported reduction and an undisclosed LLM-gap-filling step that referees should probe. read the letter →

arxiv 2608.13491 v1 pith:WYSCCGDW submitted 2026-08-13 quant-ph

Teodor Parella-Dilmé , Júlia Barberà-Rodríguez , Salvatore F. E. Oliviero , Antonio A. Mele This is my paper · ORCID
classification quant-ph MSC 81P68 PACS 03.67.-a
keywords strongunitarydesignsperfect-matchingensemblePaulimixingMarkovchaincouplinglogarithmicdepthcircuitsmeasurableerrorquantumscramblingrandom
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Unitary designs are finite-moment stand-ins for Haar-random unitaries, and strong designs must be indistinguishable from Haar even when an experiment may query $U$, $U^T$, $U^*$, and $U^\dagger$ separately with adaptive quantum memory. This paper establishes that, for every fixed design order $k$ and every fixed measurable-error tolerance, strong approximate unitary $k$-designs exist in $\Theta(\log n)$ all-to-all circuit depth using only the original $n$ physical qubits, matching the $\Omega(\log n)$ light-cone lower bound. The new ingredient is a worst-case Pauli-mixing theorem for the perfect-matching ensemble: after $O(\log(n/\eta))$ layers of uniformly random perfect matchings with independent Haar-random two-qubit gates, every nonidentity Pauli operator evolves to a distribution $\eta$-close in total variation to the Haar-uniform Pauli distribution. That bound controls the mixed forward/reverse two-query sector; composing it with a logarithmic-depth weak relative-error 2-design and strong gluing yields the full strong $k$-design. If true, closed-system dynamics reaching this strong form of scrambling at the earliest possible depth scale would follow, with implications for out-of-time-order correlator growth and black-hole-style information recovery.

What carries the argument

The central object is the perfect-matching ensemble: each layer samples a uniformly random perfect matching of the qubits and applies independent Haar-random two-qubit gates to every matched pair. The analysis reduces operator spreading to a classical Markov chain on nonempty Pauli supports, because after one layer the local $X,Y,Z$ labels are forgotten and each active edge contributes one or two qubits to the new support with probabilities $2/5$ and $3/5$. A monotone grand coupling over the shared matching randomness shows that all singleton chains grow to half density in $O(\log n)$ layers, stay dense with probability $1-e^{-\Omega(n)}$, and then contract their gap to the full-support chain geometrically, yielding uniform Pauli mixing in $O(\log(n/\eta))$ layers. This gives the mixed-sign security, and the gluing machinery promotes it to a full strong $k$-design in measurable error.

What would settle it

Take the depth-$T$ perfect-matching ensemble with $T=\lceil C_{\mathrm{mix}}\log(n/\eta)\rceil$ for, say, $n=128$ and $\eta=0.1$, and compute the optimal distinguishing advantage of a two-query comb that queries one of $\{U,U^T\}$ and one of $\{U^*,U^\dagger\}$; compare it against $\max_P \mathrm{TVD}(p_{\mathcal{E}_{\mathrm{PM}}^{(T)}}(\cdot|P),\pi)$. The theorem predicts they agree to within the claimed measurable-error bound, so any experiment or exact simulation exhibiting a strictly larger advantage, or a support chain that fails to coalesce within the predicted time except with probability larger than $\eta$, would refute it.

Watch

Extended reading notes

Core claim

Theorem 3 states that there are universal constants $c_0,A,C,\xi_0$ such that for even $n$, $k\ge 2$, $0<\varepsilon\le 1/2$, and $\log(nk/\varepsilon)\le c_0 n$, there is an all-to-all circuit ensemble on the $n$ physical qubits that is a strong $\varepsilon$-approximate unitary $k$-design in measurable error with depth $d\le C(1+k\log^7(2k))\log(nk/\varepsilon)$. For fixed $k$ and fixed $\varepsilon<1/4$ the upper bound is $O(\log n)$, and a light-cone argument gives $\Omega(\log n)$, so the depth is optimal $\Theta(\log n)$. The circuit is a two-layer brickwork of local strong $k$-designs realized by one-dimensional random circuits, sandwiched between two global strong 2-design shells; each shell is the composition of a perfect-matching ensemble with an independent weak relative-error 2-design. The perfect-matching part alone controls all mixed-sign two-query experiments, the weak-design part controls the same-sign sector, and strong gluing promotes the combination to arbitrary order $k$.

Load-bearing premise

The argument inherits an imported reduction: for an ensemble invariant under conjugation, transposition, and random single-qubit Pauli rotations, robustness against all mixed-sign two-query combs is exactly the worst-case total-variation distance between the induced Pauli transition distribution and the Haar-uniform Pauli distribution; if some fixed-word adaptive comb could distinguish better than that Pauli statistic, the logarithmic-depth strong-2-design shell and hence the $\Theta(\log n)$ strong-$k$-design claim would collapse.

Editorial extensions

If this is right

  • For fixed $k$ and fixed target error, strong approximate unitary $k$-designs can be produced in $O(\log n)$ depth on the system qubits alone, saturating the $\Omega(\log n)$ lower bound and resolving the system-only strong fast-scrambling question for unitary designs.
  • Out-of-time-order-correlator growth, and the scrambling behavior behind echo protocols and Hayden-Preskill-type decoding, can occur at logarithmic time within an all-to-all architecture that uses no auxiliary qubits.
  • The depth factor for higher orders is $d = O((1 + k \log^7(2k))\log(nk/\varepsilon))$, giving explicit (non-optimized) dependence on $k$ and $\varepsilon$.
  • The guarantee is information-theoretic and covers fixed-word adaptive combs with arbitrary quantum memory; it does not by itself cover controlled queries, adaptive choice of query orientation, noisy oracles, or physical implementation.
  • The construction is not computationally secure: the question of system-only strong pseudorandom unitaries in logarithmic depth remains open.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The support-chain proof uses only the randomness of pairing and the local edge-update probabilities, so the same two-phase growth-and-contraction argument is a plausible template for other connectivity graphs such as sparse expanders or small-world networks; checking whether the gap-contraction factor stays below $1$ there would test the transfer.
  • The composition with a weak relative-error 2-design may be an artifact of the proof route; the paper explicitly asks whether the perfect-matching ensemble alone already forms a strong 2-design in logarithmic depth, and a direct higher-moment analysis could both answer this and improve the $k$-dependence.
  • Small-scale numerical simulation of the support Markov chain should show the coalescence time of singletons and the full-support chain at approximately $C_{\mathrm{mix}}\log(n/\eta)$; agreement would give independent evidence for the claimed constants, while a visible gap would point to a constant that needs revisiting.
  • If the Pauli-mixing bound can be lifted to higher moments rather than only the second moment, the same architecture might yield strong designs with a milder order-dependence than the gluing-based factor $1+k\log^7(2k)$.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper constructs strong approximate unitary k-designs on n physical qubits with all-to-all circuit depth Θ(log n), resolving the unitary-design part of the strong fast-scrambling question left open in Ref. [1]. The new ingredient is the perfect-matching ensemble: each layer pairs the qubits by a uniformly random perfect matching and applies independent Haar-random two-qubit gates. The main technical result, Theorem 1, proves that after T = O(log(n/η)) layers every nonidentity Pauli string has its induced Pauli transition distribution within total variation distance η of the Haar-uniform distribution. The proof reduces the Pauli chain to a support Markov chain, then analyzes it with a monotone grand coupling combining growth, persistence, and geometric contraction estimates. Theorem 2 composes this ensemble with an independent weak relative-error 2-design to obtain a logarithmic-depth strong 2-design shell, and Theorem 3 sandwiches two brickwork layers of local strong k-designs between two such shells via an imported strong gluing lemma, yielding depth C(1 + k log^7(2k)) log(nk/ε). The result is stated for even n, fixed query words, measurable error in full trace norm, and all-to-all connectivity, and it matches the known Ω(log n) light-cone lower bound.

Significance. If the result is correct, it is a substantial advance: it achieves the optimal Θ(log n) depth for strong unitary designs using only the system qubits, removing the extra logarithmic factor and the ancilla overhead of the previous construction. The support-chain reduction and the grand-coupling argument for worst-case Pauli inputs are genuine technical contributions, and the derivation is parameter-free in the sense that the constants are explicit rather than fitted. I found no internal inconsistency in the Markov-chain proof of Theorem 1: the growth, persistence, and contraction lemmas are internally coherent, and the error budgeting in the final coalescence argument checks out. The numerical simulations support the logarithmic mixing claim, though they do not substitute for the proof. The main caveat is that the bridge from Pauli mixing to quantum comb indistinguishability, Proposition 1, is imported from an unpublished preprint and is not proved here; the final Θ(log n) claim is conditional on that reduction. This is a correctness-risk concern, not a circularity: I saw no place where the paper assumes the target result.

major comments (2)
  1. [Section II.D, Proposition 1 and Eq. (6)] The strong 2-design shell and hence the final Θ(log n) claim rest on the imported equality between mixed-sign two-query comb error and worst-case total variation distance of the Pauli transition distribution. The manuscript verifies the required symmetries for the perfect-matching ensemble but does not prove the reduction itself, and Eq. (6) is stated without a derivation. Since a two-query comb with quantum memory could in principle exploit off-diagonal matrix elements of the mixed-moment channel Φ_E^{(1,1)} in the Pauli basis, the equality is not self-evident; a failure of this reduction would invalidate Theorem 2 and Theorem 3. Please include a self-contained proof of Proposition 1 (or of the precise form needed here), or replace the reference to the unpublished preprint [1] with a published version containing the proof, and state explicitly which hypotheses of Ref. [1] are being imported. A concrete way to close the gap would be to show that under the stated symmetries Φ_E^{(1,1)} is completely determined by its diagonal Pauli matrix elements.
  2. [Section VI (AI Disclosure)] The disclosure states that GPT-5.6 Pro was used to help fill gaps in the full proof of Pauli mixing, but it does not identify which gaps were filled. Because Theorem 1 is the central new technical contribution and its proof is where the paper's main novelty lies, the absence of a precise account of which steps were machine-generated makes it difficult to verify the provenance and completeness of the proof. Please list the specific gaps that were filled, state how each was subsequently verified by the human authors, and attach any additional derivations needed; alternatively, clearly mark the affected steps in the appendix.
minor comments (5)
  1. [Section II.A, after Eq. (4)] The paper uses two normalizations of the measurable error, the full trace norm in Eq. (4) and the half trace distance in Proposition 1, with the conversion stated only in Appendix A.3; a one-line reminder at the point of Eq. (4) would prevent misreading of later constants.
  2. [Appendix A.2.3, Corollary 1] The displayed definition of h_* is ambiguous: it can be read either as 800 ln(4) · (1+log(21/20))/log(21/20) or as 800 ln(4(1+log(21/20))/log(21/20)); since the two choices differ by more than a constant factor, please add brackets and state explicitly that the chosen value is an absolute constant.
  3. [Figure 4] The middle and right subpanels of panels (b) and (c) appear to be identical; if this is intentional, label them accordingly, and otherwise replace the duplicate figure.
  4. [Abstract and Theorem 3] The abstract says arbitrary fixed design order while Theorem 3 requires k ≥ 2; please state the k = 1 case explicitly or qualify the abstract.
  5. [References [1] and [32]] The main theorems depend on two arXiv preprints, Refs. [1] and [32]; please update to published versions if available and, at minimum, cite the specific theorem and lemma numbers in those preprints that provide the imported statements.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reasoning found: the central new claim is a parameter-free Markov-chain Pauli-mixing bound, and all load-bearing imported reductions come from non-overlapping external groups.

full rationale

The derivation chain is self-contained with respect to circularity. The new ingredient is Theorem 1, a parameter-free bound on the worst-case total variation distance between the perfect-matching ensemble's Pauli transition distribution and the uniform Haar Pauli distribution, proved by a Markov-chain and grand-coupling argument in Appendix A.2. That proof does not assume the target strong-design claim; it establishes mixing of an explicitly defined classical process on Pauli supports. The bridge from Pauli TVD to mixed-sign query robustness is Proposition 1, imported from Ref. [1] (Schuster et al.), a non-overlapping author set; the composition and gluing lemmas (Lemmas 1-3, 17, Corollary 2) are imported from Refs. [1], [32], and [33], also outside the author set, and are used as external tools rather than as the claim being established. No parameter is fitted to the target error or depth, and no prediction is a renamed input. The imported Proposition 1 is load-bearing and not proved in this manuscript, but it comes from independent prior work by other authors, so relying on it is ordinary use of external results rather than circularity. The only flagged limitation is Section VI, which discloses LLM-assisted gap-filling in the Pauli-mixing proof without identifying which gaps were filled; this is a proof-verification risk, not a circularity, and does not affect the circularity score.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The ledger is clean: there are no free parameters fitted to data, no invented physical entities, and no circular reduction. The central new proof is a parameter-free Markov-chain analysis against the Haar-uniform Pauli distribution. The main theorem rests on several substantial imported theorems from Refs [1,32,33] about strong gluing, query-sector composition, mixed-query reduction, and low-depth relative-error designs; these are external tools rather than assumptions that include the target result.

assumptions (7)
  • domain assumption Mixed-query reduction (Proposition 1, adapted from Proposition 2 of Ref [1])
    Imported theorem: for ensembles invariant under conjugation, transposition, and single-qubit Pauli rotations, mixed-sign query robustness equals worst-case Pauli transition TVD. Used to turn Theorem 1 into the strong 2-design shell in Theorem 2; not proved in this paper.
  • domain assumption Strong gluing lemma (Lemma 1, imported; assembled as Lemma 17)
    Imported theorem that local strong k-designs sandwiched between strong 2-design shells glue into an extensive strong k-design. Used in Theorem 3; the paper adapts it to uneven patch sizes but does not prove it.
  • domain assumption Query-sector composition (Lemma 3, Lemma 19 of Ref [32])
    Imported: the convolution of a mixed-sign-secure ensemble and a weak relative-error 2-design is a strong 2-design with error max(epsilon1, 2 epsilon2). Used in Theorem 2 to combine the perfect-matching ensemble with a weak design.
  • domain assumption 1D random circuits form strong relative-error designs (Lemma 2, Lemma 3 of Ref [1])
    Imported construction for local blocks; supplies strong k-designs on O(log n) qubits at depth O(k log^7(2k) log(nk/epsilon)). If this scaling failed, the depth bound in Theorem 3 would change.
  • domain assumption Weak gluing gives low-depth relative-error designs (Theorem 4 and Corollary 2 of Ref [33])
    Imported result used to generate the weak relative-error 2-design nu_{n,delta} in logarithmic depth for the same-sign sector in Theorem 2.
  • standard math Haar invariance and Schur orthogonality of SU(4) conjugation
    Used to derive the uniform transition probabilities over the 15 nonidentity two-qubit Paulis in Appendix A.2.1.
  • standard math Standard concentration and Markov-chain tools (Azuma, Chernoff, Markov, coupling inequalities)
    Used throughout Appendix A.2 without proof; these are standard textbook results from Ref [34] and the probability literature.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Strong unitary designs in optimal depth and space." pith.science (2026). https://pith.science/paper/WYSCCGDW

@misc{pith2026260813491,
  author       = {Pith},
  title        = {Pith review of: Strong unitary designs in optimal depth and space},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WYSCCGDW}},
  note         = {Machine review of arXiv:2608.13491}
}
abstract

Unitary designs provide finite-moment approximations to Haar-random unitaries, with wide-ranging applications across physics and quantum information, from scrambling and black-hole dynamics to foundational primitives in quantum algorithms. Strong unitary designs capture a more demanding operational notion of approximation, requiring indistinguishability from Haar randomness even for quantum algorithms that may access a unitary not only in the forward direction, but also through its inverse, transpose, and complex conjugate. Motivated by the physical requirement that scrambling arise within the system itself, Schuster, Ma, Lombardi, Brand\~ao, and Huang (arXiv:2509.26310) left open whether strong unitary designs can be generated in logarithmic depth using only the system qubits. For every fixed design order $k$ and measurable-error tolerance, we construct strong approximate unitary $k$-designs in optimal $\Theta(\log n)$ all-to-all circuit depth using only the $n$ original system qubits. Our new ingredient is a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble, whose layers pair the qubits uniformly at random and apply independent random two-qubit gates. This bound controls the mixed forward-reverse two-query case, which we combine with existing design and gluing results to obtain strong unitary designs of arbitrary fixed order.

Figures

Figures reproduced from arXiv: 2608.13491 by the authors.

Figure 1
Figure 1. FIG. 1: A mixed-query distinguisher represented as a quantum comb [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: Architecture of our realization for approximate strong [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3: (a) Schematic of the grand coupling. Each row is indexed by one of the 2 [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: FIG. 4: (a) Mixing of the support chain induced by the perfect-matching circuit, exemplified numerically for [PITH_FULL_IMAGE:figures/full_fig_p011_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

85 extracted references · 36 canonical work pages

  1. [1]

    Surveys in Combinatorics, 1989 , editor =

    McDiarmid, Colin , title =. Surveys in Combinatorics, 1989 , editor =. 1989 , doi =

    1989

  2. [2]

    Concentration Inequalities: A Nonasymptotic Theory of Independence , publisher =

    Boucheron, St. Concentration Inequalities: A Nonasymptotic Theory of Independence , publisher =

  3. [3]

    2025 , eprint=

    Constructive interference at the edge of quantum ergodic dynamics , author=. 2025 , eprint=

    2025

  4. [5]

    , title =

    McShane, Edward J. , title =. Bulletin of the American Mathematical Society , volume =. 1934 , doi =

    1934

  5. [6]

    and Thomas, Joy A

    Cover, Thomas M. and Thomas, Joy A. , title =. 2006 , isbn =

    2006

  6. [7]

    2021 , eprint=

    Entropic Independence I: Modified Log-Sobolev Inequalities for Fractionally Log-Concave Distributions and High-Temperature Ising Models , author=. 2021 , eprint=

    work page 2021

  7. [8]

    Annals of Mathematics , author=

    Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid , volume=. Annals of Mathematics , author=. 2024 , month=. doi:10.4007/annals.2024.199.1.4 , number=

    doi:10.4007/annals.2024.199.1.4 2024

  8. [9]

    Journal of High Energy Physics , year =

    Sekino, Yasuhiro and Susskind, Leonard , title =. Journal of High Energy Physics , year =. doi:10.1088/1126-6708/2008/10/065 , eprint =

    doi:10.1088/1126-6708/2008/10/065 2008

Show all 85 references
  1. [10]

    Journal of High Energy Physics , year =

    Hayden, Patrick and Preskill, John , title =. Journal of High Energy Physics , year =. doi:10.1088/1126-6708/2007/09/120 , eprint =

    2007 doi

  2. [11]

    2017 , eprint =

    Yoshida, Beni and Kitaev, Alexei , title =. 2017 , eprint =

    2017

  3. [12]

    and Osborne, Tobias and Hayden, Patrick , title =

    Lashkari, Nima and Stanford, Douglas and Hastings, Matthew J. and Osborne, Tobias and Hayden, Patrick , title =. Journal of High Energy Physics , year =. doi:10.1007/JHEP04(2013)022 , eprint =

    2013 doi

  4. [13]

    and Stanford, Douglas , title =

    Shenker, Stephen H. and Stanford, Douglas , title =. Journal of High Energy Physics , year =. doi:10.1007/JHEP03(2014)067 , eprint =

    2014 doi

  5. [14]

    Larkin, A. I. and Ovchinnikov, Yu. N. , title =. Soviet Physics JETP , volume =. 1969 , url =

    1969

  6. [15]

    2015 , url =

    Kitaev, Alexei , title =. 2015 , url =

    2015

  7. [19]

    2012 , eprint =

    Brown, Winton and Fawzi, Omar , title =. 2012 , eprint =

    2012

  8. [20]

    Communications in Mathematical Physics , year =

    Brown, Winton and Fawzi, Omar , title =. Communications in Mathematical Physics , year =. doi:10.1007/s00220-015-2470-8 , eprint =

    doi

  9. [21]

    and Low, Richard A

    Harrow, Aram W. and Low, Richard A. , title =. Communications in Mathematical Physics , year =. doi:10.1007/s00220-009-0873-6 , eprint =

    doi

  10. [22]

    Local Random Quantum Circuits are Approximate Polynomial-Designs , journal =

    Brand. Local Random Quantum Circuits are Approximate Polynomial-Designs , journal =. 2016 , volume =. doi:10.1007/s00220-016-2706-8 , eprint =

    2016 doi

  11. [23]

    Science , year =

    Schuster, Tobias and Haferkamp, Jens and Huang, Hsin-Yuan , title =. Science , year =. doi:10.1126/science.adu0064 , eprint =

    doi

  12. [25]

    and Grevink, L

    Folkertsma, M. and Grevink, L. and Helsen, J. and Dutkiewicz, A. , title =. 2026 , eprint =

    2026

  13. [27]

    , title =

    Koenig, Robert and Smolin, John A. , title =. Journal of Mathematical Physics , year =. doi:10.1063/1.4903507 , eprint =

    doi

  14. [28]

    Physical Review A , year =

    Aaronson, Scott and Gottesman, Daniel , title =. Physical Review A , year =. doi:10.1103/PhysRevA.70.052328 , eprint =

    doi

  15. [30]

    Tohoku Mathematical Journal , year =

    Azuma, Kazuoki , title =. Tohoku Mathematical Journal , year =

  16. [31]

    Journal of the American Statistical Association , year =

    Hoeffding, Wassily , title =. Journal of the American Statistical Association , year =

  17. [34]

    and Stanford, Douglas , title =

    Maldacena, Juan and Shenker, Stephen H. and Stanford, Douglas , title =. Journal of High Energy Physics , volume =. 2016 , doi =. 1503.01409 , archivePrefix =

    2016 arXiv

  18. [37]

    2025 , eprint=

    Unitary designs in nearly optimal depth , author=. 2025 , eprint=

    2025

  19. [38]

    Scrambling Dynamics and Out-of-Time-Ordered Correlators in Quantum Many-Body Systems , volume=

    Xu, Shenglong and Swingle, Brian , year=. Scrambling Dynamics and Out-of-Time-Ordered Correlators in Quantum Many-Body Systems , volume=. PRX Quantum , publisher=

  20. [39]

    Weinstein and Marcos Saraceno and Seth Lloyd and David G

    Joseph Emerson and Yaakov S. Weinstein and Marcos Saraceno and Seth Lloyd and David G. Cory , title =. Science , volume =. 2003 , URL =

    2003

  21. [40]

    and Audenaert, K

    Gross, D. and Audenaert, K. and Eisert, J. , year=. Evenly distributed unitaries: On the structure of unitary designs , volume=. Journal of Mathematical Physics , publisher=

  22. [41]

    2005 , eprint=

    Efficient Simulation of Random Quantum States and Operators , author=. 2005 , eprint=

    2005

  23. [42]

    Exact and approximate unitary 2-designs and their application to fidelity estimation , volume=

    Dankert, Christoph and Cleve, Richard and Emerson, Joseph and Livine, Etera , year=. Exact and approximate unitary 2-designs and their application to fidelity estimation , volume=. Physical Review A , publisher=

  24. [43]

    Magesan, Easwar and Gambetta, J. M. and Emerson, Joseph , title =. Physical Review Letters , volume =. 2011 , doi =

    2011

  25. [44]

    2018 , url =

    Zhengfeng Ji and Yi-Kai Liu and Fang Song , title =. 2018 , url =

    2018

  26. [45]

    2025 , archivePrefix=

    How to Construct Random Unitaries , author=. 2025 , archivePrefix=

    2025

  27. [46]

    Physical Review A , volume =

    Haferkamp, Jonas and Hunter-Jones, Nicholas , title =. Physical Review A , volume =. 2021 , doi =. 2012.05259 , archivePrefix =

    2021 arXiv

  28. [47]

    and Hunter-Jones, Nicholas and Brand

    Dalzell, Alexander M. and Hunter-Jones, Nicholas and Brand. Random Quantum Circuits Anticoncentrate in Log Depth , journal =. 2022 , doi =. 2012.08564 , archivePrefix =

    2022 arXiv

  29. [48]

    and Mehraban, Saeed , title =

    Harrow, Aram W. and Mehraban, Saeed , title =. 2018 , eprint =

    2018

  30. [50]

    Proceedings of the National Academy of Sciences , volume =

    Bentsen, Gregory and Gu, Yingfei and Lucas, Andrew , title =. Proceedings of the National Academy of Sciences , volume =. 2019 , doi =. 1805.08215 , archivePrefix =

    2019 arXiv

  31. [51]

    2024 , eprint =

    Metger, Tony and Poremba, Alexander and Sinha, Makrand and Yuen, Henry , title =. 2024 , eprint =

    2024

  32. [52]

    Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing , pages =

    Gutoski, Gus and Watrous, John , title =. Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing , pages =. 2007 , doi =. quant-ph/0611234 , archivePrefix =

    2007 arXiv

  33. [53]

    , title =

    Helstrom, Carl W. , title =. 1976 , isbn =

    1976

  34. [54]

    2025 , eprint =

    Ananth, Prabhanjan and Bostanci, John and Gulati, Aditya and Lin, Yao-Ting , title =. 2025 , eprint =

    2025

  35. [55]

    Quantum statistical mechanics in a closed system , author =. Phys. Rev. A , volume =. 1991 , month =

    1991

  36. [56]

    Chaos and quantum thermalization , volume=

    Srednicki, Mark , year=. Chaos and quantum thermalization , volume=. Physical Review E , publisher=

  37. [57]

    Thermalization and its mechanism for generic isolated quantum systems , volume=

    Rigol, Marcos and Dunjko, Vanja and Olshanii, Maxim , year=. Thermalization and its mechanism for generic isolated quantum systems , volume=. Nature , publisher=

  38. [58]

    2024 , eprint=

    Incompressibility and spectral gaps of random circuits , author=. 2024 , eprint=

    2024

  39. [59]

    2025 , eprint=

    Are controlled unitaries helpful? , author=. 2025 , eprint=

    2025

  40. [61]

    Schuster , author F

    author author T. Schuster , author F. Ma , author A. Lombardi , author F. G. S. L. \ Brand \ a o ,\ and\ author H.-Y. \ Huang ,\ @noop title Strong random unitaries and fast scrambling ( year 2025 a ),\ https://arxiv.org/abs/2509.26310 arXiv:2509.26310 [quant-ph] NoStop

    2025

  41. [62]

    Sekino \ and\ author L

    author author Y. Sekino \ and\ author L. Susskind ,\ title title Fast scramblers ,\ https://doi.org/10.1088/1126-6708/2008/10/065 journal journal Journal of High Energy Physics \ volume 2008 ,\ pages 065 ( year 2008 ) ,\ https://arxiv.org/abs/0808.2096 arXiv:0808.2096 [hep-th] NoStop

    2008 arXiv

  42. [63]

    Lashkari , author D

    author author N. Lashkari , author D. Stanford , author M. J. \ Hastings , author T. Osborne ,\ and\ author P. Hayden ,\ title title Towards the fast scrambling conjecture ,\ https://doi.org/10.1007/JHEP04(2013)022 journal journal Journal of High Energy Physics \ volume 2013 ,...

    2013 arXiv

  43. [64]

    author author J. M. \ Deutsch ,\ title title Quantum statistical mechanics in a closed system ,\ https://link.aps.org/doi/10.1103/PhysRevA.43.2046 journal journal Phys. Rev. A \ volume 43 ,\ pages 2046 ( year 1991 ) NoStop

    1991 doi

  44. [65]

    author author M. Srednicki ,\ title title Chaos and quantum thermalization ,\ http://dx.doi.org/10.1103/PhysRevE.50.888 journal journal Physical Review E \ volume 50 ,\ pages 888–901 ( year 1994 ) NoStop

    1994 doi

  45. [66]

    Rigol , author V

    author author M. Rigol , author V. Dunjko ,\ and\ author M. Olshanii ,\ title title Thermalization and its mechanism for generic isolated quantum systems ,\ http://dx.doi.org/10.1038/nature06838 journal journal Nature \ volume 452 ,\ pages 854–858 ( year 2008 ) NoStop

    doi

  46. [67]

    Hayden \ and\ author J

    author author P. Hayden \ and\ author J. Preskill ,\ title title Black holes as mirrors: Quantum information in random subsystems ,\ https://doi.org/10.1088/1126-6708/2007/09/120 journal journal Journal of High Energy Physics \ volume 2007 ,\ pages 120 ( year 2007 ) ,\ https:/...

    2007 arXiv

  47. [68]

    Brown \ and\ author O

    author author W. Brown \ and\ author O. Fawzi ,\ @noop title Scrambling speed of random quantum circuits ( year 2012 ),\ https://arxiv.org/abs/1210.6644 arXiv:1210.6644 [quant-ph] NoStop

    2012 arXiv

  48. [69]

    Brown \ and\ author O

    author author W. Brown \ and\ author O. Fawzi ,\ title title Decoupling with random quantum circuits ,\ https://doi.org/10.1007/s00220-015-2470-8 journal journal Communications in Mathematical Physics \ volume 340 ,\ pages 867 ( year 2015 ) ,\ https://arxiv.org/abs/1307.0632 a...

    arXiv

  49. [70]

    author author S. H. \ Shenker \ and\ author D. Stanford ,\ title title Black holes and the butterfly effect ,\ https://doi.org/10.1007/JHEP03(2014)067 journal journal Journal of High Energy Physics \ volume 2014 ,\ pages 067 ( year 2014 ) ,\ https://arxiv.org/abs/1306.0622 arX...

    2014 arXiv

  50. [71]

    author author D. A. \ Roberts \ and\ author D. Stanford ,\ title title Diagnosing chaos using four-point functions in two-dimensional conformal field theory ,\ https://doi.org/10.1103/PhysRevLett.115.131603 journal journal Physical Review Letters \ volume 115 ,\ pages 131603 (...

    arXiv

  51. [72]

    Nahum , author S

    author author A. Nahum , author S. Vijay ,\ and\ author J. Haah ,\ title title Operator spreading in random unitary circuits ,\ https://doi.org/10.1103/PhysRevX.8.021014 journal journal Physical Review X \ volume 8 ,\ pages 021014 ( year 2018 ) ,\ https://arxiv.org/abs/1705.08...

    arXiv

  52. [73]

    author author A. I. \ Larkin \ and\ author Y. N. \ Ovchinnikov ,\ title title Quasiclassical method in the theory of superconductivity ,\ https://www.jetp.ras.ru/cgi-bin/dn/e_028_06_1200.pdf journal journal Soviet Physics JETP \ volume 28 ,\ pages 1200 ( year 1969 ) NoStop

    1969

  53. [74]

    author author A. Kitaev ,\ https://online.kitp.ucsb.edu/online/entangled15/schedule.html title A simple model of quantum holography ,\ howpublished Talks at the KITP Program ``Entanglement in Strongly-Correlated Quantum Matter,'' April 7 and May 27, 2015 ( year 2015 ) NoStop

    2015

  54. [75]

    Swingle , author G

    author author B. Swingle , author G. Bentsen , author M. Schleier-Smith ,\ and\ author P. Hayden ,\ title title Measuring the scrambling of quantum information ,\ https://doi.org/10.1103/PhysRevA.94.040302 journal journal Physical Review A \ volume 94 ,\ pages 040302 ( year 20...

    arXiv

  55. [76]

    G \"a rttner , author J

    author author M. G \"a rttner , author J. G. \ Bohnet , author A. Safavi-Naini , author M. L. \ Wall , author J. J. \ Bollinger ,\ and\ author A. M. \ Rey ,\ title title Measuring out-of-time-order correlations and multiple quantum spectra in a trapped-ion quantum magnet ,\ ht...

    arXiv

  56. [77]

    Hosur , author X.-L

    author author P. Hosur , author X.-L. \ Qi , author D. A. \ Roberts ,\ and\ author B. Yoshida ,\ title title Chaos in quantum channels ,\ https://doi.org/10.1007/JHEP02(2016)004 journal journal Journal of High Energy Physics \ volume 2016 ,\ pages 4 ( year 2016 ) ,\ https://ar...

    2016 arXiv

  57. [78]

    author author D. A. \ Roberts \ and\ author B. Yoshida ,\ title title Chaos and complexity by design ,\ https://doi.org/10.1007/JHEP04(2017)121 journal journal Journal of High Energy Physics \ volume 2017 ,\ pages 121 ( year 2017 ) ,\ https://arxiv.org/abs/1610.04903 arXiv:161...

    2017 arXiv

  58. [79]

    King , author R

    author author R. King , author R. Kothari , author R. Babbush , author S. Boixo , author K. Kechedzhi , author T. E. \ O'Brien ,\ and\ author V. Smelyanskiy ,\ https://arxiv.org/abs/2510.19751 title A simplified version of the quantum otoc ^ (2) problem ( year 2025 ),\ https:/...

  59. [80]

    author author D. A. \ Abanin , author R. Acharya , author L. Aghababaie-Beni , author G. Aigeldinger , author A. Ajoy , author R. Alcaraz , author I. Aleiner , author T. I. \ Andersen , author M. Ansmann , author F. Arute , author K. Arya , author A. Asfaw , author N. Astrakha...

    2025 arXiv

  60. [81]

    Emerson , author Y

    author author J. Emerson , author Y. S. \ Weinstein , author M. Saraceno , author S. Lloyd ,\ and\ author D. G. \ Cory ,\ title title Pseudo-random unitary operators for quantum information processing ,\ https://www.science.org/doi/abs/10.1126/science.1090790 journal journal S...

    doi

  61. [82]

    Gross , author K

    author author D. Gross , author K. Audenaert ,\ and\ author J. Eisert ,\ title title Evenly distributed unitaries: On the structure of unitary designs ,\ http://dx.doi.org/10.1063/1.2716992 journal journal Journal of Mathematical Physics \ volume 48 ( year 2007 ) NoStop

    doi

  62. [83]

    Dankert ,\ @noop title Efficient simulation of random quantum states and operators ( year 2005 ),\ https://arxiv.org/abs/quant-ph/0512217 arXiv:quant-ph/0512217 [quant-ph] NoStop

    author author C. Dankert ,\ @noop title Efficient simulation of random quantum states and operators ( year 2005 ),\ https://arxiv.org/abs/quant-ph/0512217 arXiv:quant-ph/0512217 [quant-ph] NoStop

    2005 arXiv

  63. [84]

    author author A. W. \ Harrow \ and\ author R. A. \ Low ,\ title title Random quantum circuits are approximate 2-designs ,\ https://doi.org/10.1007/s00220-009-0873-6 journal journal Communications in Mathematical Physics \ volume 291 ,\ pages 257 ( year 2009 ) ,\ https://arxiv....

    arXiv

  64. [85]

    author author F. G. S. L. \ Brand \ a o , author A. W. \ Harrow ,\ and\ author M. Horodecki ,\ title title Local random quantum circuits are approximate polynomial-designs ,\ https://doi.org/10.1007/s00220-016-2706-8 journal journal Communications in Mathematical Physics \ vol...

    arXiv

  65. [86]

    Dankert , author R

    author author C. Dankert , author R. Cleve , author J. Emerson ,\ and\ author E. Livine ,\ title title Exact and approximate unitary 2-designs and their application to fidelity estimation ,\ http://dx.doi.org/10.1103/PhysRevA.80.012304 journal journal Physical Review A \ volum...

    doi

  66. [87]

    Magesan , author J

    author author E. Magesan , author J. M. \ Gambetta ,\ and\ author J. Emerson ,\ title title Scalable and robust randomized benchmarking of quantum processes ,\ https://doi.org/10.1103/PhysRevLett.106.180504 journal journal Physical Review Letters \ volume 106 ,\ pages 180504 (...

    doi

  67. [88]

    Yoshida \ and\ author A

    author author B. Yoshida \ and\ author A. Kitaev ,\ @noop title Efficient decoding for the hayden--preskill protocol ( year 2017 ),\ https://arxiv.org/abs/1710.03363 arXiv:1710.03363 [quant-ph] NoStop

    2017 arXiv

  68. [89]

    Chiribella , author G

    author author G. Chiribella , author G. M. \ D'Ariano ,\ and\ author P. Perinotti ,\ title title Theoretical framework for quantum networks ,\ https://doi.org/10.1103/PhysRevA.80.022339 journal journal Physical Review A \ volume 80 ,\ pages 022339 ( year 2009 ) ,\ https://arxi...

    arXiv

  69. [90]

    Sheridan , author D

    author author L. Sheridan , author D. Maslov ,\ and\ author M. Mosca ,\ title title Approximating fractional time quantum evolution ,\ https://doi.org/10.1088/1751-8113/42/18/185302 journal journal Journal of Physics A: Mathematical and Theoretical \ volume 42 ,\ pages 185302 ...

    doi

  70. [91]

    Tang \ and\ author J

    author author E. Tang \ and\ author J. Wright ,\ https://arxiv.org/abs/2508.00055 title Are controlled unitaries helpful? ( year 2025 ),\ https://arxiv.org/abs/2508.00055 arXiv:2508.00055 [quant-ph] NoStop

    2025 arXiv

  71. [92]

    Folkertsma , author L

    author author M. Folkertsma , author L. Grevink , author J. Helsen ,\ and\ author A. Dutkiewicz ,\ @noop title Arts & crafts: Strong random unitaries and geometric locality ( year 2026 ),\ https://arxiv.org/abs/2605.03023 arXiv:2605.03023 [quant-ph] NoStop

    2026 arXiv

  72. [93]

    Schuster , author J

    author author T. Schuster , author J. Haferkamp ,\ and\ author H.-Y. \ Huang ,\ title title Random unitaries in extremely low depth ,\ https://doi.org/10.1126/science.adu0064 journal journal Science \ volume 389 ,\ pages 92 ( year 2025 b ) ,\ https://arxiv.org/abs/2407.07754 a...

    arXiv

  73. [94]

    author author D. A. \ Levin \ and\ author Y. Peres ,\ https://doi.org/10.1090/mbk/107 title Markov Chains and Mixing Times ,\ edition 2nd \ ed.\ ( publisher American Mathematical Society ,\ address Providence, Rhode Island ,\ year 2017 )\ note with contributions by Elizabeth L...

    doi

  74. [95]

    author author C. W. \ Helstrom ,\ @noop title Quantum Detection and Estimation Theory \ ( publisher Academic Press ,\ address New York ,\ year 1976 ) NoStop

    1976

  75. [96]

    Cui , author T

    author author L. Cui , author T. Schuster , author F. Brandao ,\ and\ author H.-Y. \ Huang ,\ https://arxiv.org/abs/2507.06216 title Unitary designs in nearly optimal depth ( year 2025 ),\ https://arxiv.org/abs/2507.06216 arXiv:2507.06216 [quant-ph] NoStop

    2025 arXiv

  76. [97]

    author author K. Azuma ,\ title title Weighted sums of certain dependent random variables ,\ https://doi.org/10.2748/tmj/1178243286 journal journal Tohoku Mathematical Journal \ volume 19 ,\ pages 357 ( year 1967 ) NoStop

    1967

  77. [98]

    \ Chen , author J

    author author C.-F. \ Chen , author J. Haah , author J. Haferkamp , author Y. Liu , author T. Metger ,\ and\ author X. Tan ,\ https://arxiv.org/abs/2406.07478 title Incompressibility and spectral gaps of random circuits ( year 2024 ),\ https://arxiv.org/abs/2406.07478 arXiv:24...

    2024 arXiv

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.