Metraipolis › archive › dc_fa6ee81e9f24
Shared Lookups and Lazy Residues: Fewer Toffoli Gates for Factoring RSA-2048 — arXiv:2611.08907
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.08907
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:48:06.549Z
- SHA-256 of the archived text
55f3a99ed2a30617cf729165e85630724c745389bfd5b713916274a752b2a992- Stable URL of this page
https://metraipolis.com/documento/dc_fa6ee81e9f24
How to cite
Shared Lookups and Lazy Residues: Fewer Toffoli Gates for Factoring RSA-2048 — arXiv:2611.08907 — arXiv (en), https://arxiv.org/abs/2611.08907 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fa6ee81e9f24 (Metraipolis archive dc_fa6ee81e9f24, sha256 55f3a99ed2a30617cf729165e85630724c745389bfd5b713916274a752b2a992)
BibTeX
@misc{dcfa6ee81e9f24,
title = {Shared Lookups and Lazy Residues: Fewer Toffoli Gates for Factoring RSA-2048 — arXiv:2611.08907},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.08907},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fa6ee81e9f24; sha256 55f3a99ed2a30617cf729165e85630724c745389bfd5b713916274a752b2a992},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.08907. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Gidney's 2025 construction for factoring RSA-2048 with few logical qubits spends most of its Toffoli gates on discrete-log table lookups and residue uncomputation. We reduce both costs. Shared lookups return entries for several primes of a residue number system at once because they have the same address. Retained intermediate residues remove recomputation during cleanup and enable lazy arithmetic with a single final modular reduction. We prove output preservation and estimate resources with an open benchmark built on the reference simulator. Against the best reference setting within the same logical-qubit budget, using the published model for the reference and benchmark counts for our circuits, we obtain $15\%$ fewer Toffolis at $1{,}461$ qubits ($5.08 \times 10^{9}$ per factoring) and $46\%$ fewer at $1{,}806$ qubits ($2.55 \times 10^{9}$). A matched ablation finds $28.8\%$ fewer Toffolis from three-prime sharing at fixed window and checkpoint settings. Architecture-specific timing determines how much becomes a runtime saving.
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.08907 — 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-09T22:42:14.913Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).