Protecting Astronomical Interferometry through Quantum-Memory Scrambling

• URL: http://arxiv.org/abs/2607.17321v2
• Date: Mon, 27 Jul 2026 15:39:41 GMT
• Title: Protecting Astronomical Interferometry through Quantum-Memory Scrambling
• Abstract summary: Preserving the complex visibility of coherently captured starlight is essential for quantum-assisted long-baseline interferometry.<n>We prove a channel-to-Fisher-information stability theorem that converts approximate logical recovery into an operational guarantee on receiver-accessible information.<n>Although the present low-rate design does not yet improve fixed-total-memory throughput, it establishes a blueprint for converting spare memory capacity into protection of astronomical coherence.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Preserving the complex visibility of coherently captured starlight is essential for quantum-assisted long-baseline interferometry, because this nonlocal coherence carries the spatial information needed to form astronomical images. Yet finite memory lifetime and imperfect retrieval inevitably produce storage failures; when a failed cell is heralded, its erased subsystem can leak which-node information to the environment and dephase the stored coherence. Strict finite-dimensional (\(U(1)\)) covariance further forbids uniform exact correction of all single-memory erasures. We address this combined physical and symmetry-imposed limit using local number-conserving quantum scrambling, parameter-independent pattern-conditioned recovery, and a fixed Gottesman--Jennewein--Croke receiver. We prove a channel-to-Fisher-information stability theorem that converts approximate logical recovery into an operational guarantee on receiver-accessible information over compact visibility regions. All-pattern finite-size simulations show that scrambling redistributes erasure risk and suppresses high-leakage events, while a separate equal-budget comparison identifies a shallow design that outperforms the tested deeper and charge-sector Haar-random benchmarks at the prespecified operating point. A separate compilation resolves every nontrivial recovery branch into abstract nearest-neighbor number-conserving gates. Although the present low-rate design does not yet improve fixed-total-memory throughput, it establishes a blueprint for converting spare memory capacity into protection of astronomical coherence, opening a path toward higher-rate, erasure-resilient quantum telescope architectures.

Related papers

• Exact Virtual Channel Programming with Vanishing Excess Overhead [4.909277520835048]
  A finite-dimensional physical processor cannot exactly program a continuous family of distinct unitary channels.<n>We show that this obstruction becomes quantitative when the target channel is stored in a normalized Choi state.<n>For arbitrary $d$-dimensional channels, we construct a target-independent exact reconstruction protocol.
  arXiv  Detail & Related papers  (2026-09-01T15:35:16Z)
• Information-Calibrated Quantum Diffusion: Aligning Forward Noise with Reverse Recoverability [10.481986290704821]
  We introduce the classical--quantum information decrement $_t=I(X:Q_t-1)-I(X:Q_t) as an intrinsic diffusion coordinate.<n>Along depolarization, equalizing $_t$ yields the unique minimax discretization of the forward information loss.
  arXiv  Detail & Related papers  (2026-08-14T08:44:51Z)
• REAL-OW: Rehearsal-free Open World Object Detection with Low-Rank Adaptation and Dual-Stage Objectness Modeling [56.888597798431704]
  Open-World Object Detection (OWOD) requires detectors to identify previously unseen objects as unknown and incrementally incorporate them into the set of known categories.<n>Existing frameworks rely heavily on exemplar replay to mitigate catastrophic forgetting, but in some real applications, storing raw data conflicts with data access restrictions and leads to data exposure risks.<n>We propose REAL-OW, a novel rehearsal-free framework that decouples incremental knowledge through a collaborative adapter architecture.
  arXiv  Detail & Related papers  (2026-07-03T06:38:54Z)
• Asymptotic Limits of Entanglement Distribution [43.748379918040854]
  We investigate the limits of entanglement distribution across quantum networks utilizing intermediate stations and local operations.<n>We establish a strict dichotomy: the preservation of entanglement over arbitrarily long distances is possible if the underlying quantum channel admits a correctable subspace.<n>We derive a fundamental lower bound on the physical resource requirements, proving that for channels without a correctable subspace, the number of parallel channels per link must scale at least logarithmically with the number of intermediate stations to sustain a non-zero amount of entanglement.
  arXiv  Detail & Related papers  (2026-05-22T09:56:38Z)
• Topological protection of local quantum Fisher information [0.0]
  unitary dynamics generically delocalize locally encoded information, causing single-site metrological sensitivity to vanish.<n>We analytically demonstrate that a topological phase can prevent this dispersal.<n>We show numerically that the asymmetry is robust to moderate quenched on-site disorder, while the boundary plateau remains visible under parity-preserving interactions.
  arXiv  Detail & Related papers  (2026-05-01T16:32:39Z)
• Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification [15.392070935885739]
  We formalize current-state opacity within the framework of safe partially observed quantum Petri nets.<n>We define quantitative posterior-state leakage as the trace distance between the attacker's localized quantum states.<n>An entanglement-swapping case study validates the exact leakage evaluation, demonstrates substantial computational gains.
  arXiv  Detail & Related papers  (2026-04-20T04:14:26Z)
• Cell-Dependent Criticality for Quantum Metrology [5.638859030750754]
  We propose to leverage the intrinsic hopping inhomogeneity arising from bosonic ladder-operator matrix elements in Fock-space lattices.<n>Key system parameters become cell dependent, effectively tracing out a curve in a topological phase diagram.
  arXiv  Detail & Related papers  (2026-04-15T18:00:40Z)
