All-optical quantum memory using bosonic quantum error correction codes

• URL: http://arxiv.org/abs/2603.21721v1
• Date: Mon, 23 Mar 2026 09:07:12 GMT
• Title: All-optical quantum memory using bosonic quantum error correction codes
• Abstract summary: We present an all-optical quantum memory architecture in which a Gottesman-Kitaev-Preskill encoded qubit is stored in a fibre loop.<n>We show that syndrome decoder optimization plays a crucial role in the experimentally relevant finite-squeezing regime.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reliable quantum memory is essential for scalable quantum networks and fault-tolerant photonic quantum computing. We present a quantitative analysis of an all-optical quantum memory architecture in which a Gottesman-Kitaev-Preskill (GKP) encoded qubit is stored in a fibre loop and periodically stabilized using teleportation-based error correction. By modelling fibre propagation as a pure-loss channel and representing each correction round as an effective logical map acting on the Bloch vector, we obtain a compact description of the full multi-round memory channel. We show that syndrome decoder optimization plays a crucial role in the experimentally relevant finite-squeezing regime. The optimal decoder deviates from standard square-grid GKP decoder in both tile-size and tile-shape, leading to significant improved logical performance. Using this optimized decoding strategy, we identify a squeezing-dependent optimal spacing between correction nodes that maximizes the memory lifetime. Remarkably, this optimal segment length is largely independent of the desired storage time, providing a simple and practical design rule for fibre-loop quantum memory. We further find a squeezing threshold of approximately 6.7 dB below which intermediate error correction becomes counterproductive, while above threshold the achievable storage time increases approximately exponentially with squeezing. For example, at 17 dB squeezing, storage times exceeding 400 ms can be achieved with logical infidelity below 1%. These results establish clear performance benchmarks and reveal the fundamental trade-off between photon loss, squeezing, and correction frequency in continuous-variable architectures. Our findings provide actionable design principles for near-term photonic quantum memory and clarify the path toward scalable all-optical fault-tolerant quantum storage.

Related papers

• A Chip-scale Space-time Multiplexed Gaussian Boson Sampling Processor Beyond 10,000 Photons [28.615566045219897]
  We report the first chip-scale spacetime multiplexed Gaussian boson sampling (GBS) system, monolithically integrating high-speed electrooptic modulators, on-chip delay lines, and a time-space multiplexed interferometric network on a thin-film lithium niobate chip.<n>We further reconfigure the photonic hardware into a GBS-powered world model for modelling physical dynamics,which achieves lower prediction error with fewer trainable readout parameters.
  arXiv  Detail & Related papers  (2026-09-10T17:58:13Z)
• Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction [5.2107604548805915]
  Approximate quantum error correction (AQEC) dictates the performance of discrete- and continuous-variable quantum error correction codes.<n>Finding the optimal recovery channel to maximize entanglement fidelity via standard semidefinite programming is computationally bottlenecked by the exponentially growing number of Kraus operators.<n>We establish an efficient framework by leveraging the duality between recovery and environment decoupling.
  arXiv  Detail & Related papers  (2026-07-27T18:18:58Z)
• High-Rate and Resource-Efficient All-Photonic Quantum Repeater Architectures with 9 km Repeater Spacing [3.1498833540989413]
  Quantum communication between two distant parties will serve as a cornerstone of the future quantum internet.<n>We propose an all-photonic quantum repeater architecture that enables quantum communication over 1,000 km with an equidistant repeater spacing of 9 km.<n>In the presence of these imperfections, our realization requires only a few thousand GKP qubits per repeater station per protocol run.
  arXiv  Detail & Related papers  (2026-06-24T02:26:48Z)
• OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond [50.440302567029654]
  Multi-modal intelligence has made the Key-Value cache a dominant memory bottleneck for efficient deployment.<n>In this work, we revisit the inherent limitations of the per-channel quantization paradigm.<n>We propose OScaR, an accurate and lightweight KV cache compression framework for X-LLMs.
  arXiv  Detail & Related papers  (2026-05-19T10:53:03Z)
• Scalable Optical Quantum State Synthesizer with Dual-Mode Resonator Memory [0.9051845653704739]
  We show a scalable method to generate optical non-Gaussian states with a resonator-based quantum memory.<n>By employing a time-domain-multiplexed approach, we successfully demonstrate both cat and Gottesman-Kitaev-Preskill breeding protocols.<n>These results establish a scalable pathway to generating complex non-Gaussian states required for fault-tolerant optical quantum computing.
  arXiv  Detail & Related papers  (2025-02-13T07:41:44Z)
• Fault-Tolerant Belief Propagation for Practical Quantum Memory [6.322831694506286]
  A fault-tolerant approach to reliable quantum memory is essential for scalable quantum computing. We propose a decoder that utilizes a space-time Tanner graph across multiple rounds of syndrome extraction with mixed-alphabet error variables. Our simulations demonstrate high error thresholds of 0.4%-0.87% and strong error-floor performance for topological code families.
  arXiv  Detail & Related papers  (2024-09-27T12:21:45Z)
• Qubit-efficient quantum combinatorial optimization solver [0.0]
  We develop a qubit-efficient algorithm that overcomes the limitation by mapping a candidate bit solution to an entangled wave function of fewer qubits. This approach could benefit near-term intermediate-scale and future fault-tolerant small-scale quantum devices.
  arXiv  Detail & Related papers  (2024-07-22T11:02:13Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Graph Neural Network Autoencoders for Efficient Quantum Circuit Optimisation [69.43216268165402]
  We present for the first time how to use graph neural network (GNN) autoencoders for the optimisation of quantum circuits. We construct directed acyclic graphs from the quantum circuits, encode the graphs and use the encodings to represent RL states. Our method is the first realistic first step towards very large scale RL quantum circuit optimisation.
  arXiv  Detail & Related papers  (2023-03-06T16:51:30Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.<n>We introduce a neural network-based decoding algorithm supported by an improved lookup table decoder.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)

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.