To share and not share a singlet: quantum switch and nonclassicality in teleportation

• URL: http://arxiv.org/abs/2211.02921v1
• Date: Sat, 5 Nov 2022 14:49:46 GMT
• Title: To share and not share a singlet: quantum switch and nonclassicality in teleportation
• Authors: Kornikar Sen, Adithi Ajith, Saronath Halder, Ujjwal Sen
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The superposition principle provides us the opportunity to unfold many surprising facts. One such fact leads to the generation of entanglement which may allow one to teleport an unknown quantum state from one location to another. While all pure entangled states can provide nonclassical fidelity for quantum teleportation, perfect teleportation comes at the cost of having a maximally entangled state shared between the sender and the receiver. In this work, 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. We consider two distinct protocols: in the first case, the sender and the receiver do nothing when there is no shared entanglement and in the second case, they use classical communication in absence of entanglement. 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. We compare the two paths with the maximum fidelity achievable through random guess or utilizing classical resources only. In particular, we provide conditions to achieve nonclassical fidelity in teleportation by applying quantum switch. The difference between the two paths can be expressed in terms of coherence present in the switch's state.

Related papers

• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• 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)
• The SWAP Imposter: Bidirectional Quantum Teleportation and its Performance [6.345523830122166]
  Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. We develop two different ways of quantifying the error of nonideal bidirectional teleportation. We obtain semidefinite programming lower bounds on the error of nonideal bidirectional teleportation.
  arXiv  Detail & Related papers  (2022-10-19T20:43:57Z)
• 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 communication using a quantum switch of quantum switches [13.939388417767136]
  We show that two quantum switches placed in a quantum superposition of their alternative orders can transmit a qubit, without any error, with a probability higher than that achievable with the quantum switches individually. We also show that there are situations where there is no communication advantage over the individual quantum switches.
  arXiv  Detail & Related papers  (2021-11-16T07:31:58Z)
• 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)
• 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)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)
• 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.