Quantum Teamwork for Unconditional Multiparty Communication with Gaussian States

Quantum Teamwork for Unconditional Multiparty Communication with Gaussian States

Jing Zhang State Key Laboratory of Quantum Optics and Quantum Optics Devices, Institute of Opto-Electronics, Shanxi University, Taiyuan 030006, P.R.China.    Gerardo Adesso School of Mathematical Sciences, University of Nottingham, University Park, Nottingham NG7 2RD, UK.    Changde Xie State Key Laboratory of Quantum Optics and Quantum Optics Devices, Institute of Opto-Electronics, Shanxi University, Taiyuan 030006, P.R.China.    Kunchi Peng State Key Laboratory of Quantum Optics and Quantum Optics Devices, Institute of Opto-Electronics, Shanxi University, Taiyuan 030006, P.R.China.

We demonstrate the capability of continuous variable Gaussian states to communicate multipartite quantum information. A quantum teamwork protocol is presented according to which an arbitrary possibly entangled multimode state can be faithfully teleported between two teams each comprising many cooperative users. We prove that -mode Gaussian weighted graph states exist for arbitrary , that enable unconditional quantum teamwork implementations for any arrangement of the teams. These perfect continuous variable maximally multipartite entangled resources are typical among pure Gaussian states and are unaffected by the entanglement frustration occurring in multiqubit states.

03.67.Hk, 03.65.Ud, 03.67.Mn, 42.50.Dv

Introduction.— Information technology is hectically evolving towards the quantum scale. The discovery that entanglement, apart from being a fascinating founding feature of quantum theory, can be employed as a resource for novel or enhanced processing, manipulation, and distribution of information nielsenchuang () has spurred enormous theoretical and experimental progress. An appealing perspective for future mainstream quantum information technology is to be implemented over a “quantum internet” qinternet () architectured as a network where light buses and atomic storage units are interfaced to enable secure information transfer and quantum computation. The main routes towards the quantum internet are either relying on discrete-variable interfaces between single photons and single trapped atoms, which are physical representations of qubits, or on continuous-variable (CV) interfaces between light modes and mesoscopic atomic ensembles, which are physical realizations of bosonic modes. Historically, most of the concepts of quantum information and computation have been first developed in the qubit regime, and more recently generalized to a CV scenario where very promising perspectives have been acknowledged concerning both general theoretical insights and experimental realizations brareview (), due to the relative simplicity and high efficiency in the generation, manipulation, and detection of special classes of CV states, Gaussian states ourreview (). However, the two scenarios for quantum technological implementations have mostly progressed in parallel, with no truly radical instance in which the performance of one approach is demonstrated to be unique and unmatched by the other.

Here we introduce a general multipartite communication primitive – the ‘quantum teamwork’ – that cannot be implemented perfectly with -qubit resources beyond the threshold . On the contrary, we identify families of Gaussian multipartite CV entangled states of an arbitrary number of modes which remarkably enable the unconditional transmission of multimode quantum states between two teams of arbitrarily arranged parties over quantum networks. These CV resources, belonging to the class of Gaussian weighted graph states one (); thirteen (); twenty-one (), are shown to be typical in the space of pure Gaussian states, and are ideally unaffected by the kind of entanglement frustration that arises in complex low-dimensional many-body systems facchi (). We present examples and applications and we discuss the efficiency of quantum teamwork implementations in presence of realistic imperfections. Our results demonstrate that at a fundamental level CV entanglement offers enhanced perspectives for quantum technology.

Quantum teamwork.— A quantum police department is investigating malicious activities over the quantum internet qinternet (). A briefing is issued to agents in the form of an entangled -party quantum state distributed by the central station, possibly supplemented with classically broadcast information. The chief publicly orders the agents to split in two teams of and members, respectively, where we shall assume here and in the following. The parties carry their share of the entangled resource and the two teams independently proceed in the investigation. They gather progress encoded in generally entangled states of up to subsystems, supplied by independent informants. Suppose team wishes to communicate some undisclosed information to team . To do so, the members of each team must act cooperatively on their respective blocks of the original entangled system, in such a way that the distributed resource is converted into a perfect -user quantum teleportation channel, i.e. a tensor product of maximally entangled states of two subsystems, each belonging to one of the teams. One team can then transfer with perfect fidelity the -party state , containing the investigation progress, to the other team which may process or store it for further inspection. The teams then meet up for a new briefing, another entangled resource is redistributed and possibly a different configuration of the team squads is ordered for the subsequent stage of the investigation. And the process continues for steps until the case is closed.

