Metraipolis › archive › dc_fd43d14e400b

Optimal (Parallel) Spooky Pebbling on Binary Trees — arXiv:2610.09434

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.09434
License (as archived)
CC0-1.0
Archived
2026-10-08T12:49:59.639Z
SHA-256 of the archived text
dfb2478b0becb6bde471fea1466537fa3c1073513592e2894fddd88180f3fe76
Stable URL of this page
https://metraipolis.com/documento/dc_fd43d14e400b

How to cite

Optimal (Parallel) Spooky Pebbling on Binary Trees — arXiv:2610.09434 — arXiv (en), https://arxiv.org/abs/2610.09434 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fd43d14e400b (Metraipolis archive dc_fd43d14e400b, sha256 dfb2478b0becb6bde471fea1466537fa3c1073513592e2894fddd88180f3fe76)
BibTeX
@misc{dcfd43d14e400b,
  title = {Optimal (Parallel) Spooky Pebbling on Binary Trees — arXiv:2610.09434},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.09434},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fd43d14e400b; sha256 dfb2478b0becb6bde471fea1466537fa3c1073513592e2894fddd88180f3fe76},
  year = {2026}
}

Archived text

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

Pebble games model computations under a fixed space budget. Spooky pebbling allows quantum memory to be released by measurement, with the resulting phases corrected later. We study two-input computations with binary-tree dependencies and determine the optimal work and parallel depth for complete binary trees. Our key idea is to clean up the tree in blocks, reducing repeated recomputation of intermediate values. For the complete tree $B_h$ with $n=2^h-1$ vertices and every space budget $h+1\le s\le n$, we give an algorithm with asymptotically optimal work $\Theta(nh/\log(s+1))$. At the minimum budget $s=h+1$, this improves the $O(n\log n)$ bound of Kornerup, Sadun, and Soloveichik to $\Theta(n\log n/\log\log n)$, resolving their time-optimality question. We also construct a parallel schedule with optimal depth \[ \Theta\!\left(h+\frac ns \max\!\left\{\frac{h}{\log(s+1)},\,1+\log^*h\right\}\right). \] Our lower bounds hold for every full binary tree. We also show that achieving optimal parallel depth can require asymptotically more work than minimizing work alone. Applying our schedule to the RNS point-addition trees in the public implementation of Chevignard, Fouque, and Schrottenloher reduces their Toffoli/AND gate count by $20.86\%$ for a P-224 instance and $22.66\%$ for a P-256 instance, using the same arithmetic circuits and peak workspace.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2610.09434 — 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-08T12:20:00.306Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).