• State-dependent geometries from magic-enriched quantum codes [9.01054786797498]
  We introduce a Ryu-Takayanagi-like entropy decomposition for approximate subsystem erasure-correcting codes.<n>We identify the origin of this response as a form of tripartite non-local magic in the Choi state of the encoding map.
  arXiv  Detail & Related papers  (2026-03-13T18:00:05Z)
• Rethinking Multi-Condition DiTs: Eliminating Redundant Attention via Position-Alignment and Keyword-Scoping [61.459927600301654]
  Multi-condition control is bottlenecked by the conventional concatenate-and-attend'' strategy.<n>Our analysis reveals that much of this cross-modal interaction is spatially or semantically redundant.<n>We propose Position-aligned and Keyword-scoped Attention (PKA), a highly efficient framework designed to eliminate these redundancies.
  arXiv  Detail & Related papers  (2026-02-06T16:39:10Z)
• Stochastic Quantum Information Geometry and Speed Limits at the Trajectory Level [35.18016233072556]
  We bridge the gap between quantum information geometry and thermodynamics by introducing the Conditional Quantum Fisher Information (CQFI)<n>We show that the CQFI admits a decomposition into incoherent (population) and coherent (basis rotation) contributions, augmented by a transient interference cross-term absent at the ensemble level.
  arXiv  Detail & Related papers  (2026-01-18T16:23:26Z)
• Fragility of Optimal Measurements due to Noise in Probe States for Quantum Sensing [0.0]
  We show how discontinuities increase fragility through Jensen's inequality.<n>We present a framework for understanding how discontinuities increase fragility through Jensen's inequality.
  arXiv  Detail & Related papers  (2026-01-13T16:39:41Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• CoCo-Fed: A Unified Framework for Memory- and Communication-Efficient Federated Learning at the Wireless Edge [50.42067935605982]
  We propose a novel Compression and Combination-based Federated learning framework that unifies local memory efficiency and global communication reduction.<n>CoCo-Fed significantly outperforms state-of-the-art baselines in both memory and communication efficiency while maintaining robust convergence under non-IID settings.
  arXiv  Detail & Related papers  (2026-01-02T03:39:50Z)
• Metrologically advantageous states: long-range entanglement and asymmetric error correction [10.298522900896726]
  We develop a framework that connects metrological performance to long-range entanglement, state-preparation complexity, and quantum error-correction properties.<n>We show that for two broad classes of quantum error-correcting codes, nondegenerate codes and Calderbank-Shor--Steane quantum low-density parity-check codes, a nonconstant code distance precludes super-linear QFI scaling.<n>In particular, we show that states associated with classical low-density parity-check codes, as well as asymmetric toric code states, both having asymmetric logical distances, can achieve Heisenberg-limited scaling.
  arXiv  Detail & Related papers  (2025-12-23T15:10:53Z)
• Robustness of quantum data hiding against entangled catalysts and memory [47.791962198275066]
  We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols.<n>We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability.<n>In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly.
  arXiv  Detail & Related papers  (2025-11-06T14:36:36Z)
• Crosstalk-Resilient Quantum MIMO for Scalable Quantum Communications [40.44880302154388]
  Crosstalk arises when physically coupled quantum modes interfere, degrading signal fidelity.<n>We propose a mitigation strategy based on encoding discrete-variable quantum information into continuous-variable modes.<n>We prove the existence of a gauge-fixing decoder enabling recovery of the logical information.
  arXiv  Detail & Related papers  (2025-06-26T18:40:26Z)
• Fault-Tolerant Qudit Gate Optimization in Solid-State Quantum Memory [0.0]
  This work presents a framework for high-dimensional qudit memory in 153Eu:Y2SiO5.<n>We develop a qudit error correction scheme optimized for solid-state quantum memory.
  arXiv  Detail & Related papers  (2025-03-05T15:06:39Z)
• Entanglement Distribution in Quantum Repeater with Purification and Optimized Buffer Time [53.56179714852967]
  We explore entanglement distribution using quantum repeaters with optimized buffer time. We observe that increasing the number of memories on end nodes leads to a higher entanglement distribution rate per memory. When imperfect operations are considered, however, we make the surprising observation that the per-memory entanglement rate decreases with increasing number of memories.
  arXiv  Detail & Related papers  (2023-05-23T23:23:34Z)
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding [35.693513369212646]
  We address the problem of reliable provision of entangled qubits in quantum computing schemes. We combine indirect transmission based on teleportation and distillation; (2) direct transmission, based on quantum error correction (QEC) Our results show that ad-hoc asymmetric codes give, compared to conventional QEC, a performance boost and codeword size reduction both in a single link and in a quantum network scenario.
  arXiv  Detail & Related papers  (2023-05-01T17:13:23Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)
• Multidimensional dark space and its underlying symmetries: towards dissipation-protected qubits [62.997667081978825]
  We show that a controlled interaction with the environment may help to create a state, dubbed as em dark'', which is immune to decoherence. To encode quantum information in the dark states, they need to span a space with a dimensionality larger than one, so different states act as a computational basis. This approach offers new possibilities for storing, protecting and manipulating quantum information in open systems.
  arXiv  Detail & Related papers  (2020-02-01T15:57:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.