We have just introduced an instance of quantum “teamwork”. It is a very powerful and practical primitive that generalizes conventional quantum teleportation bennett (); brakim () and multipartite teleportation networks network () and promises to be of many uses in quantum technology implementations. Crucial for the feasibility of quantum teamworks are the multipartite entangled resources distributed to the parties at each briefing. Above, we assumed different resources be needed at each step , adapted on the team configuration. This would however require some control at the station level, i.e. over the initialization of the protocol, posing a drawback to its versatility. We raise then an intriguing question: Do universal resources exist that enable the unconditional realization of quantum teamworks for any arrangement of the two teams? In mathematical terms, do -partite quantum states exist which are locally equivalent, with respect to any bipartition, to the tensor product of exactly maximally entangled states, plus uncorrelated single-party states?

Maximally multipartite entangled states.— Addressing such a question is quite challenging, mainly because the structural aspects of multipartite entanglement are still largely unknown rmps (). If one restricts the search for to states of qubits, however, one has in general a negative answer. Consider e.g. : while protocols for teleporting an arbitrary state of two qubits via either two Bell pairs rigolin () or a genuinely four-qubit multipartite entangled state yeo () exist, they cannot work for unit fidelity for all of the three possible splittings of four parties into two two-party teams. The most suitable qubit resource states to implement quantum teamworks would be the perfect “maximally multipartite entangled states” (MMES) recently studied by Facchi et al. facchi (), which are those -qubit states states that can be written in Schmidt form as across any partition where the block is made of qubits. They have the defining property of exhibiting the maximum allowed bipartite entanglement for all possible splittings. However, it has been proven that qubit perfect MMES do not exist for and for all , indicating the strong presence of an entanglement frustration as complexity increases facchi (). Nontrivial quantum teamwork instances can hence be faithfully implemented only among or parties (the case is still unsettled facchi ()) when each party is allotted a single qubit.

Perfect maximally multipartite entangled states for continuous variables.— In a CV scenario, one could translitterate the notion of MMES in a weak sense, by looking for states whose bipartite entanglements are simultaneously diverging across all bipartitions. It is easy to find CV states which meet these requirements, the most prominent examples being the GHZ-type (GHZ stands for Greenberger-Horne-Zeilinger) permutation-invariant Gaussian states network () of modes, in the limit of infinite local squeezing. However, for any bipartition these states are locally equivalent to a single maximally entangled state [Einstein-Podolsky-Rosen (EPR) pair] and as such only enable a very limiting case of quantum teamwork, where . This special instance of teleporting arbitrary single-mode states from any sender to any receiver, the latter acting cooperatively with assisting parties, was already introduced as a ‘quantum teleportation network’ network () and has been demonstrated experimentally for naturusawa ().

In this Letter we go beyond these limitations by identifying -mode CV Gaussian resources which are locally equivalent to a maximal number of EPR pairs for any partition, thus enabling unconditional quantum teamworks, and properly embodying the stronger notion of ‘perfect’ CV MMES. Precisely, we define a perfect CV MMES as a (not necessarily Gaussian) -mode state such that, with respect to any partition where the block is made of modes, it can be transformed by local unitaries into the tensor product of exactly EPR pairs (and uncorrelated single-mode states). Clearly such a state has infinite energy and stands as an idealized unphysical limit, therefore the notion of perfect CV MMES has to be understood in the sense of a family of states, depending on a parameter (for instance, a local squeezing degree), which converge asymptotically to the ideal perfect CV MMES when the parameter is very large. Each member of the family, characterized by a finite value of the parameter, would be an imperfect approximation of the perfect CV MMES, but crucially this approximation can be made arbitrarily precise.

