Metraipolis › archive › dc_cdbfa445b3d4

monoprop: Scaling Pauli and Majorana propagation via Anticommutation Indices — arXiv:2610.21000

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.21000
License (as archived): CC0-1.0
Archived: 2026-10-16T10:44:47.121Z
SHA-256 of the archived text: f6b11406d19218bb920b9593c711d93c94fb122b036db11f3c50d8c2ddc93f4e
Stable URL of this page: https://metraipolis.com/documento/dc_cdbfa445b3d4

How to cite

monoprop: Scaling Pauli and Majorana propagation via Anticommutation Indices — arXiv:2610.21000 — arXiv (en), https://arxiv.org/abs/2610.21000 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cdbfa445b3d4 (Metraipolis archive dc_cdbfa445b3d4, sha256 f6b11406d19218bb920b9593c711d93c94fb122b036db11f3c50d8c2ddc93f4e)

BibTeX

@misc{dccdbfa445b3d4,
  title = {monoprop: Scaling Pauli and Majorana propagation via Anticommutation Indices — arXiv:2610.21000},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21000},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cdbfa445b3d4; sha256 f6b11406d19218bb920b9593c711d93c94fb122b036db11f3c50d8c2ddc93f4e},
  year = {2026}
}

Archived text

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

We introduce monoprop, an open-source, massively parallel operator-propagation framework for fermion and qubit bases. For $N$ qubits or modes, existing codes represent each of the $K$ tracked operator terms (Pauli strings or products of Majorana operators) as a $2N$-bit string, testing each for anticommutation with the gate at $O(KN)$ cost per gate. Here, we introduce the anticommutation index which rapidly looks up the terms anticommuting with a gate. A local gate changes only the terms that touch its sites, and when terms are truncated to act on few sites, only a fraction $\sim1/N$ touch any given qubit or mode, and we use this to prove the time per gate scales as $O(K/N)$. This counterintuitive result tells us that for a fixed number of terms, increasing the number of sites can make things faster. We demonstrate this numerically, and show monoprop scales almost ideally to 8192 cores, tracking $9.5\times10^{10}$ terms. Beyond propagation, we present memory-efficient surrogate graphs, which record one propagation and replay it at new angles, for fast energy re-estimation and parameter gradients, and an efficient method for finding energy-minimising gates and optimal angles for simulating adaptive quantum-chemistry circuits.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Strongly Correlated Electrons (cond-mat.str-el).
Pagina del lavoro: https://arxiv.org/abs/2610.21000 — 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-16T08:55:37.164Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).