Information theoretic resource-breaking channels

• URL: http://arxiv.org/abs/2309.03108v1
• Date: Wed, 6 Sep 2023 15:44:50 GMT
• Title: Information theoretic resource-breaking channels
• Authors: Abhishek Muhuri, Ayan Patra, Rivu Gupta, Aditi Sen De
• Abstract summary: We illustrate our proposed notion, referred to as process resource-breaking channels, by examining two important communication protocols, quantum dense coding, and teleportation. We prove that the sets of dense coding (DBT) and teleportation resource-breaking channels (TBT) are convex and compact. We construct witness operators capable of identifying non-TBT(non-DBT) maps.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a framework of channels that break the resource associated with a given quantum information processing task, in which entanglement is not adequate. In particular, we illustrate our proposed notion, referred to as process resource-breaking channels, by examining two important communication protocols, quantum dense coding, and teleportation. We prove that the sets of dense coding (DBT) and teleportation resource-breaking channels (TBT) are convex and compact, and identify a specific class of classical-quantum channels as the extreme points of those sets. We provide sufficient conditions for a channel to be in TBT or DBT, when they are group-covariant along with having the ability to transform a maximally entangled state into a useless one. We also establish sufficient requirements on unital qubit channels to break the dense codeability of any resource shared by one or more senders and a single receiver. Regarding teleportation, we prove that the set TBT in the qubit regime is equivalent to that of qubit entanglement-breaking channels provided pre-processing is allowed. Furthermore, we construct witness operators capable of identifying non-TBT(non-DBT) maps.

Related papers

• Capacities of Entanglement Distribution From a Central Source [8.576752529284692]
  Distribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. We investigate a scenario where a central source prepares an N-partite entangled state and transmits each entangled subsystem to one of N receivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output.
  arXiv  Detail & Related papers  (2024-11-07T18:50:51Z)
• Extendibility limits quantum-secured communication and key distillation [4.079147243688764]
  We study the task of secret-key distillation from bipartite states and point-to-point quantum channels. We extend our formalism to private communication over a quantum channel assisted by forward classical communication.
  arXiv  Detail & Related papers  (2024-10-28T18:00:11Z)
• Unextendible entanglement of quantum channels [4.079147243688764]
  We study the ability of quantum channels to perform quantum communication tasks. A quantum channel can distill a highly entangled state between two parties. We generalize the formalism of $k$-extendibility to bipartite superchannels.
  arXiv  Detail & Related papers  (2024-07-22T18:00:17Z)
• Port-based entanglement teleportation via noisy resource states [0.0]
  Port-based teleportation (PBT) represents a variation of the standard quantum teleportation. In this study, we focus on PBT protocol when the resource state is disrupted by local Pauli noises.
  arXiv  Detail & Related papers  (2023-09-04T12:02:48Z)
• 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)
• Pauli component erasing quantum channels [58.720142291102135]
  We propose a family of quantum maps that preserve or completely erase the components of a multi-qubit system. For the corresponding channels, it is shown that the preserved components can be interpreted as a finite vector subspace. We show that the obtained family of channels forms a semigroup and derive its generators.
  arXiv  Detail & Related papers  (2022-05-12T00:11:43Z)
• Bi-PPT channels are entanglement breaking [77.34726150561087]
  We show that bi-PPT channels are always entanglement breaking. We also show that degradable quantum channels staying completely positive under composition with a transposition are entanglement breaking.
  arXiv  Detail & Related papers  (2022-04-04T17:53:38Z)
• Statistical intrusion detection and eavesdropping in quantum channels with coupling: Multiple-preparation and single-preparation methods [2.2469167925905777]
  Non-quantum communications include configurations with multiple-input multiple-output (MIMO) channels. Some associated signal processing tasks consider these channels in a symmetric way, i.e. by assigning the same role to all inputs. We here address asymmetric (blind and non-blind) ones, with emphasis on intrusion detection and additional comments about eavesdropping.
  arXiv  Detail & Related papers  (2021-06-17T07:04:54Z)
• 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)
• Quantum Channel State Masking [78.7611537027573]
  Communication over a quantum channel that depends on a quantum state is considered when the encoder has channel side information (CSI) and is required to mask information on the quantum channel state from the decoder. A full characterization is established for the entanglement-assisted masking equivocation region, and a regularized formula is given for the quantum capacity-leakage function without assistance.
  arXiv  Detail & Related papers  (2020-06-10T16:18:03Z)
• Decentralized Learning for Channel Allocation in IoT Networks over Unlicensed Bandwidth as a Contextual Multi-player Multi-armed Bandit Game [134.88020946767404]
  We study a decentralized channel allocation problem in an ad-hoc Internet of Things network underlaying on the spectrum licensed to a primary cellular network. Our study maps this problem into a contextual multi-player, multi-armed bandit game, and proposes a purely decentralized, three-stage policy learning algorithm through trial-and-error.
  arXiv  Detail & Related papers  (2020-03-30T10:05:35Z)

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.