We shall look for perfect CV MMES within the family of Gaussian weighted graph states of a -mode CV system. Gaussian states, up to local displacements, are completely specified by the covariance matrix of the second canonical moments ourreview (). A weighted graph Gaussian state is a pure -mode Gaussian state whose covariance matrix is defined in terms of a local squeezing degree , and associated to a weighted -vertex graph with adjacency matrix via a canonical prescription one (); thirteen (); twenty-one (), as detailed in the Supplementary material noteappendix (). For any splitting of the modes into a -mode block owned by party and a -mode block owned by party (recall that ), any pure -mode Gaussian state is equivalent, up to local (with respect to the bipartition) Gaussian unitary operations, to the tensor product of entangled two-mode squeezed states and additional uncorrelated single-mode vacua boteroecc (). The two-mode squeezed states (with ) are prototypical CV states which reproduce infinitely entangled EPR pairs in the limit . The number of entangled two-mode squeezed states in the normal form of a pure -mode Gaussian state for a given partition is given by the symplectic rank of its reduced -mode covariance matrix noterank ().

In the case of weighted graph Gaussian states, by writing the adjacency matrix in block form with respect to the partition, , one has one (); twenty-six (). Moreover, by construction, for these states, the two-mode squeezed pairs appearing in the normal form all simultaneously converge to EPR pairs for a diverging . Thus we obtain the following powerful and simple criterion: a pure -mode Gaussian weighted graph state with adjacency matrix is a perfect CV MMES in the limit of infinite local squeezing if and only if all the off-diagonal block submatrices have matrix rank .

How quantum teamwork works.— We are ready to provide examples of Gaussian resources useful for quantum teamworks. We first observe that the direct analogues of perfect qubit MMES for facchi (), described by unweighted, partially connected graphs, are perfect CV MMES, as one would expect. For no perfect qubit MMES exist facchi (). However, we disclosed several instances of four-mode CV perfect MMES. One such instance is provided by (the infinite-squeezing limit of) a Gaussian state with irreducible three-party correlations which has been recently introduced twenty-nine (); thirty () and experimentally demonstrated thirty-one (). It is defined by the action of a beam splitter on two beams each taken from a two-mode squeezed state, , where is a beam splitter transformation with transmittivity . This state is locally equivalent to the four-mode ring weighted CV graph state depicted in Fig. 1(a).

For the resource it is instructive to illustrate the explicit steps needed for the teleportation of arbitrary two-mode states from any two parties paired as team to the remaining two parties of team . If the only local operation required to obtain 2 two-mode squeezed entangled pairs is obviously an inverse beam splitter with transmittivity on the modes. If both teams have to locally mix their respective modes at a beam splitter, and further apply local squeezing operations, with squeezing on modes and , and on modes and (), to reproduce a dual entangled channel. If the same steps are required but with the following modifications, and . Suppose now a random arrangement is chosen for the two teams, and team wishes to teleport an arbitrary two-mode (entangled) state, e.g. a two-mode squeezed state , to team . After the local operations described above, each input mode is independently teleported according to the conventional Braunstein-Kimble scheme brakim (); twenty-seven () using the corresponding two-mode squeezed entangled pair adhikariecc (), and finally team obtains the two-mode state . The fidelity between input and output reads


depending on both the input squeezing and the effective squeezing of the two entangled pairs in the normal form of relative to the partition . We have , , . For any finite , , and , in which limit the entangled channels reproduce exactly EPR pairs, the fidelity converges to unity for all bipartitions [see Fig. 1(b)]. This is an unconditional realization of quantum teamwork communication for , experimentally feasible with current optical technology twenty-seven (); thirty-one (); naturusawa ().

More examples of perfect CV MMES are provided in the Supplementary material noteappendix ().

Figure 1: (Color online). (a) Weighted graph definition of four-mode perfect CV MMES locally equivalent to the state ; the weights displayed on the graph are the elements of the adjacency matrix. (b) Fidelity of the quantum teamwork for teleporting input two-mode squeezed states with squeezing , plotted versus the resource squeezing for the three possible arrangements of sender and receiver teams (the beam splitter transmittivity is ).

