Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09434

Optimal (Parallel) Spooky Pebbling on Binary Trees

Mingyu Lee·Sanghyun Lee·Kabgyun Jeong
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 $Θ(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 $Θ(n\log n/\log\log n)$, resolving their time-optimality question. We also construct a parallel schedule with optimal depth \[ Θ\!\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.

Explore related subjects

cs.CC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mingyu Lee, Sanghyun Lee, Kabgyun Jeong. 2026-10-07. Optimal (Parallel) Spooky Pebbling on Binary Trees. https://arxiv.org/abs/2610.09434

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Near-Inverse-Linear Barriers for Explicit Affine Witness Isolation

We study randomized nonuniform polynomial-size transformations that output explicit binary affine filters for circuit inputs whose nonempty satisfying sets are affine. The filter may depend on the entire input description; no affine basis is supplied. For every fixed $δ<1$, a worst-case singleton success guarantee $Ω(n^{-δ})$, where $n$ is the witness arity, implies $NP\subseteq P/poly$. More generally, any success guarantee $ω(\log n/n)$ yields satisfiability circuits of size $(s+2)^{O(1)}2^{o(v)}$ for length-$s$ descriptions with at most $v$ witness variables, hence subexponential in $v$ when $s=v^{O(1)}$. Conversely, SAT search-to-decision gives deterministic perfect isolation, making polynomial-resource fixed-exponent strong affine isolation equivalent to $NP\subseteq P/poly$. For explicit unions of at most $n^β$ affine components, success $Ω(n^{-δ})$ implies the same collapse whenever $β,δ\ge0$ and $β+δ<1$. The inverse-linear endpoint is not claimed.

cs.CC↗
arXiv2026

Countability versus Computability

The concept of {\em countable sets} is attributed to Georg Cantor, who established the distinction between countable and uncountable sets in 1874. The concept of {\em computable sets} emerged in the 1930s through the foundational work on computing models by \Godel, Church, and Turing. In this paper, we investigate the connection between countability and computability. A {\em counting bijection} of a set $S$ is a bijection from the set of natural numbers to $S$. We say $S$ is {\em enumerable} if it is either finite or admitting a computable counting bijection. Our initial investigation shows that a set $S$ is enumerable if and only if it is computable. This equivalence offers new insights into set theory and computability theory. We further show that a set is countable if and only if it admits a {\em counting order}, which is a well order satisfying the {\em proximal} property. Based on this concept, we provide a procedure whose existence gives a necessary and sufficient condition for a set to be countable. This procedure is an algorithm if and only if the set is computable. A counting bijection $f$ is {\em increasing} if $f(x)>f(y)$ whenever $x>y$. We prove that an infinite set $S$ of natural numbers is definable in first-order arithmetic if and only if $S$ has an increasing counting bijection. This result has a significant implication: the standard proof that every set $S$ of natural numbers is countable is invalid. This is because the existing proof establishes that $S$ has an increasing counting bijection, which (by our result) would imply that $S$ is definable in first-order arithmetic. This leads to a contradiction with Tarski's undefinability theorem when $S$ is the set of \Godel\ numbers of the true arithmetic sentences.

cs.CC↗