A scheme to generate shared tripartite entangled states, with two-trapped atoms in a cavity held by Alice (qubits A1 and A2) entangled to a single trapped atom in a remote lab owned by Bob (B), is proposed. The entanglement is generated through interaction of trapped atoms with two mode squeezed light shared by the two cavities. The proposed scheme is an extension of the proposal of ref. [W. Son, M. S. Kim, J. Lee, and D. Ahn, J. Mod. Opt. 49, 1739 (2002)], where the possibility of entangling two remote qubits using a bipartite continuous variable state was examined. While the global negativity detects the free entanglement of the three atom mixed state, the bound entanglement is detected by the negativity calculated from pure state decomposition of the state operator. The partial negativities calculated by selective partial transposition of the three atom mixed state detect the pairwise entanglement of qubit pairs A1B, A2B, and A1A2. The entanglement of three atoms is found to be W-like, no GHZ like quantum correlations being generated.
Three different quantum cards which are non-orthogonal quantum bits are sent to two different players, Alice and Bob, randomly. Alice receives one of the three cards, and Bob receives the remaining two cards. We find that Bob could know better than Alice does on guessing Alice's card, no matter what Bob chooses to measure his two cards collectively or separately. We also find that Bob's best strategy for guessing Alice's card is to measure his two cards collectively.
In quantum weak oblivious transfer, Alice sends Bob two bits and Bob can learn one of the bits at his choice. It was found that the security of such a protocol is bounded by $2P_{Alice}^{\ast }+P_{Bob}^{\ast }\geq 2$, where $P_{Alice}^{\ast }$ is the probability with which Alice can guess Bob's choice, and $P_{Bob}^{\ast }$ is the probability with which Bob can guess both of Alice's bits\ given that he learns one of the bits with certainty. Here we propose a protocol and show that as long as Alice is restricted to individual measurements, then both $P_{Alice}^{\ast }$ and $P_{Bob}^{\ast }$ can…
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.
We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and therefore Alice can obtain the correct computation result. Regarding the security, whateve…
Asymmetric steering is an effect whereby an inseparable bipartite system can be found to be described by either quantum mechanics or local hidden variable theories depending on which one of Alice or Bob makes the required measurements. We show that, even with an inseparable bipartite system, situations can arise where Gaussian measurements on one half are not sufficient to answer the fundamental question of which theory gives an adequate description and the whole system must be considered. This phenomenon is possible because of an asymmetry in the definition of the original Einstein-Podolsky-R…
We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in the qubits without increasing the number of qubits? We show that this is indeed possible. We introduce a prepare-and-measure QKR protocol where the communication from Alice to Bob consists entirely of qubits. As usual, Bob responds with an authenticated one-bit accept/reject classical message. Compared to Quantum Key Distribution (QKD), QKR has reduced round complexity. Compared to previous qubit-wise QKR protocols, our scheme has far less classical communication. We provide a security p…
Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission of Charlie (i.e. Charlie is trustworthy and cooperative, which means the 'conditional' in the two schemes), Alice and Bob begin their private communication under the control of Charlie. In the first schem…
We show that it is possible to have arbitrarily long sequences of Alices and Bobs so every (Alice, Bob) pair violates a Bell inequality. We propose an experiment to observe this effect with two Alices and two Bobs.
Quantum steering, a type of quantum correlation with unique asymmetry, has important applications in asymmetric quantum information tasks. We consider a new quantum steering scenario in which one half of a two-qubit Werner state is sequentially measured by multiple Alices and the other half by multiple Bobs. We find that the maximum number of Alices who can share steering with a single Bob increases from 2 to 5 when the number of measurement settings $N$ increases from 2 to 16. Furthermore, we find a counterintuitive phenomenon that for a fixed $N$, at most 2 Alices can share steering with 2 B…
Blind quantum computation is a two-party protocol which involves a server Bob who has rich quantum computational resource and provides quantum computation service and a client Alice who wants to delegate her quantum computation to Bob without revealing her quantum algorithms and her input to (resp., output from) the algorithms. Since Bob may be truant and pretend to execute some computation, Alice wants to verify Bob's computation. Verifiable blind quantum computation enables Alice to check whether Bob is cheating or not. If Bob is cheating and claims his innocence, Alice can refute the denial…
A new paradigm for secure communication, based on quantum illumination, is proposed. Alice uses spontaneous parametric down-conversion to send Bob a set of signal modes over a pure-loss channel while retaining the set of idler modes with which they are maximally entangled. Bob imposes a single information bit on the modes he receives from Alice via binary phase-shift keying. He then adds classical Gaussian noise and sends the noisy modulated modes back to Alice over the same pure-loss channel. Even though the loss and noise destroy any entanglement between the modes that Alice receives from Bo…
The `no communication' theorem prohibits superluminal communication by showing that any measurement by Alice on an entangled system cannot change the reduced density matrix of Bob's state, and hence the expectation value of any measurement operator that Bob uses remains the same. We argue that the proof of the `no communication' theorem is incomplete and superluminal communication is possible through state discrimination in a higher-dimensional Hilbert space using ancilla qubits. We propose two quantum algorithms through state discrimantion for communication between two observers Alice and Bob…
Alice and Bob use Aravind's version of a Bell-Kochen-Specker paradox to fend off awkward questions about what exactly they were doing in Amsterdam last week.
We presen a secure direct communication protocol by using step-split Einstein-Podolsky-Rosen (EPR) pair. In this communication protocol, Alice first sends one qubit of an EPR pair to Bob. Bob sends a receipt signal to Alice through public channel when he receives Alice's first qubit. Alice performs her encoding operations on the second qubit and sends this qubit to Bob. Bob performs a Bell-basis measurement to draw Alice's information. The security of this protocol is based on `High fidelity implies low entropy'. If Eve want to eavesdrop Alice's information, she has to attack both qubits of th…
A novel scheme for secure direct communication between Alice and Bob is proposed, where there is no need for establishing a shared secret key. The communication is based on Einstein-Podolsky-Rosen pairs and teleportation between Alice and Bob. After insuring the security of the quantum channel (EPR pairs), Bob encodes the secret message directly on a sequence of particle states and transmits them to Alice by teleportation. In this scheme teleportation transmits Bob's message without revealing any information to a potential eavesdropper. Alice can read out the encoded messages directly by the m…
We propose an experiment to investigate the possibility of long-distance thermodynamic relationships between two entangled particles. We consider a pair of spin 1/2 particles prepared in an entangled singlet state in which one particle is sent to Alice and the other to her distant mate Bob, who are spatially separated. Our proposed experiment consists of three different setups: First, both particles are coupled to two heat baths with various temperatures. In the second setup, only Alice's particle is coupled to a heat bath and finally, in the last setup, only Bob's particle is coupled to a hea…
Teleportation usually involves entangled particles 1,2 shared by Alice and Bob, Bell-state measurement on particle 1 and system particle by Alice, classical communication to Bob, and unitary transformation by Bob on particle 2. We propose a novel method: interaction-based remote tomography. Alice arranges an entanglement generating von Neumann-Arthurs-Kelly interaction between the system and two apparatus particles, and then teleports the latter to Bob. Bob reconstructs the unknown initial state of the system not received by him by quadrature measurements on the apparatus particles .
In this Letter, the dynamic behavior of Einstein-Podolsky-Rosen (EPR) steering and the redistribution of EPR steering under a relativistic framework are investigated. Specifically, we explore the scenario that particle A hold by Alice is in a flat space-time and another particle B by Bob entangled with A is in a non-inertial framework. The results show that EPR steering from Alice to Bob is dramatically destroyed by Unruh effect caused by the acceleration of Bob. Besides, EPR steering has an asymmetry property, and EPR steering asymmetry increases with the growing intensity of Unruh effect, im…
Based on an EPR pair of qubits and allowing asymptotically secure key distribution, a secure communication protocol is presented. Bob sends either of the EPR pair qubits to Alice. Alice receives the travel qubit. Then she can encode classical information by local unitary operations on this travel qubit. Alice send the qubit back to Bob. Bob can get Alice's information by measurement on the two photons in Bell operator basis. If Eve in line, she has no access to Bob's home qubit. All her operations are restricted to the travel qubit. In order to find out which opeartion Alice performs, Eve's op…
In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four…
In the present work, a traditional quantity, the averaged fidelity, is introduced as the steering parameter. From the definitions of steering from Alice to Bob and the joint measurability, a general scheme is developed to design linear steering criteria. For a given set of measurements on Bob's side, the so-called nonsteering threshold is defined to quantify the ability to detect steering. If the measured averaged fidelity exceeds this threshold, it is shown that the state shared by Alice and Bob is steerable from Alice to Bob, and the measurements performed by Alice are also verified to be in…
Recently, Shi et al. (Phys. Rev. A, 2015) proposed Quantum Oblivious Set Member Decision Protocol (QOSMDP) where two legitimate parties, namely Alice and Bob, play a game. Alice has a secret $k$ and Bob has a set $\{k_1,k_2,\cdots k_n\}$. The game is designed towards testing if the secret $k$ is a member of the set possessed by Bob without revealing the identity of $k$. The output of the game will be either "Yes" (bit $1$) or "No" (bit $0$) and is generated at Bob's place. Bob does not know the identity of $k$ and Alice does not know any element of the set. In a subsequent work (Quant. Inf. Pr…
In the present work, the averaged fidelity is introduced as the steering parameter. According to the definitions of steering from Alice to Bob, a general scheme for designing linear steering criteria is developed for a high-dimensional system. For a given set of measurements on Bob's side, two quantities, the so-called nonsteering thresholds, can be defined. If the measured averaged fidelity exceeds these thresholds, the state shared by Alice and Bob is steerable from Alice to Bob, and the measurements performed by Alice are also verified to be incompatible. Within the general scheme, we also …
We explain the mechanism of the quantum speed-up - quantum algorithms requiring fewer computation steps than their classical equivalent - for a family of algorithms. Bob chooses a function and gives to Alice the black box that computes it. Alice, without knowing Bob's choice, should find a character of the function (e. g. its period) by computing its value for different arguments. There is naturally correlation between Bob's choice and the solution found by Alice. We show that, in quantum algorithms, this correlation becomes quantum. This highlights an overlooked measurement problem: sharing b…
Suppose Alice wants to perform some computation that could be done quickly on a quantum computer, but she cannot do universal quantum computation. Bob can do universal quantum computation and claims he is willing to help, but Alice wants to be sure that Bob cannot learn her input, the result of her calculation, or perhaps even the function she is trying to compute. We describe a simple, efficient protocol by which Bob can help Alice perform the computation, but there is no way for him to learn anything about it. We also discuss techniques for Alice to detect whether Bob is honestly helping her…
In this article, we investigate the geometric discord of quantum states of fermionic system in accelerated frame. It is shown by the method beyond the single-mode approximation, depending on the region considered, that the geometric discord for the entangled quantum states of fermionic system in accelerated frame can vanish or be retained at the infinite acceleration limit: it does not disappear when the quantum state of the particle(Alice)-particle(Bob in region I) case or the particle(Alice)-antiparticle(Bob in region II) is considered and it disappears when the particle(Alice)-antiparticle(…
Einstein-Podolsky-Rosen (EPR) steering is a form of quantum correlation that exhibits a fundamental asymmetry in the properties of quantum systems. Given two observers, Alice and Bob, it is known to exist bipartite entangled states which are one-way steerable in the sense that Alice can steer Bob's state, but Bob cannot steer Alice's state. Here we generalize this phenomenon to three parties and find a cyclic property of tripartite EPR steering. In particular, we identify a three-qubit state whose reduced bipartite states are one-way steerable for arbitrary projective measurements. Moreover, t…
A well-known property of quantum nonlocality is monogamy. However, recent research by Silva \emph{et al.} shows that multiple observers can share the nonlocality by using weak measurements [Phys. Rev. Lett. 114, 250401 (2015)]. There is an open question left in their result: whether the nonlocality of a single particle from an entangled pair can be shared among more than two observers that act sequentially and independently of each other? In this work, we analytical and numerical shows that it is possible to observe a triple violation of CHSH inequality between Alice and three Bobs when the me…
We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local measurement on her particles of the EPR pairs and informs Bob the encoding classical information publicly. According to Alice's classical information and his measurement outcomes on the EPR pairs Bob can infer the secret messages directly. In this scheme, to transmit one bit secret message, the sender Alice only needs to send one bit classical information to the r…
A scheme is proposed by which two parties, Alice and Bob, can securely exchange real numbers. The scheme requires Alice and Bob to share entanglement and both to perform Bell-state measurements. With a qubit system two real numbers can each be sent by Alice and Bob, resulting in four real numbers shared by them. The number of real numbers that can be shared increases if higher-dimensional systems are utilized. The number of significant figures of each shared real number depends upon the number of Bell-state measurements that Alice and Bob perform. The security of the scheme against individual …
We study scenarios which arise when two spatially-separated observers, Alice and Bob, are try to identify a quantum state sampled from several possibilities. In particular, we examine their strategies for maximizing both the probability of guessing their state correctly as well as their information gain about it. It is known that there are scenarios where allowing Alice and Bob to use LOCC offers an improvement over the case where they must make their measurements simultaneously. Similarly, Alice and Bob can sometimes improve their outcomes if they have access to a Bell pair. We show how LOCC …
We introduce a method for efficient, in situ characterization of linear-optical networks (LONs) in randomized boson-sampling (RBS) experiments. We formulate RBS as a distributed task between two parties, Alice and Bob, who share two-mode squeezed-vacuum states. In this protocol, Alice performs local measurements on her modes, either photon counting or heterodyne. Bob implements and applies to his modes the LON requested by Alice; at the output of the LON, Bob performs photon counting, the results of which he sends to Alice via classical channels. In the ideal situation, when Alice does photon …
Recently the authors in [Phys. Rev. Lett. 125, 090401 (2020)] considered the following scenario: Alice and Bob each have half of a pair of entangled qubit state. Bob measures his half and then passes his part to a second Bob who measures again and so on. The goal is to maximize the number of Bobs that can have an expected violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality with the single Alice. By taking the maximally entangled pure two-qubit state as an example, it has been constructively proved that arbitrarily many independent Bobs can share the nonlocality with the single Alice.…
If both Alice and Bob have access to a two-qubit "background state" then, by simulating Everett's many worlds interpretation of measurement, Alice can teleport a qubit to Bob, each using fixed unitaries. The Everett picture unifies unitaries, measurements, and classical communication into just unitaries, provided there are background states shared by all parties. We review some of the literature on this theme and point out an additional fact: If Bob has access to only one of the background qubits, teleportation is still possible by Alice sending Bob one classical bit of information gained from…
We prove a conjecture by DiVincenzo, which in the terminology of Preskill et al. [quant-ph/0102043] states that ``semicausal operations are semilocalizable''. That is, we show that any operation on the combined system of Alice and Bob, which does not allow Bob to send messages to Alice, can be represented as an operation by Alice, transmitting a quantum particle to Bob, and a local operation by Bob. The proof is based on the uniqueness of the Stinespring representation for a completely positive map. We sketch some of the problems in transferring these concepts to the context of relativistic qu…
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.
We suggest a method for teleporting an unknown quantum state. In this method the sender Alice first uses a Controlled-Not operation on the particle in the unknown quantum state and an ancillary particle which she wants to send to the receiver Bob. Then she sends ancillary particle to Bob. When Alice is informed by Bob that the ancillary particle is received, she performs a local measurement on the particle and sends Bob the outcome of the local measurement via a classical channel. Depending on the outcome Bob can restore the unknown quantum state, which Alice destroyed, on the ancillary partic…
Consider two parties: Alice and Bob and suppose that Bob is given a qubit system in a quantum state $ϕ$, unknown to him. Alice knows $ϕ$ and she is supposed to convince Bob that she knows $ϕ$ sending some test message. Is it possible for her to convince Bob providing him "zero knowledge" i. e. no information about $ϕ$ he has? We prove that there is no "zero knowledge" protocol of that kind. In fact it turns out that basing on Alice message, Bob (or third party - Eve - who can intercept the message) can synthetize a copy of the unknown qubit state $ϕ$ with nonzero probability. This "no-go" resu…
In a two-way deterministic quantum key distribution (DQKD) protocol, Bob randomly prepares qubits in one of four states and sends them to Alice. To encode a bit, Alice performs an operation on each received qubit and returns it to Bob. Bob then measures the backward qubits to learn about Alice's operations and hence the key bits. Recently, we proved the unconditional security of the final key of this protocol in the ideal device setting. In this paper, we prove that two-way DQKD protocols are immune to all detector side channel attacks at Bob's side, while we assume ideal detectors at Alice's …
Bob chooses a function from a set of functions and gives Alice the black box that computes it. Alice is to find a characteristic of the function through function evaluations. In the quantum case, the number of function evaluations can be smaller than the minimum classically possible. The fundamental reason for this violation of a classical limit is not known. We trace it back to a disambiguation of the principle that measuring an observable determines one of its eigenvalues. Representing Bob's choice of the label of the function as the unitary transformation of a random quantum measurement out…
A no-signalling channel transforming quantum systems in Alice's and Bob's laboratories is compatible with two different causal structures: (A < B) Alice's output causally precedes Bob's input and (B< A) Bob's output causally precedes Alice's input. I show that a quantum superposition of circuits operating within these two causal structures enables the perfect discrimination between no-signalling channels that can not be perfectly distinguished by any ordinary circuit.
We consider a quantum communication task between two users Alice and Bob, in which Alice and Bob exchange their respective quantum information by means of local operations and classical communication assisted by shared entanglement. Here, we assume that Alice and Bob may have quantum side information, not transferred, and classical communication is free. In this work, we derive general upper and lower bounds for the least amount of entanglement which is necessary to perfectly perform this task, called the state exchange with quantum side information. Moreover, we show that the optimal entangle…
We propose a two-way secure-communication protocol in which Alice uses an amplified spontaneous emission source while Bob employs binary phase-shift keying and an optical amplifier. Against an eavesdropper who captures all the light lost in fibers linking Alice and Bob, this protocol is capable of 3.5 Gbps quantum-secured direct communication at 50 km range. If Alice augments her terminal with a spontaneous parametric downconverter and both Alice and Bob add channel monitors, they can realize 2 Gbps quantum key distribution at that range against an eavesdropper who injects her own light into B…
Einstein-Podolsky-Rosen steering is a form of quantum nonlocality exhibiting an inherent asymmetry between the observers, Alice and Bob. We present a simple class of entangled two-qubit states which are one-way steerable, considering arbitrary projective measurements. That is, Alice can steer the state of Bob, but it is impossible for Bob to steer Alice's state. This shows that the nonlocal properties of entangled states can be fundamentally asymmetrical.
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of successfully unveiling whatever bit she desires. In this paper, we seek to determine these bounds for generalizations of the BB84 bit commitment protocol. In such protocols, an honest Alice commits to a bit by randomly choosing a state from a specified set and submitting this to Bob, and later unveils the bit to Bob by announcing the chosen state, at which point Bob …
We present a controlled quantum teleportation protocol. In the protocol, quantum information of an unknown state of a 2-level particle is faithfully transmitted from a sender (Alice) to a remote receiver (Bob) via an initially shared triplet of entangled particles under the control of the supervisor Charlie. The distributed entangled particles shared by Alice, Bob and Charlie function as a quantum information channel for faithful transmission. We also propose a controlled and secure direct communication scheme by means of this teleportation. After insuring the security of the quantum channel, …
The fully symmetric Gaussian tripartite entangled pure states will not exhibit two-mode Einstein Podolsky-Rosen (EPR)-steering. This means that any two participants cannot share quantum secrets using the security of one-sided device independent quantum key distribution (1SDI-QKD) without involving the third. They are restricted at most to standard quantum key distribution (S-QKD), which is less secure. Here we show that least some asymmetric tripartite systems can exhibit bipartite EPR-steering, so that two of the participants can use 1SDI-QKD without involving the other. This is possible beca…
We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as state merging and was introduced in [Horodecki et al., Nature, 436, 673 (2005)]. It has been shown that for free classical communication the minimal number of quantum bits that need to be sent from Alice to Bob is given by the conditional von Neumann entropy. However this result only holds asymptotically (in the sense that Alice and Bob share initially many identical copies of the state) and it was unclear h…
In a previous paper certain measurable criteria have been derived, that are sufficient to demonstrate the existence of Einstein-Podolsky-Rosen (EPR) correlations for measurements with continuous variable outcomes. Here it is shown how such EPR criteria, which do not demand perfect EPR correlations, can be used to prove the extent of security for continuous variable quantum cryptographic schemes (in analogy to that proposed by Ekert) where Alice and Bob hope to construct a secure sequence of values from measurements performed on continuous-variable EPR-correlated fields sent from a distant sour…
For a bipartite entangled state shared by two observers, Alice and Bob, Alice can affect the post-measured states left to Bob by choosing different measurements on her half. Alice can convince Bob that she has such an ability if and only if the unnormalized postmeasured states cannot be described by a local-hidden-state (LHS) model. In this case, the state is termed steerable from Alice to Bob. By converting the problem to construct LHS models for two-qubit Bell diagonal states to the one for Werner states, we obtain the optimal models given by Jevtic \textit{et al.} [J. Opt. Soc. Am. B 32, A4…
Alice and Bob each have half of a pair of entangled qubits. Bob measures his half and then passes his qubit to a second Bob who measures again and so on. The goal is to maximize the number of Bobs that can have an expected violation of the Clauser-Horne-Shimony-Holt (CHSH) Bell inequality with the single Alice. This scenario was introduced in [Phys. Rev. Lett. 114, 250401 (2015)] where the authors mentioned evidence that when the Bobs act independently and with unbiased inputs then at most two of them can expect to violate the CHSH inequality with Alice. Here we show that, contrary to this evi…
Blind quantum computation (BQC) allows a client (Alice), who only possesses relatively poor quantum devices, to delegate universal quantum computation to a server (Bob) in such a way that Bob cannot know Alice's inputs, algorithm, and outputs. The quantum channel between Alice and Bob is noisy, and the loss over the long-distance quantum communication should also be taken into account. Here we propose to use decoherence-free subspace (DFS) to overcome the collective noise in the quantum channel for BQC, which we call DFS-BQC. We propose three variations of DFS-BQC protocols. One of them, a coh…
We present a quantum secure direct communication scheme achieved by swapping quantum entanglement. In this scheme a set of ordered Einstein-Podolsky-Rosen (EPR) pairs is used as a quantum information channel for sending secret messages directly. After insuring the safety of the quantum channel, the sender Alice encodes the secret messages directly by applying a series local operations on her particles sequence according to their stipulation. Using three EPR pairs, three bits of secret classical information can be faithfully transmitted from Alice to remote Bob without revealing any information…