Typicality of continuous variable perfect maximally multipartite entangled states.— We may now attempt an estimate of the volume occupied by perfect CV MMES in the space of pure Gaussian states for arbitrary . The reduced symplectic eigenvalues () of the -mode covariance matrix of a generic -mode pure-state covariance matrix , corresponding to any block , are a continuous analytic function of the real elements of the covariance matrix ourreview (). It follows that the set of states which certainly fail to be perfect MMES, characterized by one or more , is of null measure. If we specialize to weighted graph Gaussian states, where by construction if all then they all diverge for infinite local squeezing, we can conclude that perfect CV MMES families are henceforth typical serafozzi () in the space of (weighted graph) pure Gaussian states, in the sense that randomly picked (weighted graph) pure Gaussian states for an arbitrary number of modes are expected to reproduce perfect MMES for diverging local squeezing notequbit (). We tested the typicality argument by a numerical construction of pure -mode Gaussian states described by (generally complete) graphs associated to a symmetric adjacency matrix with null principal diagonal and random off-diagonal integer weights . Remarkably, we found instances of perfect CV MMES at the first run for each (we tested up to ). An example for is presented in the Supplementary material noteappendix (). As mentioned, notable exceptions lying in the null-measure set of non-perfect MMES are the CV GHZ-type states network (), associated to fully connected unweighted graphs. As soon as the symmetry is broken and some randomness is plugged in the interaction weights, perfect maximal multipartite entanglement pronouncedly arises in CV Gaussian states, which are thus unaffected by the entanglement frustration featuring in complex many-body low dimensional systems facchi ().

Applications and remarks on practical implementations.— Perfect CV MMES stand as promising resources for operating the “quantum internet” qinternet (). All Gaussian weighted graph states, including perfect CV MMES, are efficiently engineerable with off-line squeezers and linear optics fourteen (). Let us also recall that several classes of cluster states, belonging to the family of (weighted) graph Gaussian states thirteen (); twenty-one (), are proven universal resources for CV one-way quantum computation seventeen (). Given the typicality of perfect CV MMES, we may expect that suitable graph structures exist for arbitrarily large such to achieve both the universality for quantum computation fundamentals () and the CV MMES property. By construction, perfect CV MMES enable the creation of EPR pairs between any two modes, and have unbounded entanglement width scaling linearly with , thus fulfilling the necessary conditions for efficient universality fundamentals (). Remarkably, perfect CV MMES automatically enable faithful “disk operations” such as cut & paste of large sectors of stored data. Here the input data are encoded in the state of multiple atomic ensembles, team owns the light modes interacting with the source units, and team controls the target storage units. Building on the demonstrations of quantum memory and teleportation from light to matter and viceversa polzikhonda (), unconditional reallocation of multimode data (up to half the total disk space) can be performed with our scheme. Perfect CV MMES for modes enable moreover data compression in the form of multipartite dense coding to transmit -way classical signals simultaneously twenty-eight (). Further applications include quantum secret/state sharing sharing ().

Clearly, any implementation will be affected by experimental imperfections, mainly traceable to the usage of a finite degree of squeezing in the preparation of the teamwork resources, which are in practice imperfect approximations of perfect CV MMES. This results in a non-unit fidelity in the transmission (as seen in Fig. 1(b) for finite , where e.g for  dB of resource squeezing). The ensuing inefficiency of the protocol propagates with the number of input modes to be teleported between the two teams. For instance, suppose the teamwork resource is a weighted graph state of modes, locally reducible to a tensor product of two-mode squeezed states, with squeezing , across any partition into two blocks of modes each. Let us consider as input state a -mode GHZ-type symmetric state with local squeezing network (); adhikariecc (). Each mode of the input state is individually teleported via a corresponding approximate EPR channel. The overall teamwork fidelity scales exponentally with , as , where is the fidelity brakim () for teleporting a single-mode vacuum via a two-mode squeezed state with squeezing . We observe that if (quasi-perfect CV MMES resource) then the performance is slightly affected by a larger input size, while for moderate (realistic) squeezing in the resource the performance can be quickly degraded with , and the degradation is enforced by the amount of entanglement in the input state (in this case, ). Suitable generalizations and optimizations of the conventional Braunstein-Kimble teleportation scheme brakim (), which is a building block of our networked scheme, might result in improved efficiencies for a given, finite resource squeezing degree. However, this is beyond the scope of this work, and we remark that the conceptual relevance of our results stays solid.

