On the Duality of Teleportation and Dense Coding

• URL: http://arxiv.org/abs/2302.14798v2
• Date: Tue, 4 Jun 2024 13:48:12 GMT
• Title: On the Duality of Teleportation and Dense Coding
• Authors: Eric Chitambar, Felix Leditzky,
• Abstract summary: Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. We show how this problem can be rephrased as a state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states.
• Score: 9.31543407418766
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.

Related papers

• Teleportation two-qubit state by using two different protocols [0.0]
  Two versions of teleportation protocol are considered, based on either using a single or two copies of entangled atom-field state, respectively. It is shown that, by using the first version, the fidelity of the teleported state as well as the amount of quantum Fisher information, that contains in the teleported state, are much better than using the second version.
  arXiv  Detail & Related papers  (2024-03-31T01:17:00Z)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• To share and not share a singlet: quantum switch and nonclassicality in teleportation [0.0]
  We consider a situation where the sender and the receiver are in a superposed situation of sharing a maximally entangled state and not sharing anything, controlled by a quantum switch. In each of the protocols, we follow two different paths. In the first path, after the protocol is completed, we simply throw away the switch. In the second path, after accomplishing the protocol, we operate a Hadamard gate on the switch, measure the switch's state, and consider the outcome corresponding to a particular state of the switch.
  arXiv  Detail & Related papers  (2022-11-05T14:49:46Z)
• High-fidelity quantum teleportation through noisy channels via weak measurement and environment-assisted measurement [0.8594140167290097]
  A perfect teleportation protocol requires pure maximally shared entangled states. While in reality the shared entanglement is severely degraded due to the inevitable interaction with the noisy environment. We propose a teleportation protocol to teleport an unknown qubit through the amplitude damping channels with a fidelity up to one with a single copy of the entangled state.
  arXiv  Detail & Related papers  (2022-06-29T08:39:46Z)
• Quantum Teleportation with One Classical Bit [0.0]
  Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical information and assumes that the sender has access to only one copy of the arbitrary qubit to the sent. We propose a modified quantum teleportation protocol that allows Alice to reset the state of the entangled pair to its initial state using only local operations.
  arXiv  Detail & Related papers  (2021-10-21T16:28:06Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Optimal teleportation fidelity and its deviation in noisy scenarios [0.0]
  We study the combined effects of noisy resource state and noisy classical communication on teleportation fidelity and its deviation. We find conditions for non-classical fidelity and dispersion-free teleportation within the present protocol.
  arXiv  Detail & Related papers  (2021-02-01T17:55:05Z)
• 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)
• Fault-tolerant Coding for Quantum Communication [71.206200318454]
  encode and decode circuits to reliably send messages over many uses of a noisy channel. For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable. Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
  arXiv  Detail & Related papers  (2020-09-15T15:10:50Z)
• Teleporting quantum information encoded in fermionic modes [62.997667081978825]
  We consider teleportation of quantum information encoded in modes of a fermionic field. In particular, one is forced to distinguish between single-mode entanglement swapping, and qubit teleportation with or without authentication.
  arXiv  Detail & Related papers  (2020-02-19T14:15:16Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

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.