Metraipolis › archive › dc_bf886d44635c

Strong unitary designs in optimal depth and space — arXiv:2608.13491

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13491
License (as archived)
CC0-1.0
Archived
2026-10-19T05:05:15.167Z
SHA-256 of the archived text
541497003ef0593704d5849eb9c8191be836070692e48099549c93b1a91a326d
Stable URL of this page
https://metraipolis.com/documento/dc_bf886d44635c

How to cite

Strong unitary designs in optimal depth and space — arXiv:2608.13491 — arXiv (en), https://arxiv.org/abs/2608.13491 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bf886d44635c (Metraipolis archive dc_bf886d44635c, sha256 541497003ef0593704d5849eb9c8191be836070692e48099549c93b1a91a326d)
BibTeX
@misc{dcbf886d44635c,
  title = {Strong unitary designs in optimal depth and space — arXiv:2608.13491},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13491},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bf886d44635c; sha256 541497003ef0593704d5849eb9c8191be836070692e48099549c93b1a91a326d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13491. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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ão, 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.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-14 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2608.13491 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:54:42.527Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).