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/9906080 · Physical Review A

Building multiparticle states with teleportation

Ernesto F. Galvão, Lucién Hardy

Published Jun 15, 2000• 19 citations
arXivHTMLPDF

Abstract

We describe a protocol which can be used to generate any N-partite pure quantum state using Einstein-Podolsky-Rosen pairs. This protocol employs only local operations and classical communication between the N parties $(N$-LOCC). In particular, we rely on quantum data compression and teleportation to create the desired state. The protocol can be used to obtain upper bounds for the bipartite entanglement of formation of an arbitrary N-partite pure state, in the asymptotic limit of many copies. We apply it to a few multipartite states of interest, showing that in some cases it is not optimal. Generalizations of the protocol are developed which are optimal for some of the examples we consider, but which may still be inefficient for arbitrary states.

DOI
10.1103/physreva.62.012309

Related papers

A general scheme for multiparty controlled quantum teleportation of an arbitrary N-particle state

Jun, Ye, Yue Li, Yu Liu +1 more

There is much interest in the multiparty quantum communications where quantum teleportation using high dimensional entangled quantum channel is one of the promising tools. In this paper, we propose a more general scheme for M-party controlled teleportation of an arbitrary N-particle quantum state using N-1 identical Einstein-Podolsky-Rosen pairs and one (M+2)-particle Greenberger-Horne-Zeilinger state together as quantum channel. Based on which a 2-party controlled teleportation of an arbitrary 3-particle state is tested with our scheme as an example.

arXiv:0803.3903•Mar 27, 2008•1 citation

Faithful teleportation with partially entangled states

Gilad Gour

We write explicitly a general protocol for faithful teleportation of a $d$-state particle (qudit) via a partially entangled pair of (pure) $n$-state particles. The classical communication cost (CCC) of the protocol is ${\mathrm{log}}_{2}(nd)$ bits, and it is implemented by a projective measurement performed by Alice, and a unitary operator performed by Bob (after receiving from Alice the measurement result). We prove the optimality of our protocol by a comparison with the concentrate and teleport strategy. We also show that if $d>n∕2$, or if there is no residual entanglement left after the faithful teleportation, the CCC of any protocol is at least ${\mathrm{log}}_{2}(nd)$ bits. Furthermore, we find a lower bound on the CCC in the process transforming one bipartite state to another by means of local operation and classical communication.

arXiv:quant-ph/0402133•Physical Review A•Oct 4, 2004•33 citations

Teleportation as a measure of entanglement for an arbitrary state of two qubits

J. Grondalski, Daniel F. V. James

Summary form only given. Characterizing the entanglement of a general bipartite quantum system is a difficult problem. Most measures involve difficult extremizations and their physical motivation is not always clear. In this paper we propose an experimental measure of entanglement based on a modified version of the familiar teleportation protocol of Bennett et al. (1993). Briefly, teleportation traditionally involves two parties, Alice and Bob. Initially, Alice has a qubit in an unknown quantum state which she would like to communicate to Bob and Bob has two qubits in an entangled Einstein-Podolsky-Rosen (EPR) pair. To accomplish this transfer, Bob shares one qubit of his EPR pair with Alice. She then performs a joint measurement or Bell measurement on her two qubits and relays this information back to Bob over a classical channel. Bob then uses the outcome of Alice's Bell measurement to transform his qubit, with a local unitary transformation, into the original quantum state, always with a fidelity of one.

Quantum Electronics and Laser Science Conference•Jun 25, 2003•0 citations

Exact and asymptotic measures of multipartite pure-state entanglement

