Picture of DNA strand

Pioneering chemical biology & medicinal chemistry through Open Access research...

Strathprints makes available scholarly Open Access content by researchers in the Department of Pure & Applied Chemistry, based within the Faculty of Science.

Research here spans a wide range of topics from analytical chemistry to materials science, and from biological chemistry to theoretical chemistry. The specific work in chemical biology and medicinal chemistry, as an example, encompasses pioneering techniques in synthesis, bioinformatics, nucleic acid chemistry, amino acid chemistry, heterocyclic chemistry, biophysical chemistry and NMR spectroscopy.

Explore the Open Access research of the Department of Pure & Applied Chemistry. Or explore all of Strathclyde's Open Access research...

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.