Quantum Teleportation with One Classical Bit

• URL: http://arxiv.org/abs/2110.11254v2
• Date: Tue, 15 Feb 2022 05:48:49 GMT
• Title: Quantum Teleportation with One Classical Bit
• Authors: Abhishek Parakh
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) 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. Here, we ask whether we can do better than two bits of classical information if the sender has access to multiple copies of the qubit to be teleported. We place no restrictions on the qubit states. Consequently, 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. As a result, the proposed teleportation protocol requires the transmission of only one classical bit with a probability greater than one-half. This has implications for efficient quantum communications and security of quantum cryptographic protocols based on quantum entanglement.

Related papers

• Single Qubit Multi-Party Transmission Using Universal Symmetric Quantum Cloning [1.0878040851638]
  We consider a hypothetical quantum network where Alice wishes to transmit one qubit of information to $M$ parties. We show that Alice can send significantly fewer qubits compared to direct transmission of the message qubits to each of the $M$ remote receivers.
  arXiv  Detail & Related papers  (2023-10-07T21:19:54Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• On the Duality of Teleportation and Dense Coding [9.31543407418766]
  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.
  arXiv  Detail & Related papers  (2023-02-28T17:47:54Z)
• Two-Server Oblivious Transfer for Quantum Messages [71.78056556634196]
  We propose two-server oblivious transfer protocols for quantum messages. Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.
  arXiv  Detail & Related papers  (2022-11-07T05:12:24Z)
• 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)
• Oblivious Quantum Computation and Delegated Multiparty Quantum Computation [61.12008553173672]
  We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required. Exploiting quantum teleportation, we propose a two-server protocol for this task. Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
  arXiv  Detail & Related papers  (2022-11-02T09:01:33Z)
• The Role of Localizable Concurrence in Quantum Teleportation Protocols [0.0]
  For mixed multi-partite states the lack of computable entanglement measures has made the identification of the quantum resource responsible for this advantage more challenging. We show that any teleportation protocol using an arbitrary multi-partite state, that includes a Bell measurement, requires a non-vanishing localizable concurrence between two of its parties in order to perform better than the classical protocol.
  arXiv  Detail & Related papers  (2021-06-12T01:00:52Z)
• Catalytic quantum teleportation and beyond [0.0]
  We develop a new teleportation protocol based upon the idea of using ancillary entanglement catalytically. We show that catalytic entanglement allows for a noiseless quantum channel to be simulated with a quality that could never be achieved.
  arXiv  Detail & Related papers  (2021-02-23T18:25:17Z)
• 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)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• 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)

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.