Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

Entanglement, information and multiparticle quantum operations

Chefles, Anthony and Gilson, Claire R. and Barnett, Stephen M. (2001) Entanglement, information and multiparticle quantum operations. Physics Letters A, 63 (3). ISSN 0375-9601

[img]
Preview
Text (strathprints005849)
strathprints005849.pdf - Accepted Author Manuscript

Download (294kB) | Preview

Abstract

Collective operations on a network of spatially-separated quantum systems can be carried out using local quantum (LQ) 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 argue that a maximally-inseparable operation on 2 qubits is the SWAP operation. The generalisation 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 − 1) ebits and 4(N − 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 N4, we show that the SE/CC resources required to perform an arbitrary operation are strictly greater than those that any operation can establish/communicate.