Optimal Distillation of Non-Markovianity: Bounds, Multi-Copy Gain, and the Weak-to-Essential Transition

• URL: http://arxiv.org/abs/2603.13712v1
• Date: Sat, 14 Mar 2026 02:31:34 GMT
• Title: Optimal Distillation of Non-Markovianity: Bounds, Multi-Copy Gain, and the Weak-to-Essential Transition
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum channels generally reduce the distinguishability of quantum states, limiting information transmission and processing. Previous work introduced a protocol capable of increasing the distinguishability of states after the action of a specific quantum channel. Here we show how to systematically determine the maximal distinguishability gain achievable by this method. We develop an algorithm that identifies the optimal implementation of the protocol and applies to arbitrary quantum channels in a straightforward manner. Using this approach, we demonstrate that a weakly non-Markovian channel can effectively be converted into an essentially non-Markovian one through a distillation-like process. We further analyze the quantitative features of the optimized protocol, characterizing the conditions under which the enhancement is most pronounced. Our results provide a general framework to assess and optimize distinguishability recovery in open quantum systems.

Related papers

• Heuristic Lookahead Distillation Protocol Search [0.0]
  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.
  arXiv  Detail & Related papers  (2026-08-13T18:00:02Z)
• 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)
• Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
  We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
  arXiv  Detail & Related papers  (2025-11-19T15:58:10Z)
• Quantum MIMO Diversity over Discrete-Variable Crosstalk Channels [36.04430775147211]
  We propose a diversity strategy for quantum discrete variable (DV) multiple-input-multiple-output (MIMO) channels.<n>We show that the cloning-purification strategy offers an advantage, especially in cases where full channel state information (CSI) can be exploited.
  arXiv  Detail & Related papers  (2025-08-10T13:38:47Z)
• Protocols and Trade-Offs of Quantum State Purification [4.732131350249]
  We introduce a general state purification framework designed to achieve the highest fidelity with a specified probability. For i.i.d. quantum states under depolarizing noise, our framework can replicate the purification protocol proposed by Barenco and al. We prove the protocols' optimality for two copies of noisy states with any dimension and confirm its optimality for higher numbers of copies and dimensions.
  arXiv  Detail & Related papers  (2024-04-01T14:34:45Z)
• Quantum Speedups in Regret Analysis of Infinite Horizon Average-Reward Markov Decision Processes [32.07657827173262]
  We introduce an innovative quantum framework for the agent's engagement with an unknown MDP.<n>We show that the quantum advantage in mean estimation leads to exponential advancements in regret guarantees for infinite horizon Reinforcement Learning.
  arXiv  Detail & Related papers  (2023-10-18T03:17:51Z)
• 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)
• Quantum channel decomposition with pre- and post-selection [0.7597059965024503]
  This paper proposes a channel decomposition method for target unitaries that have their input and output conditioned on specific quantum states. We explicitly determine the requisite number of decomposing channels, which could be significantly smaller than the selection-free scenario. We demonstrate an application of this approach to the quantum linear solver algorithm, highlighting the efficacy of the proposed method.
  arXiv  Detail & Related papers  (2023-05-19T12:48:21Z)
• 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)
• Quantum advantage for noisy channel discrimination [0.0]
  We show that a quantum advantage can be maintained when distinguishing between two noisy single qubit rotation channels. Numerical and analytical calculations reveal a transition between optimal performance by fully coherent and fully incoherent protocols.
  arXiv  Detail & Related papers  (2021-05-18T17:47:10Z)

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.