Entanglement-breaking channels are a quantum memory resource

• URL: http://arxiv.org/abs/2402.16789v1
• Date: Mon, 26 Feb 2024 18:03:15 GMT
• Title: Entanglement-breaking channels are a quantum memory resource
• Authors: Lucas B. Vieira, Huan-Yu Ku, Costantino Budroni
• Abstract summary: Entanglement-breaking channels are an important class of quantum operations noted for their ability to destroy spatial quantum correlations. We show that, in a single-system multi-time scenario, entanglement-breaking channels are still a quantum memory resource.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Entanglement-breaking channels (equivalently, measure-and-prepare channels) are an important class of quantum operations noted for their ability to destroy multipartite spatial quantum correlations. Inspired by this property, they have also been employed in defining notions of "classical memory", under the assumption that such channels effectively act as a classical resource. We show that, in a single-system multi-time scenario, entanglement-breaking channels are still a quantum memory resource: a qudit going through an entanglement-breaking channel cannot be simulated by a classical system of same dimension. We provide explicit examples of memory-based output generation tasks where entanglement-breaking channels outperform classical memories of the same size. Our results imply that entanglement-breaking channels cannot be generally employed to characterize classical memory effects in temporal scenarios without additional assumptions.

Related papers

• Super-activating quantum memory by entanglement-breaking channels [0.0]
  Entanglement is an essential resource for various quantum-information tasks. In practice, entanglement can be exceedingly fragile during a system's evolution. We show that putting together two entanglement-breaking channels in a broadcasting scenario can activate their ability to maintain entanglement.
  arXiv  Detail & Related papers  (2024-10-17T12:45:25Z)
• Qubit magic-breaking channels [41.94295877935867]
  We develop a notion of quantum channels that can make states useless for universal quantum computation by destroying their magic. We establish the properties of these channels in arbitrary dimensions and present an algorithm for determining the same.
  arXiv  Detail & Related papers  (2024-09-06T17:37:41Z)
• Security for adversarial wiretap channels [4.383205675898942]
  We analyze information-theoretically secure coding schemes which use the inverse of an extractor and an error-correcting code. We show that this also holds for certain channel types with memory.
  arXiv  Detail & Related papers  (2024-04-02T09:22:40Z)
• Classical Capacity of Arbitrarily Distributed Noisy Quantum Channels [11.30845610345922]
  We study the impact of a mixture of classical and quantum noise on an arbitrary quantum channel carrying classical information. We formulate the achievable channel capacity over an arbitrary distributed quantum channel in presence of the mixed noise.
  arXiv  Detail & Related papers  (2023-06-28T11:14:12Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding [67.6686661244228]
  We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code. We establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets.
  arXiv  Detail & Related papers  (2020-11-01T03:26:08Z)
• Classical capacities of memoryless but not identical quantum channels [0.0]
  We study quantum channels that vary on time in a deterministic way, that is, they change in an independent but not identical way from one to another use.
  arXiv  Detail & Related papers  (2020-05-25T10:00:28Z)
• Channel Equilibrium Networks for Learning Deep Representation [63.76618960820138]
  This work shows that the combination of normalization and rectified linear function leads to inhibited channels. Unlike prior arts that simply removed the inhibited channels, we propose to "wake them up" during training by designing a novel neural building block. Channel Equilibrium (CE) block enables channels at the same layer to contribute equally to the learned representation.
  arXiv  Detail & Related papers  (2020-02-29T09:02:31Z)
• Non-additivity in classical-quantum wiretap channels [12.354076490479514]
  We study hybrid classical-quantum wiretap channels in order to witness non-additivity phenomena in quantum Shannon theory. For wiretap channels with quantum inputs but classical outputs, we prove that the characterization of the capacity in terms of the private information stays single-letter.
  arXiv  Detail & Related papers  (2020-02-16T13:38:40Z)

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.