# Multiparty Quantum Communication Using Multiqubit Entanglement and Teleportation

Authors: S. Ghose; A. Kumar; A. M. Hamel
Journal: Physics Research International
 (2014)

---

## Abstract

We propose a2N qubit entangled channel that can be used to teleport N qubits in a network to a single receiver. We describe the structure of this channel and explicitly demonstrate how the protocol works. The channel can be used to implement a scheme in which all parties have to participate in order for the teleportation to be successful. This can be advantageous in various scenarios and we discuss the potential application of this protocol to voting.


---

## Body

## 1. Introduction

Communication in a network of multiple parties is currently a vital area of research and discussion. Quantum protocols that harness the power of entanglement offer new avenues for efficient multipartite communication. For example, the pioneering protocol of Christandl and Wehner [1] allows one member of a group to send another member anonymous messages. However, their solution allows a malicious group member to alter the transmitted state undetected. Brassard et al. [2] offer an improved anonymous communication protocol that sets no limit on the number of malicious participants and aborts if they are active. Identifying quantum channels for novel communication protocols thus remains an active area of research [3–16]. Such channels have potential applications to tasks such as voting, where private messages go to a single receiver. Quantum voting protocols have been proposed that use entangled states distributed amongst participants in order to allow each participant to act independently and in secret [17–24]. Although the schemes ensure the anonymity of the senders, they require qubits/qudits to be physically sent to the receiver, which makes protocols vulnerable to eavesdropping or cheating.In this paper we describe a protocol for communication using multiqubit entanglement and teleportation. We consider a network ofN parties, where each person wants to send a qubit privately and anonymously to a receiver. In the context of voting, each qubit could be used to encode a yes/no vote of the sender. One simple option for sending N qubits to a receiver is for each member of the network to share an entangled Bell pair with the receiver and use this entangled channel to teleport his/her qubit to the receiver. Here, we describe the use of a 2N qubit entangled state to perform the teleportation. This 2N qubit state cannot be written as a product of N Bell pairs via local operations. By controlling access to the 2Nth qubit, we can develop a scheme that cannot be implemented with Bell pairs: we look at the case where all members in the network must participate or the protocol fails; that is, if any member does not send a qubit, then the receiver will not receive any of the qubits perfectly. Such an all-or-nothing scenario would be useful in certain voting schemes such as a jury or a committee, or in countries like Australia where all voters must participate. Furthermore, this protocol would be useful in cases where each transmitted qubit only encodes part of a message and the message is readable only if all parts are teleported. For example, the qubits could encode parts of the password to a joint bank account shared by all N parties that can only be accessed with the knowledge and participation of all members. Another possible application is in a spy network, where each spy in the network knows and transmits part of a secret. Unlike other secret sharing schemes [25–29], the senders do not have to communicate with each other and do not have any common information at the end of the protocol.We propose a 2N qubit entangled channel that can be used to teleport N qubits to a receiver. Unlike other schemes for N-qubit teleportation [8, 30–32], our protocol only requires single and two-qubit gates and measurements that are feasible in current experiments. Like other teleportation protocols, since the N qubits are teleported to the receiver by the senders, there is no physical transmission of qubits from the senders to the receiver and thus nothing for an adversary to steal or eavesdrop on. We describe how the structure of the entangled channel can also be used to ensure that the protocol succeeds when all N senders participate. The set up satisfies the general criteria for voting protocols established in the literature [18].(1)
No one can determine the state of anyone else’s qubit (vote) from the publicly broadcast information in the protocol.(2)
The receiver will not be able to gain any information about the individual qubits from the publicly broadcast information in the protocol. The receiver does not need to know the state of each qubit to accurately receive each teleported qubit. Information labelling individual qubits (votes) can be discarded before measuring the state of each qubit to count votes.(3)
A sender cannot prove to a third party what his/her teleported state was. For voting, this means that the vote is receipt-free; that is, the voter cannot prove to a third party how he/she voted.(4)
A sender cannot transmit more than one qubit. In the context of voting, this means that each authorized voter can only vote once.In order to ensure these conditions, our protocol requires some assumptions to be made:(1)
The senders and the receiver verify that they share a perfect entangled channel using established techniques. Once the senders and the receiver verify that they share a perfect quantum channel, the protocol ensures that only authorized senders participate in the protocol.(2)
All the senders and the receiver in the protocol are honest; that is, none of them tries to cheat during the protocol.Under these assumptions, our protocol ensures teleportation of N independent qubits to the receiver with perfect fidelity and unit probability. We now proceed to discuss the protocol in detail.


