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

arXiv:quant-ph/0008006

Distillation of vacuum entanglement to EPR pairs

Benni Reznik

Published Aug 1, 2000• 26 citations
arXivHTMLPDF

Abstract

It is shown that by means of local interactions between a quantized relativistic field and a pair of non-entangled atoms, entanglement can be extracted from the vacuum and delivered to the atoms. The resulting mixed state of the atoms can be further distilled to EPR pairs. Therefore, in principle, teleportation and other entanglement assisted quantum communication tasks can rely on the vacuum alone as a resource for entanglement.

DOI
10.48550/arxiv.quant-ph/0008006

Related papers

Bound Entanglement Can Be Activated

Paweł Horodecki, Michał Horodecki, Ryszard Horodecki

Bound entanglement is the noisy entanglement which cannot be distilled to a singlet form. Thus it cannot be used alone for quantum communication purposes. Here we show that, nevertheless, the bound entanglement can be, in a sense, pumped into a single pair of free entangled particles. It allows for teleportation via the pair with the fidelity impossible to achieve without support of bound entanglement.

arXiv:quant-ph/9806058•Physical Review Letters•Feb 1, 1999•402 citations

Teleportation of a two-atom entangled state using a single EPR pair in cavity QED

Xin Ji, Li Ke, Zhang Shou

We propose a scheme for teleporting a two-atom entangled state in cavity quantum electrodynamics (QED). In the scheme, we choose a single Einstein–Podolsky–Rosen (EPR) pair as the quantum channel which is shared by the sender and the receiver. By using the atom–cavity-field interaction and introducing an additional atom, we can teleport the two-atom entangled state successfully with a probability of 1.0. Moreover, we show that the scheme is insensitive to cavity decay and thermal field.

Chinese Physics•Mar 1, 2006•7 citations

Many Copies May Be Required for Entanglement Distillation

John Watrous

A mixed quantum state $\ensuremath{\rho}$ shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of $\ensuremath{\rho}$ into a single shared pair of qubits having high fidelity with the maximally entangled state $|{\ensuremath{\varphi}}^{+}\ensuremath{\rangle}=(|00\ensuremath{\rangle}+|11\ensuremath{\rangle})/\sqrt{2}$. In this Letter it is proved that there exist states that are distillable, but for which an arbitrarily large number of copies is required before any distillation procedure can produce a shared pair of qubits with even a small amount of entanglement. Specifically, for every positive integer $n$ there exists a state $\ensuremath{\rho}$ that is distillable, but, given $n$ or fewer copies of $\ensuremath{\rho}$, every distillation procedure outputting a single shared pair of qubits outputs those qubits in a separable (i.e., unentangled) state.

arXiv:quant-ph/0312123•Physical Review Letters•Jul 1, 2004•84 citations

Teleportation of a Three-atom Entangled W State Using Three EPR Pairs in Cavity QED

Xin Ji

We proposed a scheme for teleporting a three-atom entangled W state in cavity QED.In the scheme,three EPR pairs are chosen as quantum channel shared by the sender and the receiver.By using atom-cavity-field interaction and appropriate unitary transformations,the three-atom entangled W state can be teleported successfully with probability 1.0.Moreover,the scheme does not need joint Bell measurement and is insensitive to the cavity decay and thermal field.

Journal of Yanbian University•Jan 1, 2011•0 citations

Entanglement assisted quantum communication protocols

Amélie Piveteau

Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.

•Jan 1, 2026•0 citations

Non-local games and communication complexity with noisy entanglement

Srijita Kundu, Olivier Lalonde

We study the impact of noise on the theories of quantum nonlocality and entanglement-assisted communication complexity. We consider non-local games and entanglement-assisted communication complexity in a model where Alice and Bob may share arbitrarily many noisy EPR pairs. We study four noise models: depolarizing noise, unital noise, biased reset noise, and erasure noise. Our results are as follows: 1. We upper bound the value of the CHSH game under all these noise models in terms of the noise parameter, without any assumptions on the measurements used in the strategy. 2. We prove a parallel repetition theorem for general non-local games under all noise models except biased reset noise; we prove an improved parallel repetition theorem for unique games. Our parallel repetition rate is smaller than the quantum parallel repetition rate for CHSH in a nontrivial noise regime. 3. Using our unique-game parallel repetition theorem and a relation defined by the CHSH game, we prove a separation between communication complexity with noisy vs noiseless entanglement. This implies an $Ω(n)$ two-way communication lower bound for distilling $n$ EPR pairs from noisy EPR pairs, in the same nontrivial noise regime. 4. We show that any interactive entanglement-assisted communication protocol can be simulated by an SMP communication protocol with noisy shared randomness, with an exponential blowup in communication. This generalizes a known result on the simulation of noiseless shared randomness with noisy shared randomness. 5. We show a polynomial lower bound on the number of copies of noisy EPR pairs required to compute the Equality function with constant communication, under all four noise models. The previous result gives a matching upper bound, and moreover, this answers an open question in the literature on whether logarithmically many noisy shared bits suffice for communication.

