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

Entanglement, information, and multiparticle quantum operations

Anthony Chefles, Claire R Gilson, Stephen Mark Barnett

Published Feb 1, 2001• 35 citations
arXivHTMLPDF

Abstract

Collective operations on a network of spatially separated quantum systems can be carried out using local quantum operations, classical communication (CC), and shared entanglement (SE). Such operations can also be used to communicate classical information and establish entanglement between distant parties. We show how these facts lead to measures of the inseparability of quantum operations, and we argue that a maximally inseparable operation on two qubits is the SWAP operation. The generalization of our argument to N-qubit operations leads to the conclusion that permutation operations are maximally inseparable. For even N, we find the minimum SE and CC resources which are sufficient to perform an arbitrary collective operation. These minimum resources are $2(N\ensuremath{-}1)$ units of entanglement and $4(N\ensuremath{-}1)$ bits, and these limits can be attained using a simple teleportation-based protocol. We also obtain lower bounds on the minimum resources for the odd case. For all $N>~4,$ we show that the SE and CC resources required to perform an arbitrary operation are strictly greater than those that any operation can establish or communicate.

DOI
10.1103/physreva.63.032314

Related papers

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

On communication over an entanglement-assisted quantum channel

Ashwin Nayak, Julia Salzman

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding."The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

ACM Symposium on Theory of Computing (STOC)•Jan 1, 2002•28 citations

Investigating entanglement transformations in three-qubit states

Jiayang Xiao

This thesis studies the manipulation of entanglement in three-qubit quantum systems. I consider the operational setting in which the qubits are distributed to three spatially separated parties. The parties act locally on their quantum systems and share classical communication with one another, a scenario commonly called local operations and classical communication (LOCC). In the LOCC setting, there are two different classes of entanglement in multipartite systems, called the GHZ and W classes, which are inequivalent in the sense that states from one class cannot be transformed into the other without the consumption of additional entanglement. In this thesis, I first show that the LOCC conversion of certain GHZ and W-class states becomes possible by using only one additional ebit (“entangled bit”) of shared entanglement. In many cases, this can be proven as the minimal amount of needed entanglement. I then consider the problem of one-way communication transformations from general three-qubit states into two-qubit maximally entangled states, known as EPR states. An optimal protocol in terms of success probability is provided for W-class states. The success probability of this protocol coincides with the optimal success probability if two of the parties are allowed to act jointly within the same laboratory. In other words, forcing the locality constraint on all three parties does not weaken their capabilities for obtaining bipartite entanglement when starting from a W-class state. I also present that this property holds for certain types of GHZ-class states as well.

•Jan 1, 2015•0 citations

Hierarchies of incoherent quantum operations

Alexander Streltsov, Swapan Rana, Maciej Lewenstein +1 more

The search for a simple description of fundamental physical processes is an important part of quantum theory. One example for such an abstraction can be found in the distance lab paradigm: if two separated parties are connected via a classical channel, it is notoriously difficult to characterize all possible operations these parties can perform. This class of operations is widely known as local operations and classical communication (LOCC). Surprisingly, the situation becomes comparably simple if the more general class of separable operations is considered, a finding which has been extensively used in quantum information theory for many years. Here, we propose a related approach for the resource theory of quantum coherence, where two distant parties can only perform measurements which do not create coherence and can communicate their outcomes via a classical channel. We call this class local incoherent operations and classical communication (LICC). While the characterization of this class is also difficult in general, we show that the larger class of separable incoherent operations (SI) has a simple mathematical form, yet still preserving the main features of LICC. We apply these results to the task of assisted coherence distillation, where the aim is to locally extract maximally coherent states. For all pure states and certain mixed states we observe a collapse of all classes: the distillation rate is always the same. It remains open if the distillation rate can be different for general mixed states, and if the intersection of LOCC and SI is equivalent to LICC. We also introduce the task of incoherent teleportation and show that perfect incoherent teleportation of one qubit is possible with one singlet and two bits of classical communication. The approach presented here opens new ways to study the resource theory of coherence in distributed scenarios.

•Sep 24, 2015•3 citations

On communication over an entanglement-assisted quantum channel

Ashwin Nayak, Julia Salzman

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

arXiv:quant-ph/0206122•Jun 19, 2002•4 citations

Quantum remote control: Teleportation of unitary operations

Susana F. Huelga, Joan A. Vaccaro, Anthony Chefles +1 more

