Metraipolis › archive › dc_fcdfe41afd7e

Fast Cliffords When Your Quantum Memory Is Full — arXiv:2609.40144

Source: arXiv (en)
Original: https://arxiv.org/abs/2609.40144
License (as archived): CC0-1.0
Archived: 2026-10-07T15:22:11.399Z
SHA-256 of the archived text: ebf5757c5dc6a8892d7e41bde4b36223166dbdc53cba1e2534457a6d9cfcbc13
Stable URL of this page: https://metraipolis.com/documento/dc_fcdfe41afd7e

How to cite

Fast Cliffords When Your Quantum Memory Is Full — arXiv:2609.40144 — arXiv (en), https://arxiv.org/abs/2609.40144 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fcdfe41afd7e (Metraipolis archive dc_fcdfe41afd7e, sha256 ebf5757c5dc6a8892d7e41bde4b36223166dbdc53cba1e2534457a6d9cfcbc13)

BibTeX

@misc{dcfcdfe41afd7e,
  title = {Fast Cliffords When Your Quantum Memory Is Full — arXiv:2609.40144},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.40144},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fcdfe41afd7e; sha256 ebf5757c5dc6a8892d7e41bde4b36223166dbdc53cba1e2534457a6d9cfcbc13},
  year = {2026}
}

Archived text

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

Additional qubits can reduce the depth of a quantum circuit by providing workspace for parallel computation, but standard constructions assume that this workspace is initialized in a known state. In this work we study catalytic implementations, i.e. asking whether dirty qubits can instead be used provided that their joint state including any entanglement with other registers is restored exactly at the end of the computation. We show that every $n$-qubit Clifford circuit has a catalytic implementation of depth $O(\log n)$ using $O(n^2/\log^2 n)$ catalytic qubits and no clean qubits, matching the asymptotic depth achievable when clean workspace is available. We extend this approach to diagonal elements of any fixed level $C_k$ of the Clifford hierarchy, which admit catalytic implementations of depth $O(\log(n+1))$ with $O(n^k/\log(n))$ gates and $O(n^k/\log^2(n))$ catalytic qubits, as well as to semi-Clifford Gates.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-01 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.40144 — 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-07T14:53:56.815Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).