Metraipolis › archive › dc_2bd3f2fe0faa
Comparing magic state cultivation methods using matrix product states — arXiv:2609.19116
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19116
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T17:18:35.550Z
- SHA-256 of the archived text
e6558ad6bf9f1437a01e9f30ae94ac1bca90a9138dab7389c3f7e2f4c393e71f- Stable URL of this page
https://metraipolis.com/documento/dc_2bd3f2fe0faa
How to cite
Comparing magic state cultivation methods using matrix product states — arXiv:2609.19116 — arXiv (en), https://arxiv.org/abs/2609.19116 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2bd3f2fe0faa (Metraipolis archive dc_2bd3f2fe0faa, sha256 e6558ad6bf9f1437a01e9f30ae94ac1bca90a9138dab7389c3f7e2f4c393e71f)
BibTeX
@misc{dc2bd3f2fe0faa,
title = {Comparing magic state cultivation methods using matrix product states — arXiv:2609.19116},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19116},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2bd3f2fe0faa; sha256 e6558ad6bf9f1437a01e9f30ae94ac1bca90a9138dab7389c3f7e2f4c393e71f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19116. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Magic state cultivation prepares high-fidelity magic states at low expected space-time costs; however, the exact performance of some schemes is unsettled due to the difficulty in simulating non-Clifford circuits. Here, we use matrix-product states (MPS) based methods to compute the exact performance of two types of fold-transversal cultivation schemes: (i) the Sahay et al method based on the regular surface code S gate, and (ii) a method we propose based on a partially fault-tolerant fold-transversal S gate. We show that for the former protocol at $d=5$, the $|T\rangle$ output reaches similar logical error rates to the $|S\rangle$ output, traditionally used as a cheap full Clifford proxy. This contrasts with the $\sim10\times$ discrepancy reported for the $d=5$ colour-code scheme of Gidney et al. We also find that our new $d=5$ scheme has $\sim1.3\times$ lower expected space-time cost while still reaching $10^{-9}$ logical error rate. We show that MPS and Clifford-augmented MPS (CAMPS) perform on par with or even better than the recently introduced near-Clifford simulator Clifft on the hardest $d=5$ regular surface code scheme. Additionally, to speed up simulation, we propose a new pre-screening method based on simple Pauli propagation, lowering by up to three orders of magnitude the required number of exact simulations, and use several simulator-agnostic sampling methods such as subset sampling.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-17 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.19116 — 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-15T16:20:45.899Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).