quant-pharXiv:2609.05122•Sep 7, 2026•2 citations
It is shown that by means of local interactions between a quantized relativistic field and a pair of non-entangled atoms, entanglement can be extracted from the vacuum and delivered to the atoms. The resulting mixed state of the atoms can be further distilled to EPR pairs. Therefore, in principle, teleportation and other entanglement assisted quantum communication tasks can rely on the vacuum alone as a resource for entanglement.
A mixed quantum state $\ensuremath{\rho}$ shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of $\ensuremath{\rho}$ into a single shared pair of qubits having high fidelity with the maximally entangled state $|{\ensuremath{\varphi}}^{+}\ensuremath{\rangle}=(|00\ensuremath{\rangle}+|11\ensuremath{\rangle})/\sqrt{2}$. In this Letter it is proved that there exist states that are distillable, but for which an arbitrarily large number of copies is required before any distillation procedure can produce a shared pair of qubits with even a small amount of entanglement. Specifically, for every positive integer nnn there exists a state $\ensuremath{\rho}$ that is distillable, but, given nnn or fewer copies of $\ensuremath{\rho}$, every distillation procedure outputting a single shared pair of qubits outputs those qubits in a separable (i.e., unentangled) state.
Quantum entanglement plays a central role in many quantum communication protocols. It allows distant particles to share correlations beyond the limits of classical interactions. Entanglement is essential for superdense coding, quantum teleportation, and secure cryptographic key distribution in quantum communication. It is also a pillar for developing quantum networks, where the management and distribution of entanglement are crucial for connecting distant nodes. Although perfect entanglement is a sought-after ideal, experimental imperatives, including entanglement distribution over long distances, often limit the quality of entangled states. An important question is whether weaker entanglement still offers advantages. First, we study more general tasks than dense coding to show that simpler measurements, combined with entanglement, allow advantageous and sometimes even optimal qubit communication protocols to be obtained. We also demonstrate that simple measurements can generate quantum correlations that cannot be modelled by two classical communication bits and can constitute an optimal protocol with quantum resources. We implement a novel Bell-type inequality tailored for certifying full network non-locality (FNN) to develop certification methods guaranteeing security on an entanglement-based network. Our experiment uses two pairs of polarised entangled photons in a network configuration with three nodes, briefly referred to as a bilocal network scenario. Finally, we show that weakly entangled states can improve communication over a qubit channel using only separate (local) measurements on isotropic non-steerable two-qubit states, without interference, of individual photons, across two communication tasks: secret sharing and its stochastic variant.
We study the impact of noise on the theories of quantum nonlocality and entanglement-assisted communication complexity. We consider non-local games and entanglement-assisted communication complexity in a model where Alice and Bob may share arbitrarily many noisy EPR pairs. We study four noise models: depolarizing noise, unital noise, biased reset noise, and erasure noise. Our results are as follows: 1. We upper bound the value of the CHSH game under all these noise models in terms of the noise parameter, without any assumptions on the measurements used in the strategy. 2. We prove a parallel repetition theorem for general non-local games under all noise models except biased reset noise; we prove an improved parallel repetition theorem for unique games. Our parallel repetition rate is smaller than the quantum parallel repetition rate for CHSH in a nontrivial noise regime. 3. Using our unique-game parallel repetition theorem and a relation defined by the CHSH game, we prove a separation between communication complexity with noisy vs noiseless entanglement. This implies an Ω(n)Ω(n)Ω(n) two-way communication lower bound for distilling nnn EPR pairs from noisy EPR pairs, in the same nontrivial noise regime. 4. We show that any interactive entanglement-assisted communication protocol can be simulated by an SMP communication protocol with noisy shared randomness, with an exponential blowup in communication. This generalizes a known result on the simulation of noiseless shared randomness with noisy shared randomness. 5. We show a polynomial lower bound on the number of copies of noisy EPR pairs required to compute the Equality function with constant communication, under all four noise models. The previous result gives a matching upper bound, and moreover, this answers an open question in the literature on whether logarithmically many noisy shared bits suffice for communication.