Metraipolis › archive › dc_fd3d8fa9ed45

Classical Clifford+T Sampling without Computing Marginals — arXiv:2611.06119

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06119
License (as archived)
CC0-1.0
Archived
2026-11-05T18:32:51.161Z
SHA-256 of the archived text
4c3571a15c9bff41d0a107b7be16f776b3312e683049669e018f349fa0f22616
Stable URL of this page
https://metraipolis.com/documento/dc_fd3d8fa9ed45

How to cite

Classical Clifford+T Sampling without Computing Marginals — arXiv:2611.06119 — arXiv (en), https://arxiv.org/abs/2611.06119 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd3d8fa9ed45 (Metraipolis archive dc_fd3d8fa9ed45, sha256 4c3571a15c9bff41d0a107b7be16f776b3312e683049669e018f349fa0f22616)
BibTeX
@misc{dcfd3d8fa9ed45,
  title = {Classical Clifford+T Sampling without Computing Marginals — arXiv:2611.06119},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06119},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd3d8fa9ed45; sha256 4c3571a15c9bff41d0a107b7be16f776b3312e683049669e018f349fa0f22616},
  year = {2026}
}

Archived text

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

We introduce a new exact classical sampling algorithm for Clifford+T circuits, called T-by-T sampling. For a circuit with T-count t, it reduces sampling to evaluating 2t amplitudes of circuits with successively increasing T-counts 1,2,...,t, without the need to compute costly marginal probabilities. Crucially, the number of amplitude evaluations is completely independent of the surrounding Clifford structure. This makes T-by-T sampling well suited for use together with low-rank stabiliser decompositions, which enable efficient amplitude evaluations as long as the T-count is not too high. In that sense, T-by-T sampling is an improvement over the gate-by-gate sampling technique introduced by Bravyi, Gosset, and Liu (Phys. Rev. Lett. 128, 2022), where the number of amplitudes instead scales with the number of non-monomial operations such as Hadamard gates, which can remain large even in circuits with low stabiliser rank. Concretely, T-by-T sampling offers significant speedups in regimes where T gates are embedded within large Clifford computations. This makes it well suited for applications such as simulating quantum error correction experiments, which typically have lower T complexity but involve extensive Clifford operations and measurements. In particular, we show how T-by-T sampling allows us to take samples from recent end-to-end magic state cultivation circuits with escape up to distance 19 in a couple of seconds.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2611.06119 — 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-11-05T18:22:49.018Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).