The demonstration advanced in this Letter of the powerful features of quantum teamwork protocols, peculiar of CV systems and structurally precluded to many-qubit scenarios, opens an avenue for the deep investigation of the characteristic traits of high-dimensional multipartite entanglement, and their exploitation to convey multimedia information over a global quantum communication web.

We acknowledge support by NSFC for Distinguished Young Scholars (Grant No. 10725416), National Basic Research Program of China (Grant No. 2006CB921101), NSFC Project for Excellent Research Team (Grant No. 60821004), NSFC (Grant No. 60678029, 60736040). We thank A. Serafini and N. Menicucci for fruitful discussions.


  • (1) C. H. Bennett and D. P. DiVincenzo, Nature 404, 247 (2000).
  • (2) H. J. Kimble, Nature 453, 1023 (2008).
  • (3) S.L. Braunstein and P. van Loock, Rev. Mod. Phys. 77, 513 (2005).
  • (4) G. Adesso and F. Illuminati, J. Phys. A 40, 7821 (2007).
  • (5) M. Hein et al., Phys. Rev. A 69, 062311 (2004).
  • (6) J. Zhang and S. L. Braunstein, Phys. Rev. A 73, 032318 (2006).
  • (7) J. Zhang, Phys. Rev. A 78, 052307 (2008).
  • (8) P. Facchi et al., Phys. Rev. A 77, 060304(R) (2008).
  • (9) C. H. Bennett et al., Phys. Rev. Lett. 70, 1895 (1993).
  • (10) S.L. Braunstein and H.J. Kimble, Phys. Rev. Lett. 80, 869 (1998).
  • (11) P. van Loock and S.L. Braunstein, Phys. Rev. Lett. 84, 3482 (2000).
  • (12) R. Horodecki et al., arXiv:quant-ph/0702225.
  • (13) G. Gordon and G. Rigolin, Phys. Rev. A 73, 042309 (2006).
  • (14) Y. Yeo and W. K. Chua, Phys. Rev. Lett. 96, 060502 (2006).
  • (15) H. Yonezawa et al., Nature 431, 430 (2004).
  • (16) See Supplementary material, EPAPS document ….
  • (17) A. Botero and B. Reznik, Phys. Rev. A 67, 052311 (2003); G. Giedke et al., Quant. Inf. Comp. 3, 211 (2003).
  • (18) The symplectic rank of a covariance matrix is the number of its symplectic eigenvalues strictly bigger than ourreview ().
  • (19) D. Fattal et al., arXiv:quant-ph/0406168.
  • (20) J. Zhang et al., Phys. Rev. A 76, 064301 (2007).
  • (21) J. Zhang et al., Phys. Rev. A 77, 022316 (2008).
  • (22) A. Tan et al., Phys. Rev. A 78, 013828 (2008).
  • (23) A. Furusawa et al., Science 282, 706 (1998); T. C. Zhang et al., Phys. Rev. A 67, 033802 (2003); W. P. Bowen et al., Phys. Rev. A 67, 032302 (2003); N. Takei et al., Phys. Rev. Lett. 94, 220502 (2005).
  • (24) S. Adhikari et al., Phys. Rev. A 77 012337 (2008); G. He et al., J. Phys. B: At. Mol. Opt. Phys. 41, 215503 (2008).
  • (25) A. Serafini et al., Phys. Rev. Lett. 98, 170501 (2007).
  • (26) In contrast, for -qubit perfect MMES all the eigenvalues of any -qubit reduced density matrix must be exactly equal to facchi (), i.e., these states fill a null measure set (strictly empty for and ).
  • (27) P. van Loock et al., Phys. Rev. A 76, 032321 (2007); N. C. Menicucci et al., Phys. Rev. A 76, 010302 (2007).
  • (28) N. C. Menicucci et al., Phys. Rev. Lett. 97, 110501 (2006).
  • (29) M. Van den Nest et al., New J. Phys. 9, 204 (2007).
  • (30) B. Julsgaard et al. Nature 432, 482 (2004); J. F. Sherson et al., ibid. 443, 557 (2006); K. Honda et al., Phys. Rev. Lett. 100, 093601 (2008); G. Appel et al., ibid. 100, 093602 (2008).
  • (31) S. L. Braunstein and H. J. Kimble, Phys. Rev. A 61, 042302 (2000); X. Y. Li et al., Phys. Rev. Lett. 88, 047904 (2002).
  • (32) T. Tyc and B. C. Sanders, Phys. Rev. A 65, 042310 (2002); A. M. Lance et al., ibid. 71, 033814 (2005).

