Bi-directional quantum teleportation of GHZ-like states

• URL: http://arxiv.org/abs/2302.11300v1
• Date: Wed, 22 Feb 2023 11:36:17 GMT
• Title: Bi-directional quantum teleportation of GHZ-like states
• Authors: Leila S. Tabatabaei and Babak Vakili
• Abstract summary: The protocol is based on the method that at first, each user, through a series of $mboxCNOT$ gates, converts the $n$-qubit state into a single qubit and some $0$ qubits. By re-applying the $mboxCNOT$ gates on the transmitted qubits and auxiliary $0$ states, each user reconstructs the initial GHZ-like state.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we propose a method through which $n$-qubit states can simultaneously be bi-directionally transmitted between two users. We assume that Alice and Bob, the legitimate users, each have a $n$-qubit GHZ-like state and want to teleport it to the other party. Also, a four-qubit cluster state plays the role of the quantum channel of this bi-directional quantum teleportation. The protocol is based on the method that at first, each user, through a series of $\mbox{CNOT}$ gates, converts the $n$-qubit state into a single qubit and some $0$ qubits. Then, by means of the Bell state measurement and proper operation, the single qubit state is transferred over the channel between the two sides. By re-applying the $\mbox{CNOT}$ gates on the transmitted qubits and auxiliary $0$ states, each user reconstructs the initial GHZ-like state. Finally, we investige the effects of some kind of noises on the density marix of the channel due to its interaction with the environment and present a method to protect the channel against the bit-flip error.

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)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Two qubits in one transmon -- QEC without ancilla hardware [68.8204255655161]
  We show that it is theoretically possible to use higher energy levels for storing and controlling two qubits within a superconducting transmon. The additional qubits could be used in algorithms which need many short-living qubits in error correction or by embedding effecitve higher connectivity in qubit networks.
  arXiv  Detail & Related papers  (2023-02-28T16:18:00Z)
• Conference key agreement in a quantum network [67.410870290301]
  Quantum conference key agreement (QCKA) allows multiple users to establish a secure key from a shared multi-partite entangled state. In a quantum network, this protocol can be efficiently implemented using a single copy of a N-qubit Greenberger-Horne-Zeilinger (GHZ) state to distil a secure N-user conference key bit.
  arXiv  Detail & Related papers  (2022-07-04T18:00:07Z)
• Symmetric Bidirectional Quantum Teleportation using a Six-Qubit Cluster State as a Quantum Channel [0.0]
  Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two quantum nodes. We propose a new scheme for symmetric bidirectional quantum teleportation using a six-qubit cluster state as the quantum channel. The efficiency of the proposed protocol is remarkably increased to $50%$ which is highest till now.
  arXiv  Detail & Related papers  (2022-04-06T10:56:39Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• $N$-body interactions between trapped ion qubits via spin-dependent squeezing [0.0]
  We show that qubit state-dependent squeezing operations and displacement forces on the collective atomic motion can generate full $N$-body interactions. We show how this $N$-body gate operation allows the single-step implementation of a family of $N$-bit gate operations.
  arXiv  Detail & Related papers  (2022-02-09T02:27:46Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Quantum communication with $SU(2)$ invariant separable $2\times N$ level systems [0.0]
  We propose protocols for remote transfers of information in a known and an unknown qubit to qudits. We also propose a protocol for swapping of quantum discord from $frac12otimes S$- systems to $Sotimes S$- systems.
  arXiv  Detail & Related papers  (2021-04-09T16:32:41Z)
• Communication Cost of Quantum Processes [49.281159740373326]
  A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired computation. We analyze the total amount of (classical and quantum) communication needed by a server in order to accurately execute a quantum process chosen by a client.
  arXiv  Detail & Related papers  (2020-02-17T08:51:42Z)
• Wireless Multihop Quantum Teleportation Utilizing a 4-Qubit Cluster State [0.0]
  This paper proposes a quantum routing protocol using multihop teleportation for wireless mesh backbone networks. We analyze the success probability of quantum state transfer and find that the optimal success probability is achieved when $tau_2|1 = frac1sqrt2$.
  arXiv  Detail & Related papers  (2017-07-31T22:13:03Z)

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.