## 2.2N Qubit Entangled Quantum Channel

Before describing our2N qubit entangled channel, we first review the properties of a standard quantum channel composed of the direct product of N Bell pairs |ϕ〉+=(1/2)[|00〉+|11〉]; that is,
(1)|Φ〉12⋯(2N-1)(2N)=|ϕ〉(1)(N+1)+⊗|ϕ〉(2)(N+2)+⋯⊗|ϕ〉(N-1)(2N-1)+⊗|ϕ〉(N)(2N)+,
where the 1st qubit is entangled with the (N+1)th qubit, 2nd qubit is entangled with the (N+2)th qubit, and so on. The 2N qubit channel in (1) has the property that the value (0 or 1) of the first N qubits is exactly the same as that of the last N qubits. For example, the four- and six-qubit quantum channels corresponding to the direct product of two and three Bell pairs can be written as
(2)|Φ〉1234=|ϕ〉13+⊗|ϕ〉24+=12[|00〉+|11〉]13⊗12[|00〉+|11〉]24=12[|0000〉+|0101〉+|1010〉+|1111〉]1234,(3)|Φ〉123456=|ϕ〉14+⊗|ϕ〉25+⊗|ϕ〉36+=12[|0000〉+|0101〉+|1010〉+|1111〉]1245⊗12[|00〉+|11〉]36=122[|000000〉+|001001〉+|010010〉iiiiiiii+|011011〉+|100100〉+|101101〉iiiiiiii+|110110〉+|111111〉]123456,
respectively. Notice that the first 2 qubits in each term in (2) are identical to the last 2 qubits and the first 3 qubits in (3) are identical to the last 3 qubits in each term. This property allows us to analyze the characteristics of the 2N qubit entangled quantum state used as a resource in this paper.The2N qubit entangled channel we propose |Ψ〉12⋯(2N-1)(2N) can be written as
(4)|Ψ〉12⋯(2N-1)2N=12N-1×[∑i‍{|ψi〉1⋯(N-1)|ψi〉(N+1)⋯(2N-1)}|ϕ〉N(2N)+∑j‍iiiiiiiiiiii+∑j‍{|ψj〉1⋯(N-1)|ψj〉(N+1)⋯(2N-1)}|ψ〉N(2N)+],
where the state |ψi〉 contains half of the basis states corresponding to (N-1) qubits with even number of |1〉’s and the state |ψj〉 contains other half of the basis states with odd number of |1〉’s. This state cannot be transformed into the product state of N Bell pairs (1), via local unitary operations. For each term of the 2N qubit entangled state |Ψ〉12⋯(2N-1)(2N), the value (0 or 1) of the 2Nth qubit is exactly the same as that of the Nth qubit if the number of |1〉’s from the qubits 1,2,…,(N-1) is even; else the value of the 2Nth qubit is opposite to that of the Nth qubit. For example, the states |ψi〉 and |ψj〉 for a four-qubit quantum channel would be |ψi〉1=|ψi〉3=|0〉 and |ψj〉1=|ψj〉3=|1〉. Similarly for a six-qubit quantum channel, the states |ψi〉 and |ψj〉 are |ψi〉12=|ψi〉45=|00〉,|11〉 and |ψj〉12=|ψj〉45=|01〉,|10〉, respectively. Hence, the four- and six-qubit entangled channels would be(5a)|Ψ〉1234=12[|00〉13⊗12{|00〉+|11〉}24iiiii+|11〉13⊗12{|01〉+|10〉}24]=12[|0000〉+|0101〉+|1011〉+|1110〉]1234,(5b)|Ψ〉123456=12[{|0000〉+|1111〉}124512iiii⊗12{|00〉+|11〉}36iiii+{|0101〉+|1010〉}1245iiii⊗12{|01〉+|10〉}36]=122[|000000〉+|001001〉+|010011〉iiiiiii+|011010〉+|100101〉+|101100〉iiiiiii+|110110〉+|111111〉]123456.Notice that, in each term, the fourth qubit (sixth qubit) in (5a) (see (5b)) is exactly the same as the second qubit (third qubit) if the number of |1〉’s in the individual terms |0〉, |1〉(|00〉,|01〉,|10〉,|11〉) of the state |ψ〉1/3(|ψ〉12/45) is even; else the fourth (sixth) qubit is the opposite of the second (third) qubit. Note also that the first N qubits each has nonzero concurrence with the 2Nth qubit, where concurrence is a measure of two-qubit entanglement [33]. This entanglement with the 2Nth qubit can be used for the teleportation scheme as described below.