Charles H. Bennett, Sandu Popescu, Daniel Rohrlich +2 more

Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in $n)$ reversible transformations among $n\mathrm{th}$ tensor powers of such states (i.e., $n$ copies of the state shared among the same $m$ parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the $m=4$ cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the $m=4$ cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties $m$ we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for $m>2$ we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible $[o(n)]$ amount of quantum communication.

arXiv:quant-ph/9908073•Physical Review A•Dec 12, 2000•482 citations

Scheme for Teleportation of a Multipartite Quantum State by Using a Single Entangled Pair as Quantum Channel

Xin-Wen Wang, Zhiyong Wang, Li-Xin Xia

We present a theoretical scheme for perfect teleportation of an unknown multipartite two-level state by a single EPR (Einstein–Podolsky–Rosen) pair, and then generalize it to multilevel, i.e., an N -quNit state can be teleported by a single quNit entangled pair, with additional local unitary operations. The feature of the scheme is that teleporting a multipartite state with a reduced amount of entanglement costs less classical bits.

Communications in Theoretical Physics•Feb 1, 2007•12 citations

Multipartite entanglement gambling: The power of asymptotic state transformations assisted by a sublinear amount of quantum communication

Ashish V. Thapliyal, John A. Smolin

Reversible state transformations under entanglement nonincreasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end more powerful versions of state transformations (or reducibilities), namely, LOCCq (asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC (asymptotic LOCC with catalysis) have been considered in the literature. In this paper we show that LOCCq state transformations are only as powerful as asymptotic LOCC state transformations for multipartite pure states. The basic tool we use is multipartite entanglement gambling: Any pure multipartite entangled state can be transformed to an Einstein-Podolsky-Rosen pair shared by some pair of parties and any irreducible m-party pure state $(m>~2)$ can be used to create any other state (pure or mixed) using LOCC. We consider applications of multipartite entanglement gambling to multipartite distillability and to characterizations of multipartite minimal entanglement generating sets. We briefly consider generalizations of this result to mixed states by defining the class of cat-distillable states, i.e., states from which cat states $(|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉)$ may be distilled.

arXiv:quant-ph/0212098•Physical Review A•Dec 31, 2003•10 citations
We describe a protocol which can be used to generate any N-partite pure quantum state using Einstein-Podolsky-Rosen pairs. This protocol employs only local operations and classical communication between the N parties (N(N(N-LOCC). In particular, we rely on quantum data compression and teleportation to create the desired state. The protocol can be used to obtain upper bounds for the bipartite entanglement of formation of an arbitrary N-partite pure state, in the asymptotic limit of many copies. We apply it to a few multipartite states of interest, showing that in some cases it is not optimal. Generalizations of the protocol are developed which are optimal for some of the examples we consider, but which may still be inefficient for arbitrary states.
There is much interest in the multiparty quantum communications where quantum teleportation using high dimensional entangled quantum channel is one of the promising tools. In this paper, we propose a more general scheme for M-party controlled teleportation of an arbitrary N-particle quantum state using N-1 identical Einstein-Podolsky-Rosen pairs and one (M+2)-particle Greenberger-Horne-Zeilinger state together as quantum channel. Based on which a 2-party controlled teleportation of an arbitrary 3-particle state is tested with our scheme as an example.
We write explicitly a general protocol for faithful teleportation of a ddd-state particle (qudit) via a partially entangled pair of (pure) nnn-state particles. The classical communication cost (CCC) of the protocol is log2(nd){\mathrm{log}}_{2}(nd)log2​(nd) bits, and it is implemented by a projective measurement performed by Alice, and a unitary operator performed by Bob (after receiving from Alice the measurement result). We prove the optimality of our protocol by a comparison with the concentrate and teleport strategy. We also show that if d>n∕2d>n∕2d>n∕2, or if there is no residual entanglement left after the faithful teleportation, the CCC of any protocol is at least log2(nd){\mathrm{log}}_{2}(nd)log2​(nd) bits. Furthermore, we find a lower bound on the CCC in the process transforming one bipartite state to another by means of local operation and classical communication.
Summary form only given. Characterizing the entanglement of a general bipartite quantum system is a difficult problem. Most measures involve difficult extremizations and their physical motivation is not always clear. In this paper we propose an experimental measure of entanglement based on a modified version of the familiar teleportation protocol of Bennett et al. (1993). Briefly, teleportation traditionally involves two parties, Alice and Bob. Initially, Alice has a qubit in an unknown quantum state which she would like to communicate to Bob and Bob has two qubits in an entangled Einstein-Podolsky-Rosen (EPR) pair. To accomplish this transfer, Bob shares one qubit of his EPR pair with Alice. She then performs a joint measurement or Bell measurement on her two qubits and relays this information back to Bob over a classical channel. Bob then uses the outcome of Alice's Bell measurement to transform his qubit, with a local unitary transformation, into the original quantum state, always with a fidelity of one.
Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in n)n)n) reversible transformations among nthn\mathrm{th}nth tensor powers of such states (i.e., nnn copies of the state shared among the same mmm parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the m=4m=4m=4 cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the m=4m=4m=4 cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties mmm we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for m>2m>2m>2 we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible [o(n)][o(n)][o(n)] amount of quantum communication.
Reversible state transformations under entanglement nonincreasing operations give rise to entanglement measures. It is well known that asymptotic local operations and classical communication (LOCC) are required to get a simple operational measure of bipartite pure state entanglement. For bipartite mixed states and multipartite pure states it is likely that a more powerful class of operations will be needed. To this end more powerful versions of state transformations (or reducibilities), namely, LOCCq (asymptotic LOCC with a sublinear amount of quantum communication) and CLOCC (asymptotic LOCC with catalysis) have been considered in the literature. In this paper we show that LOCCq state transformations are only as powerful as asymptotic LOCC state transformations for multipartite pure states. The basic tool we use is multipartite entanglement gambling: Any pure multipartite entangled state can be transformed to an Einstein-Podolsky-Rosen pair shared by some pair of parties and any irreducible m-party pure state (m> 2)(m>~2)(m> 2) can be used to create any other state (pure or mixed) using LOCC. We consider applications of multipartite entanglement gambling to multipartite distillability and to characterizations of multipartite minimal entanglement generating sets. We briefly consider generalizations of this result to mixed states by defining the class of cat-distillable states, i.e., states from which cat states $(|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉)$ may be distilled.