Heuristic Lookahead Distillation Protocol Search

• URL: http://arxiv.org/abs/2608.13644v1
• Date: Thu, 13 Aug 2026 18:00:02 GMT
• Title: Heuristic Lookahead Distillation Protocol Search
• Abstract summary: Bipartite qubit entanglement distillation is a core operation for quantum repeaters.<n>We introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bipartite qubit entanglement distillation is the process of converting noisy ebits into pure ebits using only local operations and classical communication. This is a core operation for quantum repeaters, enabling such crucial tasks as long-distance quantum communication and distributed quantum computing. In this work, we introduce a method for searching for entanglement distillation protocols and, using this technique, distil qubit Werner states at a higher rate than could be achieved using previously discovered protocols. In particular, we demonstrate the advantage of our new distillation strategy by improving the best-known lower bound for the two-way-assisted quantum capacity of the qubit depolarising channel across a wide range of channel parameters, making progress in one of the long-standing problems of quantum information theory.

Related papers

• Optimal Distillation of Non-Markovianity: Bounds, Multi-Copy Gain, and the Weak-to-Essential Transition [0.0]
  Quantum channels reduce the distinguishability of quantum states, limiting information transmission and processing.<n>Previous work introduced a protocol capable of increasing the distinguishability of states after the action of a specific quantum channel.<n>We show how to systematically determine the maximal distinguishability gain achievable by this method.
  arXiv  Detail & Related papers  (2026-03-14T02:31:34Z)
• Quantum-Channel Matrix Optimization for Holevo Bound Enhancement [87.57725685513088]
  We propose a unified projected gradient ascent algorithm to optimize the quantum channel given a fixed input ensemble.<n> Simulation results demonstrate that the proposed quantum channel optimization yields higher Holevo bounds than input ensemble optimization.
  arXiv  Detail & Related papers  (2026-02-19T04:15:03Z)
• Carrier-Assisted Entanglement Purification [7.610551500789847]
  Entanglement distillation enables the purification of noisy entangled states shared among distant nodes by local operations and classical communication.<n>We present an entanglement purification protocol via quantum communication, namely a carrier-assisted entanglement purification protocol.<n>We show that the protocol, when single-qubit transmission is noiseless, can purify a noisy entangled state shared by parties.
  arXiv  Detail & Related papers  (2025-09-09T08:51:17Z)
• One-shot distillation with constant overhead using catalysts [3.771547570340179]
  Minimizing the overhead distillation is crucial for the realization of quantum computation and other technologies.<n>In particular, for magic state distillation our method paves a path for tackling the diverging batch size problem.<n>We extend techniques to dynamical quantum resources and show that mutual information determines one-shot catalytic channel transformation.
  arXiv  Detail & Related papers  (2024-10-18T15:41:52Z)
• Fast quantum interconnects via constant-rate entanglement distillation [0.0]
  We develop constant-rate entanglement distillation methods for quantum interconnects. We prove the scheme has constant-rate in expectation and numerically optimize to achieve low practical overhead. We find our optimized schemes outperform existing computationally efficient quantum interconnect schemes by an order of magnitude in relevant regimes.
  arXiv  Detail & Related papers  (2024-08-28T16:54:54Z)
• Retrieving non-linear features from noisy quantum states [11.289924445850328]
  In this paper, we analyze the feasibility and efficiency of extracting high-order moments from noisy states. We first show that there exists a quantum protocol capable of accomplishing this task if and only if the underlying noise channel is invertible. Our work contributes to a deeper understanding of how quantum noise could affect high-order information extraction and provides guidance on how to tackle it.
  arXiv  Detail & Related papers  (2023-09-20T15:28: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)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Learning Quantum Entanglement Distillation with Noisy Classical Communications [39.000858564696856]
  entanglement distillation aims to enhance the fidelity of entangled qubits through local operations and classical communication. Existing distillation protocols assume the availability of ideal, noiseless, communication channels. In this paper, we study the case in which communication takes place over noisy binary symmetric channels.
  arXiv  Detail & Related papers  (2022-05-17T18:10:16Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)

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.