Showing papers by "Charles H. Bennett published in 2000"

Quantum information and computation

Abstract: In information processing, as in physics, our classical world view provides an incomplete approximation to an underlying quantum reality. Quantum effects like interference and entanglement play no direct role in conventional information processing, but they can--in principle now, but probably eventually in practice--be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.

Exact and asymptotic measures of multipartite pure-state entanglement

Abstract: Hoping to simplify the classification of pure entangled states of multi $(m)\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ quantum systems, we study exactly and asymptotically (in $n)$ reversible transformations among $n\mathrm{th}$ tensor powers of such states (i.e., $n$ copies of the state shared among the same $m$ parties) under local quantum operations and classical communication (LOCC). For exact transformations, we show that two states whose marginal one-party entropies agree are either locally unitarily equivalent or else LOCC incomparable. In particular we show that two tripartite Greenberger-Horne-Zeilinger states are LOCC incomparable to three bipartite Einstein-Podolsky-Rosen (EPR) states symmetrically shared among the three parties. Asymptotic transformations yield a simpler classification than exact transformations; for example, they allow all pure bipartite states to be characterized by a single parameter---their partial entropy---which may be interpreted as the number of EPR pairs asymptotically interconvertible to the state in question by LOCC transformations. We show that $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states having an $m\ensuremath{-}\mathrm{w}\mathrm{a}\mathrm{y}$ Schmidt decomposition are similarly parametrizable, with the partial entropy across any nontrivial partition representing the number of standard quantum superposition or ``cat'' states $|{0}^{\ensuremath{\bigotimes}m}〉+|{1}^{\ensuremath{\bigotimes}m}〉$ asymptotically interconvertible to the state in question. For general $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ states, partial entropies across different partitions need not be equal, and since partial entropies are conserved by asymptotically reversible LOCC operations, a multicomponent entanglement measure is needed, with each scalar component representing a different kind of entanglement, not asymptotically interconvertible to the other kinds. In particular we show that the $m=4$ cat state is not isentropic to, and therefore not asymptotically interconvertible to, any combination of bipartite and tripartite states shared among the four parties. Thus, although the $m=4$ cat state can be prepared from bipartite EPR states, the preparation process is necessarily irreversible, and remains so even asymptotically. For each number of parties $m$ we define a minimal reversible entanglement generating set (MREGS) as a set of states of minimal cardinality sufficient to generate all $m\ensuremath{-}\mathrm{p}\mathrm{a}\mathrm{r}\mathrm{t}\mathrm{i}\mathrm{t}\mathrm{e}$ pure states by asymptotically reversible LOCC transformations. Partial entropy arguments provide lower bounds on the size of the MREGS, but for $mg2$ we know no upper bounds. We briefly consider several generalizations of LOCC transformations, including transformations with some probability of failure, transformations with the catalytic assistance of states other than the states we are trying to transform, and asymptotic LOCC transformations supplemented by a negligible $[o(n)]$ amount of quantum communication.

Notes on the history of reversible computation

Abstract: We review the history of the thermodynamics of information processing, beginning with the paradox of Maxwelrs demon; continuing through the efforts of Szilard, Brillouin, and others to demonstrate a thermodynamic cost of information acquisition; the discovery by Landauer of the thermodynamic cost of information destruction; the development of the theory of and classical models for reversible computation; and ending with a brief survey of recent work on quantum reversible computation.

In information processing, as in physics, our classical world view provides an incomplete approximation to an underlying quantum reality. Quantum effects like interference and entanglement play no direct role in conventional information processing, but they can—in principle now, but probably eventually in practice—be harnessed to break codes, create unbreakable codes, and speed up otherwise intractable computations.

Abstract: Information and computation theory have undergone a spurt of new growth, and a renewal of their historic connection to basic physics, as they have expanded to treat the intact transmission and processing of quantum states, and the interaction of such 'quantum information' with traditional forms of information. We may wonder why this did not happen earlier, as quantum principles have long been accepted as fundamental to all of physics. Perhaps the founders of information and computation theory, such as Shannon, Turing and von Neumann, were too accustomed to thinking of information processing in macroscopic terms, not yet having before them the powerful examples of the genetic code and ever-shrinking microelectronics. Be that as it may, information until recently has largely been thought of in classical terms, with quantum mechanics playing a supporting role in the design of the equipment to process it, and setting limits on the rate at which it could be sent through certain channels. Now we know that a fully quantum theory of information and information processing offers, among other benefits, a brand of cryptography whose security rests on fundamental physics, and a reasonable hope of constructing quan- tum computers that could dramatically speed up the solution of certain mathematical problems. These benefits depend on distinc- tively quantum properties such as uncertainty, interference and entanglement. At a more fundamental level, it has become clear that an information theory based on quantum principles extends and completes classical information theory, just as complex numbers extend and complete the reals. Besides quantum generalizations of classical notions such as sources, channels and codes, the new theory includes two complementary, quantifiable kinds of information— classical information and quantum entanglement. Classical infor- mation can be copied at will, but can only be transmitted forward in time, to a receiver in the sender's forward light cone. Entanglement in contrast, cannot be copied, but can connect any two points in space-time. Conventional data processing operations destroy entanglement, but quantum operations can create it and use it for various purposes, such as speeding up certain classical computa- tions and assisting in the transmission of classical information or intact quantum states. Part of the new quantum information theory is the qualitative and quantitative study of entanglement, and its interactions with classical information. Any means, such as an optical fibre, of delivering quantum systems more or less intact from one place to another, may be viewed as a quantum channel. Unlike classical channels, which are well characterized by a single capacity, quantum channels have several distinct capacities, depending on what one is trying to use them for, and what auxiliary resources are brought into play. New effects involving quantum information continue to be discovered, not only in the traditional areas of computation, channel capacity, and cryptography, but in areas such as commu- nication complexity and game theory.