We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as quantum remote control. We investigate protocols that achieve this using local operations, classical communication, and shared entanglement. Lower bounds on the necessary entanglement and classical communication are determined using causality and the linearity of quantum mechanics. We examine in particular detail the resources required if the remote control is to be implemented as a classical black box. Under these circumstances, we prove that the required resources are, necessarily, those needed for implementation by bidirectional state teleportation.

arXiv:quant-ph/0005061•Physical Review A•Mar 15, 2001•277 citations
Collective operations on a network of spatially separated quantum systems can be carried out using local quantum operations, classical communication (CC), and shared entanglement (SE). Such operations can also be used to communicate classical information and establish entanglement between distant parties. We show how these facts lead to measures of the inseparability of quantum operations, and we argue that a maximally inseparable operation on two qubits is the SWAP operation. The generalization of our argument to N-qubit operations leads to the conclusion that permutation operations are maximally inseparable. For even N, we find the minimum SE and CC resources which are sufficient to perform an arbitrary collective operation. These minimum resources are 2(N\ensuremath−1)2(N\ensuremath{-}1)2(N\ensuremath−1) units of entanglement and 4(N\ensuremath−1)4(N\ensuremath{-}1)4(N\ensuremath−1) bits, and these limits can be attained using a simple teleportation-based protocol. We also obtain lower bounds on the minimum resources for the odd case. For all N> 4,N>~4,N> 4, we show that the SE and CC resources required to perform an arbitrary operation are strictly greater than those that any operation can establish or communicate.
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.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as "quantum teleportation" and "superdense coding."The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.
This thesis studies the manipulation of entanglement in three-qubit quantum systems. I consider the operational setting in which the qubits are distributed to three spatially separated parties. The parties act locally on their quantum systems and share classical communication with one another, a scenario commonly called local operations and classical communication (LOCC). In the LOCC setting, there are two different classes of entanglement in multipartite systems, called the GHZ and W classes, which are inequivalent in the sense that states from one class cannot be transformed into the other without the consumption of additional entanglement. In this thesis, I first show that the LOCC conversion of certain GHZ and W-class states becomes possible by using only one additional ebit (“entangled bit”) of shared entanglement. In many cases, this can be proven as the minimal amount of needed entanglement. I then consider the problem of one-way communication transformations from general three-qubit states into two-qubit maximally entangled states, known as EPR states. An optimal protocol in terms of success probability is provided for W-class states. The success probability of this protocol coincides with the optimal success probability if two of the parties are allowed to act jointly within the same laboratory. In other words, forcing the locality constraint on all three parties does not weaken their capabilities for obtaining bipartite entanglement when starting from a W-class state. I also present that this property holds for certain types of GHZ-class states as well.
The search for a simple description of fundamental physical processes is an important part of quantum theory. One example for such an abstraction can be found in the distance lab paradigm: if two separated parties are connected via a classical channel, it is notoriously difficult to characterize all possible operations these parties can perform. This class of operations is widely known as local operations and classical communication (LOCC). Surprisingly, the situation becomes comparably simple if the more general class of separable operations is considered, a finding which has been extensively used in quantum information theory for many years. Here, we propose a related approach for the resource theory of quantum coherence, where two distant parties can only perform measurements which do not create coherence and can communicate their outcomes via a classical channel. We call this class local incoherent operations and classical communication (LICC). While the characterization of this class is also difficult in general, we show that the larger class of separable incoherent operations (SI) has a simple mathematical form, yet still preserving the main features of LICC. We apply these results to the task of assisted coherence distillation, where the aim is to locally extract maximally coherent states. For all pure states and certain mixed states we observe a collapse of all classes: the distillation rate is always the same. It remains open if the distillation rate can be different for general mixed states, and if the intersection of LOCC and SI is equivalent to LICC. We also introduce the task of incoherent teleportation and show that perfect incoherent teleportation of one qubit is possible with one singlet and two bits of classical communication. The approach presented here opens new ways to study the resource theory of coherence in distributed scenarios.
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.
We consider the implementation of an arbitrary unitary operation U upon a distant quantum system. This teleportation of U can be viewed as quantum remote control. We investigate protocols that achieve this using local operations, classical communication, and shared entanglement. Lower bounds on the necessary entanglement and classical communication are determined using causality and the linearity of quantum mechanics. We examine in particular detail the resources required if the remote control is to be implemented as a classical black box. Under these circumstances, we prove that the required resources are, necessarily, those needed for implementation by bidirectional state teleportation.