Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation

• URL: http://arxiv.org/abs/2509.06446v1
• Date: Mon, 08 Sep 2025 08:47:11 GMT
• Title: Improving Entanglement Resilience in Quantum Memories with Error-Detection-Based Distillation
• Authors: Huidan Zheng, Gunsik Min, Ilkwon Sohn, Jun Heo,
• Abstract summary: entanglement degradation is a critical challenge for scalable quantum networks.<n>We present an entanglement distillation protocol based on the [[4,2,2]] quantum error-detecting code.<n>We investigate a re-distillation strategy in which stored logical entangled states are refreshed using only local operations and classical communication.
• Score: 0.13999481573773068
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The degradation of entanglement in quantum memories due to decoherence is a critical challenge for scalable quantum networks. We present an entanglement distillation protocol based on the [[4,2,2]] quantum error-detecting code, deriving analytical expressions for its output fidelity and yield, and benchmarking it against the BBPSSW protocol. In addition to initial distillation, we investigate a re-distillation strategy in which stored logical entangled states are refreshed using only local operations and classical communication, avoiding the need to regenerate and redistribute entanglement from scratch. Our analysis shows that this method can extend the effective storage lifetime beyond BBPSSW,with its performance advantage primarily determined by classical communication delay. We derive upper bounds on classical communication latency required for the approach to maintain superiority. This work introduces a framework for treating quantum memories as reusable resources and links distillation strategy to practical implementation constraints, offering quantitative guidance for designing resilient quantum networks.

Related papers

• 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)
• Reinforcement Learning for Quantum Network Control with Application-Driven Objectives [53.03367590211247]
  Dynamic programming and reinforcement learning offer promising tools for optimizing control strategies.<n>We propose a novel RL framework that directly optimize non-linear, differentiable objective functions.<n>Our work comprises the first step towards non-linear objective function optimization in quantum networks with RL, opening a path towards more advanced use cases.
  arXiv  Detail & Related papers  (2025-09-12T18:41:10Z)
• Feedback-driven recurrent quantum neural network universality [6.206127662604578]
  We present a recurrent quantum neural network architecture that extends a class of existing feedforward models to a dynamic, feedback-driven reservoir setting.<n>We provide theoretical guarantees for variational recurrent quantum neural networks, including approximation bounds and universality results.
  arXiv  Detail & Related papers  (2025-06-19T14:07:38Z)
• Merging-Based Quantum Repeater [0.0]
  We introduce an alternative approach for the design of quantum repeaters based on generating entangled states of growing size.<n>The scheme utilizes quantum merging operations, also known as fusion type-I operations, that allow the reintegration and reuse of entanglement.
  arXiv  Detail & Related papers  (2025-02-06T19:00:34Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Generalized Quantum Repeater Graph States [1.7635061227370266]
  We present a new approach to ensure the loss tolerance of distributing a single ebit.<n>We demonstrate that our new scheme significantly outperforms the previous work with much flexibility.<n>These findings offer new insights into the scalability and reliability of loss-tolerant quantum networks.
  arXiv  Detail & Related papers  (2024-07-01T16:21:37Z)
• Analysis of Asynchronous Protocols for Entanglement Distribution in Quantum Networks [9.971549076128268]
  We explore two minimal asynchronous protocols for entanglement in quantum networks. A parallel scheme generating entanglement independently at the link level, and a sequential scheme extending entanglement iteratively from one party to the other. Our findings suggest the sequential scheme's superiority due to comparable performance with the parallel scheme, coupled with simpler implementation.
  arXiv  Detail & Related papers  (2024-05-03T18:04:11Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Rate-Limited Quantum-to-Classical Optimal Transport in Finite and Continuous-Variable Quantum Systems [11.152271223282463]
  We consider the rate-limited quantum-to-classical optimal transport in terms of output-constrained rate-distortion coding. We develop a coding framework for continuous-variable quantum systems by employing a clipping projection and a dequantization block. For the Gaussian quantum systems, we derive an analytical solution for rate-limited Wasserstein distance of order 2.
  arXiv  Detail & Related papers  (2023-05-17T07:16:20Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Deep reinforcement learning for key distribution based on quantum repeaters [0.0]
  This work examines secret key rates of key distribution based on quantum repeaters. Deep reinforcement learning is used to search for optimal solutions for the memory storage time limits. An implementation of this approach is presented, achieving proof of concept of its validity.
  arXiv  Detail & Related papers  (2022-07-20T14:14:16Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)

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.