Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information and Computation

Entanglement and swap of quantum states in two qubits

IkutoTakaya, IshizakaSatoshi

Published Sep 1, 2015• 0 citations
Publisher

Abstract

Suppose that two distant parties Alice and Bob share an entangled state ρAB, and they want to exchange the subsystems of ρAB by local operations and classical communication (LOCC). In general, this...
DOI
10.5555/2871350.2871353

Related papers

Entanglement and swap of quantum states in two qubits

Takaya Ikuto, Satoshi Ishizaka

Suppose that two distant parties Alice and Bob share an entangled state $\rho_{AB}$, and they want to exchange the subsystems of $\rho_{AB}$ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of $\rho_{AB} \to V\rho_{AB} V$ with $V$ being a swap operator) is impossible deterministically, but becomes possible probabilistically. In this paper, we study how the optimal probability is related to the amount of entanglement in the framework of positive partial transposed (PPT) operations, and numerically show a remarkable class of states whose probability is the smallest among every state in two quantum bits.

arXiv:1406.1601•Quantum Information and Computation•Sep 1, 2015•1 citation

Entanglement Teleportation Through Cat-like States

Sibasish Ghosh A, Guruprasad Kar, Roy, Anirban +2 more

We first consider teleportation of entangled states shared between Claire and Alice to Bob1 and Bob2 when Alice and the two Bobs share a single copy of a GHZ-class state and where {\it all} the four parties are at distant locations. We then generalize this situation to the case of teleportation of entangled states shared between Claire1, Claire2, ....., Claire(N-1) and Alice to Bob1, Bob2, ....., BobN when Alice and the N Bobs share a single copy of a Cat-like state and where again {\it all} the 2N parties are at distant locations.

arXiv:quant-ph/0012110•Dec 20, 2000•0 citations

Quantum communication with entanglement

Vlatko Vedral

Abstract This chapter discusses some of the ways in which quantum entanglement can be used for quantum communication. Suppose Alice and Bob share an entangled state: they can use it for dense coding, in which Alice sends Bob just one qubit of an entangled pair, which delivers two bits of classical information. Alice and Bob can also use an entangled state for teleportation, in which a qubit in a unknown quantum state is teleported from Alice to Bob when Alice sends Bob two classical bits. Entanglement swapping is an example of a tripartite communication protocol. If Alice and Bob share entanglement, and Bob and Charlie share entanglement, entanglement swapping can be used to entangle Alice and Charlie. Even if Alice and Bob are entangled, Alice cannot communicate with Bob without sending him classical bits or qubits, which prevents Alice and Bob from breaking the laws of relativity. This chapter also discusses Pauli matrices and the extension of Hilbert spaces.

•Sep 28, 2006•0 citations

A Scheme of Controlled Quantum State Swapping

查新未, 邹志纯, 祁建霞 +1 more

A scheme for controlled quantum state swapping is presented using maximally entangled five-qubit state,i.e.,Alice wants to transmit an entangled state of particle a to Bob and at the same time Bob wants to transmit an entangled state of particle b to Alice via the control of the supervisor Charlie.The operations used in this swapping process including C-not operation and a series of single-qubit measurements performed by Alice,Bob,and Charlie.

理论物理通讯：英文版•Jan 1, 2012•0 citations

A Scheme of Controlled Quantum State Swapping

Xin-Wei Zha, Zhi-Chun Zou, Jianxia Qi +1 more

A scheme for controlled quantum state swapping is presented using maximally entangled five-qubit state, i.e., Alice wants to transmit an entangled state of particle a to Bob and at the same time Bob wants to transmit an entangled state of particle b to Alice via the control of the supervisor Charlie. The operations used in this swapping process including C-not operation and a series of single-qubit measurements performed by Alice, Bob, and Charlie.

Communications in Theoretical Physics•Sep 1, 2012•1 citation

Quantum dense coding using three qubits

Jose Luis Cereceda

We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states. Thus the sending of Alice's two qubits to Bob, entails 3 bits of classical information which can be recovered by Bob by means of a measurement distinguishing the eight (orthonormal) GHZ states. This contrasts with the 2-qubit case, in which Alice can prepare any of the four Bell states by acting locally only on one of the qubits.

arXiv:quant-ph/0105096•May 21, 2001•14 citations
Suppose that two distant parties Alice and Bob share an entangled state ρAB\rho_{AB}ρAB​, and they want to exchange the subsystems of ρAB\rho_{AB}ρAB​ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of ρAB→VρABV\rho_{AB} \to V\rho_{AB} VρAB​→VρAB​V with VVV being a swap operator) is impossible deterministically, but becomes possible probabilistically. In this paper, we study how the optimal probability is related to the amount of entanglement in the framework of positive partial transposed (PPT) operations, and numerically show a remarkable class of states whose probability is the smallest among every state in two quantum bits.
We first consider teleportation of entangled states shared between Claire and Alice to Bob1 and Bob2 when Alice and the two Bobs share a single copy of a GHZ-class state and where {\it all} the four parties are at distant locations. We then generalize this situation to the case of teleportation of entangled states shared between Claire1, Claire2, ....., Claire(N-1) and Alice to Bob1, Bob2, ....., BobN when Alice and the N Bobs share a single copy of a Cat-like state and where again {\it all} the 2N parties are at distant locations.
Abstract This chapter discusses some of the ways in which quantum entanglement can be used for quantum communication. Suppose Alice and Bob share an entangled state: they can use it for dense coding, in which Alice sends Bob just one qubit of an entangled pair, which delivers two bits of classical information. Alice and Bob can also use an entangled state for teleportation, in which a qubit in a unknown quantum state is teleported from Alice to Bob when Alice sends Bob two classical bits. Entanglement swapping is an example of a tripartite communication protocol. If Alice and Bob share entanglement, and Bob and Charlie share entanglement, entanglement swapping can be used to entangle Alice and Charlie. Even if Alice and Bob are entangled, Alice cannot communicate with Bob without sending him classical bits or qubits, which prevents Alice and Bob from breaking the laws of relativity. This chapter also discusses Pauli matrices and the extension of Hilbert spaces.
We consider a situation in which two parties, Alice and Bob, share a 3-qubit system coupled in an initial maximally entangled, GHZ state. By manipulating locally two of the qubits, Alice can prepare any one of the eight 3-qubit GHZ states. Thus the sending of Alice's two qubits to Bob, entails 3 bits of classical information which can be recovered by Bob by means of a measurement distinguishing the eight (orthonormal) GHZ states. This contrasts with the 2-qubit case, in which Alice can prepare any of the four Bell states by acting locally only on one of the qubits.