Supplementary material

.1 S1. Weighted graph Gaussian states

A weighted graph quantum state is described by a mathematical graph , i.e. a set of vertices connected by a set of edges one (), in which every edge is tagged by a factor reflecting the interaction strength between vertices and . For CV systems, the Weyl-Heisenberg group of phase-space displacements is a Lie group with generators (position) and (momentum), where (with ). The single-mode Pauli operators (so termed in analogy with qubit systems) are defined as and with . In the preparation procedure of CV weighted graph states twenty-one (), only local Clifford (Gaussian) operations are used: first, one prepares each mode (or graph vertex) in a momentum-squeezed state (analogue of Pauli- eigenstate), then, one applies a quantum non demolition (QND) interaction () with coupling strength to each connected pair of modes . The resulting CV Gaussian weighted graph state becomes, in the limit of infinite local squeezing, a zero-eigenvalue simultaneous eigenstate of the position/momentum linear combination operators , where and modes are the nearest neighbors (connected vertices) of mode .

In general, the canonical definition of a weighted graph pure Gaussian state in terms of the adjacency matrix is the following. Letting be a local squeezing degree, we define as the Gaussian state whose field operators have the following variances: , , . The Wigner distribution of can be constructed as , where is the vector of phase-space variables. This implicitly defines the covariance matrix .

.2 S2. Further examples of perfect CV MMES

Here we wish to provide a general analytical family of CV perfect MMES for modes, which are inequivalent to the examples presented in the main text. These states are defined in the graph formalism by an adjacency matrix which is of Toeplitz form


where and . It can be readily checked that no frustration is present in these Gaussian states (see Supplementary Section S3), which enable – for a diverging local squeezing – the unconditional quantum teamwork communication of up to -mode states with perfect fidelity between two teams of arbitrarily arranged parties.

We also wish to present an explicit example of perfect CV MMES of a higher number of modes (specifically, ) as obtained from a random construction of the adjacency matrix with the aim of testing the typicality of perfect CV MMES (as detailed in the main text). A single iteration of our numerical program has provided the following adjacency matrix

Figure 2: Graph description of a -mode perfect CV MMES with randomly constructed adjacency matrix given by Eq. (3). Solid lines denote positive weights, while dotted lines are associated to negative weights. The absolute weights of the edges are integer numbers ranging from (blue) to (red).

It can be checked (see Supplementary Section S3) that the associated Gaussian state is a perfect CV MMES in the limit of infinite local squeezing. The graph associated to the adjacency matrix of Eq. (3) is depicted in Fig. 2

.3 S3. Verification of perfect CV MMES

The perfect MMES property was checked through the reduced adjacency rank criterion. At the level of the covariance matrix, for any partition where is a block of modes, the considered states are locally equivalent to the tensor product of uncorrelated vacua and two-mode squeezed states with squeezing degrees where . This means that in the limit these resources have the maximal number of EPR pairs in their normal form with respect to all bipartitions. The local operations needed to transform the perfect CV MMES into a product of EPR pairs can be deduced case by case from local graph complementation rules twenty-one ().

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description