Metraipolis › archive › dc_ee10df6ddae8
Computational Bounds for $f$-Routing — arXiv:2609.40278
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.40278
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:18:04.474Z
- SHA-256 of the archived text
0952b6b7a02cb32a383cbb83ef268108ecadfa779dbb65bcff719a4dd2ee1e14- Stable URL of this page
https://metraipolis.com/documento/dc_ee10df6ddae8
How to cite
Computational Bounds for $f$-Routing — arXiv:2609.40278 — arXiv (en), https://arxiv.org/abs/2609.40278 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ee10df6ddae8 (Metraipolis archive dc_ee10df6ddae8, sha256 0952b6b7a02cb32a383cbb83ef268108ecadfa779dbb65bcff719a4dd2ee1e14)
BibTeX
@misc{dcee10df6ddae8,
title = {Computational Bounds for $f$-Routing — arXiv:2609.40278},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.40278},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ee10df6ddae8; sha256 0952b6b7a02cb32a383cbb83ef268108ecadfa779dbb65bcff719a4dd2ee1e14},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.40278. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The $f$-routing protocol is a leading candidate for quantum position verification (Kent, Munro, and Spiller, 2011), but security guarantees for explicit functions remain limited. We prove unconditional resource lower bounds for uniform attackers; our new techniques bypass communication-complexity bounds central to previous works, which are inherently at most linear in the input length. We show that, for input length $n$ and sufficiently small constant $\epsilon>0$, a uniformly generated strategy using $q$ qubits and having description length $\mathrm{poly}(q)$, with success probability at least $1-\epsilon$ on every input, implies the following computational bounds on $f$: 1. If the strategies are arbitrary quantum channels, then $f\in\mathrm{QSZK}(\mathrm{poly}(nq))$, where $\mathrm{QSZK}(T)$ is the class of languages having quantum statistical zero knowledge proofs in which the verifier runs in time $T$ (and the simulator in time $\mathrm{poly}(T)$). 2. If the strategies are explicit Pauli-sparse unitaries on $q$ qubits that have at most $s$ nonzero Pauli coefficients, then $f\in\mathrm{DTIME}(\mathrm{poly}(nqs))$. 3. If the strategies are Clifford+T circuits using at most $t$ magic gates, then $f\in\mathrm{DTIME}(\mathrm{poly}(nq2^t))$. Time and space hierarchies then yield explicit functions secure against polynomial and even quasipolynomial qubits $q$ under our computational restrictions. These bounds exceed the $q\le\log n$ bound of Bluhm, Christandl, and Speelman (2022) for inner product function $f=\mathrm{IP}$, at the cost of restricting adversarial computation and increasing honest evaluation complexity.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in cs.CC).
Categorie arXiv: Quantum Physics (quant-ph) ; Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2609.40278 — 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-07T14:51:27.488Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).