Searcharxiv⌕ Search

arXiv · 2611.21500

Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation

Abstract

Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with $N$ 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 $\mathcal E_G=\mathbf z^{\mathsf T}\mathbf L\mathbf z/N$ of the fused decision map $\mathbf z\in\{\pm1\}^N$, with late-graph Laplacian $\mathbf L$, against two thresholds. Hidden Matching uses $O(\log N)$ qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report $b$ sub-bits separately, a classical record buffer before it uses $O(N b)$ bits; classical methods need $Ω(\sqrt N)$ 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 $R$ does not grow with $N$, and the memory is $O(\log N)$ logical qubits and classical bits, at fixed $b$, 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 $N=1024$, without resolved bias growth up to $N=2^{20}$. Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Burhan Gülbahar. 2026-11-16. Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation. https://searcharxiv.com/abs/2611.21500

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Diamond Quantum Oscilloscope

Quantum-enhanced metrology has achieved remarkable precision in parameter estimation, but extending these advantages to continuous time-dependent fields (waveform sensing) remains a formidable challenge due to the infinite-dimensional nature of the signal. Here, we report the first experimental realization of a room-temperature solid-state quantum oscilloscope based on a sequential quantum difference amplification strategy. Within a zero-order-hold reconstruction framework, our method completely bypasses the need for massive entanglement. Crucially, we demonstrate that the overall waveform reconstruction error unequivocally follows the theoretically predicted Heisenberg scaling of \(O(N^{-1/2})\), decisively surpassing the classical \(O(N^{-1/3})\) limit. This transformative precision requires approximately 30-fold fewer quantum resources than conventional methods to achieve the same waveform error. Furthermore, we demonstrate the reconstruction of a multicomponent waveform and distinctly resolve weak high-frequency components that are entirely drowned in the shot noise of classical sampling. These results transition quantum metrology from parameter estimation into a practical instrument, establishing a genuine quantum advantage in continuous waveform reconstruction and paving the way for critical applications such as nanoscale nuclear magnetic resonance imaging, where detecting extremely weak signals is crucial for resolving molecular structures.

quant-ph↗

Entanglement preservation and Clauser-Horne nonlocality in electromagnetically induced transparency quantum memories

Understanding how decoherence-induced loss affects entanglement and nonlocal correlations in quantum memories is important for quantum information science. Here we develop a quantitative description of photonic quantum states retrieved from electromagnetically induced transparency (EIT) memories in a ground-state-decoherence-limited regime. Using the dark-state-polariton formalism, we derive the attenuation factor of the retrieved probe mode from the EIT dynamics. This attenuation depends on the coupling field and ground-state coherence decay and is not introduced as an independent phenomenological loss parameter. Within a specified quantum-limited pure-loss model, we use this attenuation to obtain the reduced photonic density operator. We show that, in the symmetric case, the complete retrieved state of an initially path-entangled single photon remains entangled for any nonzero storage efficiency, despite acquiring a vacuum component. In contrast, violation of the unconditional Clauser-Horne inequality under displaced on/off detection without post-selection requires an intrinsic efficiency above 89.7%. We further derive the retrieved N-qubit photonic density operator for multiple independently operating EIT memories. These results establish a quantitative connection between EIT memory dynamics, retrieved quantum states, and operational nonlocality benchmarks under explicit channel assumptions.

quant-ph↗

Geometric encoding of turbulence for end-to-end quantum simulation

Simulating multiscale turbulence in engineering remains challenging. Any quantum advantage for such simulations requires efficient initial-state preparation. Yet exact loading of an arbitrary classical snapshot requires exponential quantum resources. We introduce "turbuloscope", a physics-informed geometric method that generates statistically representative turbulent initial states in a gate-based register from a parameterized Pauli-spinor multiscale distribution. Scale invariance renders conditional rotations approximately affine in Gray-code space, enabling linear-depth, ancilla-free preparation. The generalized Madelung transform and Hopf fibration map the encoded Pauli spinor to fluid observables and vortex tubes. The qubit count scales logarithmically with the Reynolds number, yielding an exponential reduction in preparation overhead relative to full-grid classical spectral synthesis. We classically emulate a 30-qubit preparation circuit and generate a turbulent field over one billion grid points at a scale-inferred Reynolds number of 35,000, exhibiting Kolmogorov's five-thirds energy spectrum, tangled vortex tubes, and intermittency. This method provides scalable initial states for quantum simulation of turbulence and multiscale systems.

quant-ph↗