## 3.N-Qubit Communication Protocol

We first review the original teleportation protocol proposed by Bennett et al. [34] in order to provide an insight into our scheme. If a sender wants to communicate a single qubit state |ϕ〉1=[a|0〉+b|1〉]1 to a receiver, then the sender and the receiver must share one of the Bell states, that is,
(6)|ψ〉23±=12[|01〉±|10〉]23,|ϕ〉23±=12[|00〉±|11〉]23,
where the qubit 2 is assigned to the sender and the qubit 3 is assigned to the receiver. If the shared entangled resource is |ϕ〉23+ then the joint state of the three qubits can be written as
(7)|ψ〉234=|ϕ〉1⊗|ϕ〉23+=|ϕ〉12+2[a|0〉+b|1〉]3+|ϕ〉12-2[a|0〉-b|1〉]3+|ψ〉12+2[a|1〉+b|0〉]3+|ψ〉12-2[a|1〉-b|0〉]3.
If the sender performs any measurement on the qubits 1 and 2 in the Bell basis, then the state of receiver’s qubit will be projected onto one of the four possible states as shown in (7) with equal probability of 1/4. For example, if the sender’s measurement outcome is |ϕ〉12+, then the receiver’s qubit will be projected onto the desired teleported state. However, in all the other measurement outcomes of the sender, the receiver would need to perform a single qubit unitary transformation on the qubit 3 to recover the teleported state.The direct product state ofN Bell pairs |ϕ〉ij+ in (1) can also be used as a resource for the teleportation of N single qubit states in a similar fashion. For example, if the 2N qubit channel in (1) is shared between the N senders and a receiver, then the first N qubits can be assigned to the N senders and the last N qubits can be assigned to the receiver. Each sender wants to teleport a single-qubit state to the receiver and thus measures his/her qubits in the Bell basis and sends the measurement result to the receiver. The receiver would then be able to recover the state of all the qubits by performing single-qubit unitary transformations on his/her qubits depending on the measurement outcomes of the senders. Notice that, similar to the single qubit teleportation protocol, the measurement outcomes |ϕ〉ij+, |ϕ〉ij-, |ψ〉ij+, and |ψ〉ij- would always correspond to the states [a|0〉+b|1〉], [a|0〉-b|1〉], [a|1〉+b|0〉], and [a|1〉-b|0〉], respectively.We now proceed to describe the teleportation protocol using our state (4) as an entangled channel, instead of the standard channel of N Bell pairs described above. For our protocol, the first N qubits in the shared entangled state are with the senders and the last N qubits are with the receiver. Each sender wants to teleport the state |ϕ〉Ai=[aAi|0〉Ai+bAi|1Ai〉] to the receiver. Thus, the joint state of 3N qubits, composed of N votes and 2N qubit entangled channel can be expressed as
(8)|ψ〉12⋯(3N-1)3N=∏i‍[aAi|0〉Ai+bAi|1〉Ai]⊗|ψ〉12⋯(2N-1)2N.
Each sender performs a Bell measurement on his/her qubit to be teleported and the shared entangled qubit in the 2N qubit entangled state. The joint state of 3N qubits in (8) can be rewritten in terms of the measurement basis of all the senders as
(9)|ψ〉=12N[{|ϕ〉A11+⊗|ϕ〉A22+⊗⋯|χ〉(2N-1)2N(4N)iiiiiiii⊗|ϕ〉AN-1(N-1)+⊗|ϕ〉ANN+}iiiiiii⊗|χ〉(N+1)(N+2)⋯(2N-1)2N(1)iiiiiii+{|ϕ〉A11+⊗|ϕ〉A22+⊗⋯iiiiiiiiiiii⊗|ϕ〉AN-1(N-1)+⊗|ϕ〉ANN-}iiiiiii⊗|χ〉(N+1)(N+2)⋯(2N-1)2N(2)+⋯iiiiiii+{|ψ〉A11-⊗|ψ〉A22-⊗⋯iiiiiiiiiiii⊗|ψ〉AN-1(N-1)-⊗|ψ〉ANN+}iiiiiii⊗|χ〉(N+1)(N+2)⋯(2N-1)2N(4N-1)iiiiiii+{|ψ〉A11-⊗|ψ〉A22-⊗⋯iiiiiiiiiiii⊗|ψ〉AN-1(N-1)-⊗|ψ〉ANN-}iiiiiii⊗|χ〉(N+1)(N+2)⋯(2N-1)2N(4N)],
where |χ〉(N+1)(N+2)⋯(2N-1)2N(1)-|χ〉(N+1)(N+2)⋯(2N-1)2N(4N) are the states of receiver’s qubits depending on the measurement outcomes of all the senders and contains all the information about the individual qubits (votes). For example, if we consider a four-qubit entangled resource, then the |χ〉34(1) state corresponding to the measurement outcomes |ϕ〉A11+ and |ϕ〉A22+ would be
(10)|χ〉34(1)=[aA1aA2|00〉34+aA1bA2|01〉34ii+bA1aA2|11〉34+bA1bA2|10〉34].The receiver at this stage would not be able to separate the exact qubits teleported by the senders as the joint state of receiver’s qubit cannot be written as the direct product state of the individual qubits. However, if he/she performs a CNOT operation with qubit 3 as the control and qubit 4 as the target, then the joint state of the receiver’s qubits can be reexpressed as(11)|χ〉34(1)=[aA1aA2|00〉34+aA1bA2|01〉34ii+bA1aA2|10〉34+bA1bA2|11〉34]=[aA1|0〉3+bA1|13〉]⊗[aA2|0〉4+bA2|14〉],
respectively. Thus, the receiver can successfully separate the qubits teleported by the senders. However, for all the other measurement outcomes of the senders, the receiver would need to perform single qubit unitary operations in addition to the CNOT transformations. The required single-qubit unitary transformations for the use of the four qubit entangled channel are summarized in Table 1. For this protocol to be successful, the receiver must know the distribution of entangled qubits so that he/she can apply the correct unitary transformations to recover the teleported qubits accurately. The multiqubit state teleported to the receiver could be used as an input for another computation or communication protocol without the receiver having to know the state of the qubits.Table 1
2-qubit teleportation: unitary transformations required for the receiver to recover two qubits depending on the measurement outcomes of the two senders.
First sender’s measurements
Second sender’s measurements
Unitary transformations required to obtain the correct votes corresponding to the measurement outcomes (++, +-, -+, --)
|
ϕ
〉
A
1
1
±
|
ϕ
〉
A
2
2
±
I, σz4, σz3, σz3σz4
|
ϕ
〉
A
1
1
±
|
ψ
〉
A
2
2
±
σ
x
4, σy4, σz3σx4, σz3σy4
|
ψ
〉
A
1
1
±
|
ϕ
〉
A
2
2
±
σ
x
3, σx3σz4, σy3, σy3σz4
|
ψ
〉
A
1
1
±
|
ψ
〉
A
2
2
±
σ
x
3
σ
x
4, σx3σy4, σy3σx4, σy3σy4For the case of a2N qubit entangled channel, the state |χ〉(N+1)(N+2)⋯(2N-1)2N(1) corresponding to the measurement outcomes |ϕ〉A11+,|ϕ〉A22+,…,|ϕ〉AN-1(N-1)+ and |ϕ〉AN(N)+ can be either written as
(12)|χ〉(N+1)(N+2)⋯(2N-1)2N(1)=[aA1aA2⋯aAN-1aAN|00⋯00〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+aA1aA2⋯aAN-1bAN|00⋯01〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+aA1aA2⋯bAN-1aAN|00⋯11〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+aA1aA2⋯bAN-1bAN|00⋯10〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+⋯iiiiiiii+bA1bA2⋯aAN-1aAN|11⋯00〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+bA1bA2⋯aAN-1bAN|11⋯01〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+bA1bA2⋯bAN-1aAN|11⋯11〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+bA1bA2⋯bAN-1bAN|11⋯10〉(N+1)(N+2)⋯(2N-1)2N]
if N is even or
(13)|χ〉(N+1)(N+2)⋯(2N-1)2N(1)=[aA1aA2⋯aAN-1aAN|00⋯00〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+aA1aA2⋯aAN-1bAN|00⋯01〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+aA1aA2⋯bAN-1aAN|00⋯11〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+aA1aA2⋯bAN-1bAN|00⋯10〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+⋯iiiiiiii+bA1bA2⋯aAN-1aAN|11⋯01〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+bA1bA2⋯aAN-1bAN|11⋯00〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+bA1bA2⋯bAN-1aAN|11⋯10〉(N+1)(N+2)⋯(2N-1)2Niiiiiiii+bA1bA2⋯bAN-1bAN|11⋯11〉(N+1)(N+2)⋯(2N-1)2N]
if N is odd. In order to recover the teleported qubits, the receiver performs (N-1) CNOT operations on the joint state of N qubits by always using the 2Nth qubit as the target and the qubits (N+1),(N+2),…(2N-2),(2N-1) as controls, respectively. The CNOT operations transform the states in (12) and (13) to the form
(14)|χ〉(N+1)(N+2)⋯(2N-1)2N(1)=∏i‍(aAi|0〉N+i+bAi|1〉N+i).
In this specific case, the receiver does not need to perform any single-qubit unitary transformations. However, for all other sets of measurement outcomes, the receiver would need to apply single-qubit transformations to his/her qubits conditioned on the senders’ measurement outcomes to exactly recover the teleported qubits. Notice that the measurement outcomes |ϕ〉Aii+, |ϕ〉Aii-, |ψ〉Aii+, and |ψ〉Aii- correspond to the states [aAi|0〉N+i+bAi|1〉N+i], [aAi|0〉N+i-bAi|1〉N+i], [aAi|1〉N+i+bAi|0〉N+i], and [aAi|1〉N+i-bAi|0〉N+i], respectively. For example, if the measurement outcomes of all the senders are |ψ〉Aii- then in addition to the (N-1) CNOT operations, the receiver needs to apply σyi operations to all the qubits. Similarly, for all other sets of measurement outcomes, the receiver has to apply the appropriate unitary to each qubit in order to recover all the teleported qubits accurately.Note that the all the receiver’s CNOT operations use the2Nth qubit as a target. The channel is not symmetric so it is important for the 2Nth qubit to be the target qubit. Thus, if the receiver does not have access to the 2Nth qubit for performing the CNOT gates, then the protocol would not work. Thus by controlling the receiver’s access to the 2Nth qubit one can ensure that the protocol is only successful when all the senders participate. In order to ensure that the receiver only performs all the CNOT operations when all the senders participate, one could require that the receiver only gets access to the 2Nth qubit after all the senders broadcast their measurement results. If one or more senders decide not to participate in the scheme and do not measure his/her qubit, then the receiver would not get access to the 2Nth qubit and would not be able to perform any of the CNOT operations. In comparison, for the standard teleportation using N Bell pairs, limiting the receiver’s access to only the 2Nth qubit would not prevent the successful teleportation of the 1st N-1 qubits. Our protocol thus offers the possibility of a scheme that cannot be done with N Bell pairs. Securing access to the 2Nth qubit also has an additional benefit: if the other qubits on the receiver’s end are compromised or stolen, the teleported state of the qubits cannot be recovered from the stolen qubits, since the 2Nth qubit is required as a target to perform the CNOT operations and recover the teleported state of the other qubits. Thus, by keeping the 2Nth qubit secure, the protocol’s security is ensured. In comparison, for the standard teleportation using N Bell pairs, all the qubits have to be kept safe in order to ensure secure teleportation. In a network as the number of senders N grows larger, the benefit of our protocol increases.The protocol described above can be used in a voting system, where each sender sends a yes/no vote encoded in the teleported qubit. The voters (senders) do not have to physically send their votes to the polling station, since their votes are teleported to the receiver at the polling station. When we vote with a traditional paper ballot system, a number of properties are either explicit or implicit, properties such as confidentiality, eligibility, and integrity. Electronic voting systems, including quantum based systems, attempt to accomplish similar goals in the digital domain. In particular, they strive to maintain integrity, ensure eligibility, preserve unlinkability, and allow verifiability. The classic text,Applied Cryptography [35], lists specific properties a voting system should have. A more recent work [36] describes an entire taxonomy providing a hierarchy of protection a voting system can provide. Quantum-based systems excel at certain aspects. For example, our system has no physical transfer of ballots, since the vote qubits are teleported, so there is nothing to physically steal. Also, thanks to the no-cloning theorem, our ballots cannot be duplicated (and, in fact, nonduplication is identified by [35] as one of the hardest requirements to meet).A recent quantum paper [18] lists security properties that a quantum voting system should satisfy and here we compare our protocol against these properties and describe explicitly below how our protocol can be used in a manner that meets these rules.(R1)
The vote of each voter should be kept secret from all other voters. Like all teleportation schemes, since the only publicly broadcast messages are the measurement outcomes of each voter, the individual votes cannot be deterministically extracted from this public information. In fact this means that not just the other voters are ignorant of a particular vote, but any outside observer is similarly ignorant.(R2)
The receiver should not be able to gain information about the voting of individual voters. The receiver at the polling station does not need to first know the state of each qubit (the vote) in order to perform the transformations required to accurately receive each teleported vote qubit. Once the receiver at the polling station has performed the operations and all the qubits have been successfully teleported, the information regarding which qubit was teleported from which sender can be deleted before the vote qubits are sent for measurement in order to count the vote. Hence when the votes are counted, there is no information about the voting of individual voters.(R3)
The votes should be receipt-free. Each voter’s Bell measurement destroys the original state that was to be teleported, so a voter cannot show his/her vote to a third party after the vote has been teleported. Furthermore, the voter cannot use the measurement outcomes to prove to a third party what his/her vote was.(R4)
A voter should not vote more than once. Once a sender performs a Bell measurement on his/her qubit from the entangled channel, it becomes disentangled from the rest of the system. Thus, the sender cannot teleport additional votes without having more qubits from the entangled qunatum channel. This ensures that a sender in a voting scheme cannot vote more than once.Furthermore, we additionally meet the requirement that only authorized voters can vote. Here we assume that a standardized authorization scheme has been used to create a list of authorized voters. The entangled channel qubits are then only distributed to voters on this list. Without sharing a qubit from the entangled channel, a voter will not be able to teleport his/her vote. Unauthorized voters who are not on the list will not be a part of the entangled network and cannot vote.


## 4. Conclusion

The development of resources for quantum communication and computation lies at the heart of quantum information theory. We have described a2N qubit entangled channel that can be used to teleport N independent qubits in a network to a single receiver. We have discussed the structure of this channel and demonstrated how the protocol can be used for teleporting N qubits using only single and 2-qubit operations. We have shown the explicit operations required for 2- and 3-qubit teleportation and described the general N-qubit teleportation scheme. The structure of the channel constructed allows the design of a teleportation protocol in which all authorized parties that have a qubit from the entangled channel have to participate in the protocol. This can be advantageous in situations where we demand all parties to participate. As an example, we have discussed the potential application of this protocol in a voting scheme. This scheme ensures that all voters must participate, that only authorized voters can vote, that each voter can only vote once, and that the vote is receipt-free. Unlike other quantum voting schemes, a third party cannot intercept or steal the votes, since the votes are teleported rather than physically sent. Assuming that the locations of the voters are isolated from each other, then the votes are private since the individual votes cannot be extracted perfectly from the publicly broadcast measurement outcomes. Our results thus demonstrate the potential of using multiqubit entanglement for communication tasks tailored to specific needs. We hope to extend this idea to develop other novel schemes in the future.



---

*Source: 948750-2014-08-11.xml*