← 研踪 PaperTrailarXiv:2611.21500 · v1
Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation
首次提交 2026-11-17 02:00
版本更新 2026-11-17 02:00
雷达观测 2026-11-17 16:10
摘要
Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with nodes vary over their neighbour graph. Memory becomes the bottleneck when the neighbour graph arrives only after data erasure, a late-graph setting motivated by dispersed sensor networks and telemetry. We analyse three collection scenarios, reliable rounds, continuous broadcast and ordered capture, and test the Dirichlet energy of the fused decision map , with late-graph Laplacian , against two thresholds. Hidden Matching uses qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report sub-bits separately, a classical record buffer before it uses bits; classical methods need bits in the worst case. The recently introduced Quantum Oracle Sketching builds quantum oracles from random data streams without storing them. We combine coherent loading of separately reported sub-bits, exact in reliable rounds and by Quantum Oracle Sketching in continuous broadcast, with nonlinear fusion and Hidden Matching readout. The register count does not grow with , and the memory is logical qubits and classical bits, at fixed , graph bounds, thresholds and error targets: an exponential memory advantage over every classical receiver and over Hidden Matching with that buffer. We prove unbiasedness in reliable rounds, preparation bounds in continuous broadcast, classical lower bounds and, for a planner-supplied multi-hop coefficient stream, spectral error bounds. Broadcast simulations match analytic averages at , without resolved bias growth up to . Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.
作者备注:19 pages, 8 figures
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 02:00 · 最新观测版本
Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation
Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with nodes vary over their neighbour graph. Memory becomes the bottleneck when the neighbour graph arrives only after data erasure, a late-graph setting motivated by dispersed sensor networks and telemetry. We analyse three collection scenarios, reliable rounds, continuous broadcast and ordered capture, and test the Dirichlet energy of the fused decision map , with late-graph Laplacian , against two thresholds. Hidden Matching uses qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report sub-bits separately, a classical record buffer before it uses bits; classical methods need bits in the worst case. The recently introduced Quantum Oracle Sketching builds quantum oracles from random data streams without storing them. We combine coherent loading of separately reported sub-bits, exact in reliable rounds and by Quantum Oracle Sketching in continuous broadcast, with nonlinear fusion and Hidden Matching readout. The register count does not grow with , and the memory is logical qubits and classical bits, at fixed , graph bounds, thresholds and error targets: an exponential memory advantage over every classical receiver and over Hidden Matching with that buffer. We prove unbiasedness in reliable rounds, preparation bounds in continuous broadcast, classical lower bounds and, for a planner-supplied multi-hop coefficient stream, spectral error bounds. Broadcast simulations match analytic averages at , without resolved bias growth up to . Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.
查看此版本解读 →查看此版本原文 ↗