Searcharxiv⌕ Search

arXiv subjects

Christopher A. Fuchs

Publications and source records attributed to Christopher A. Fuchs.

At least 73 records · Page 4Linked to original sources

Quantum Foundations in the Light of Quantum Information

This paper reports three almost trivial theorems that nevertheless appear to have significant import for quantum foundations studies. 1) A Gleason-like derivation of the quantum probability law, but based on the positive operator-valued measures as the basic notion of measurement (see also Busch, quant-ph/9909073). Of note, this theorem also works for 2-dimensional vector spaces and for vector spaces over the rational numbers, where the standard Gleason theorem fails. 2) A way of rewriting the quantum collapse rule so that it looks almost precisely identical to Bayes rule for updating probabilities in classical probability theory. And 3) a derivation of the tensor-product rule for combining quantum systems (and with it the very notion of quantum entanglement) from Gleason-like considerations for local measurements on bipartite systems along with classical communication.

quant-ph↗

Notes on a Paulian Idea: Foundational, Historical, Anecdotal and Forward-Looking Thoughts on the Quantum

This document is the first installment of three in the Cerro Grande Fire Series. It is a collection of letters written to various colleagues, most of whom regularly circuit this archive, including Howard Barnum, Paul Benioff, Charles Bennett, Herbert Bernstein, Doug Bilodeau, Gilles Brassard, Jeffrey Bub, Carlton Caves, Gregory Comer, Robert Griffiths, Adrian Kent, Rolf Landauer, Hideo Mabuchi, David Mermin, David Meyer, Michael Nielsen, Asher Peres, John Preskill, Mary Beth Ruskai, Ruediger Schack, Abner Shimony, William Wootters, Anton Zeilinger, and many others. The singular thread sewing all the letters together is the quantum. Some of the pieces are my best efforts to date to give substance to an evanescent thought I see rising from the field of quantum information---I call it the Paulian idea. To the extent I have communicated its misty shadow to my correspondents and seen a twinkle of enthusiasm, it seemed worthwhile to expand the jury on this anniversary occasion.

quant-ph↗

Unknown Quantum States: The Quantum de Finetti Representation

We present an elementary proof of the quantum de Finetti representation theorem, a quantum analogue of de Finetti's classical theorem on exchangeable probability assignments. This contrasts with the original proof of Hudson and Moody [Z. Wahrschein. verw. Geb. 33, 343 (1976)], which relies on advanced mathematics and does not share the same potential for generalization. The classical de Finetti theorem provides an operational definition of the concept of an unknown probability in Bayesian probability theory, where probabilities are taken to be degrees of belief instead of objective states of nature. The quantum de Finetti theorem, in a closely analogous fashion, deals with exchangeable density-operator assignments and provides an operational definition of the concept of an ``unknown quantum state'' in quantum-state tomography. This result is especially important for information-based interpretations of quantum mechanics, where quantum states, like probabilities, are taken to be states of knowledge rather than states of nature. We further demonstrate that the theorem fails for real Hilbert spaces and discuss the significance of this point.

quant-ph↗

Quantum versus Classical Domains for Teleportation with Continuous Variables

Fidelity F{classical} = 1/2 has been established as setting the boundary between classical and quantum domains in the teleportation of coherent states of the electromagnetic field (S. L. Braunstein, C. A. Fuchs, and H. J. Kimble, J. Mod. Opt. 47, 267 (2000)). Two recent papers by P. Grangier and F. Grosshans (quant-ph/0009079 and quant-ph/0010107) introduce alternate criteria for setting this boundary and as a result claim that the appropriate boundary should be F = 2/3. Although larger fidelities would lead to enhanced teleportation capabilities, we show that the new conditions of Grangier and Grosshans are largely unrelated to the questions of entanglement and Bell-inequality violations that they take to be their primary concern. With regard to the quantum-classical boundary, we demonstrate that fidelity F{classical} = 1/2 remains the appropriate point of demarcation. The claims of Grangier and Grosshans to the contrary are simply wrong, as we show by an analysis of the conditions for nonseparability (that complements our earlier treatment) and by explicit examples of Bell-inequality violations.

quant-ph↗

Information Tradeoff Relations for Finite-Strength Quantum Measurements

In this paper we give a new way to quantify the folklore notion that quantum measurements bring a disturbance to the system being measured. We consider two observers who initially assign identical mixed-state density operators to a two-state quantum system. The question we address is to what extent one observer can, by measurement, increase the purity of his density operator without affecting the purity of the other observer's. If there were no restrictions on the first observer's measurements, then he could carry this out trivially by measuring the initial density operator's eigenbasis. If, however, the allowed measurements are those of finite strength---i.e., those measurements strictly within the interior of the convex set of all measurements---then the issue becomes significantly more complex. We find that for a large class of such measurements the first observer's purity increases the most precisely when there is some loss of purity for the second observer. More generally the tradeoff between the two purities, when it exists, forms a monotonic relation. This tradeoff has potential application to quantum state control and feedback.

quant-ph↗

Entanglement of Formation of an Arbitrary State of Two Rebits

We consider entanglement for quantum states defined in vector spaces over the real numbers. Such real entanglement is different from entanglement in standard quantum mechanics over the complex numbers. The differences provide insight into the nature of entanglement in standard quantum theory. Wootters [Phys. Rev. Lett. 80, 2245 (1998)] has given an explicit formula for the entanglement of formation of two qubits in terms of what he calls the concurrence of the joint density operator. We give a contrasting formula for the entanglement of formation of an arbitrary state of two ``rebits,'' a rebit being a system whose Hilbert space is a 2-dimensional real vector space.

quant-ph↗

On quantum coding for ensembles of mixed states

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.

quant-ph↗

Criteria for Continuous-Variable Quantum Teleportation

We derive an experimentally testable criterion for the teleportation of quantum states of continuous variables. This criterion is especially relevant to the recent experiment of Furusawa et al. [Science 282, 706-709 (1998)] where an input-output fidelity of $0.58 \pm 0.02$ was achieved for optical coherent states. Our derivation demonstrates that fidelities greater than 1/2 could not have been achieved through the use of a classical channel alone; quantum entanglement was a crucial ingredient in the experiment.

quant-ph↗

A quantum analog of Huffman coding

We analyze a generalization of Huffman coding to the quantum case. In particular, we notice various difficulties in using instantaneous codes for quantum communication. Nevertheless, for the storage of quantum information, we have succeeded in constructing a Huffman-coding inspired quantum scheme. The number of computational steps in the encoding and decoding processes of N quantum signals can be made to be of polylogarithmic depth by a massively parallel implementation of a quantum gate array. This is to be compared with the O (N^3) computational steps required in the sequential implementation by Cleve and DiVincenzo of the well-known quantum noiseless block coding scheme of Schumacher. We also show that O(N^2(log N)^a) computational steps are needed for the communication of quantum information using another Huffman-coding inspired scheme where the sender must disentangle her encoding device before the receiver can perform any measurements on his signals.

quant-ph↗

Experimental Proposal for Achieving Superadditive Communication Capacities with a Binary Quantum Alphabet

We demonstrate superadditivity in the communication capacity of a binary alphabet consisting of two nonorthogonal quantum states. For this scheme, collective decoding is performed two transmissions at a time. This improves upon the previous schemes of Sasaki et al. [Phys. Rev. A 58, 146 (1998)] where superadditivity was not achieved until a decoding of three or more transmissions at a time. This places superadditivity within the regime of a near-term laboratory demonstration. We propose an experimental test based upon an alphabet of low photon-number coherent states where the signal decoding is done with atomic state measurements on a single atom in a high-finesse optical cavity.

quant-ph↗

Quantum Nonlocality without Entanglement

We exhibit an orthogonal set of product states of two three-state particles that nevertheless cannot be reliably distinguished by a pair of separated observers ignorant of which of the states has been presented to them, even if the observers are allowed any sequence of local operations and classical communication between the separate observers. It is proved that there is a finite gap between the mutual information obtainable by a joint measurement on these states and a measurement in which only local actions are permitted. This result implies the existence of separable superoperators that cannot be implemented locally. A set of states are found involving three two-state particles which also appear to be nonmeasurable locally. These and other multipartite states are classified according to the entropy and entanglement costs of preparing and measuring them by local operations.

quant-ph↗

Just Two Nonorthogonal Quantum States

From the perspective of quantum information theory, a system so simple as one restricted to just two nonorthogonal states can be surprisingly rich in physics. In this paper, we explore the extent of this statement through a review of three topics: (1) ``nonlocality without entanglement'' as exhibited in binary quantum communication channels, (2) the tradeoff between information gain and state disturbance for two prescribed states, and (3) the quantitative clonability of those states. Each topic in its own way quantifies the extent to which two states are ``quantum'' with respect to each other, i.e., the extent to which the two together violate some classical precept. It is suggested that even toy examples such as these hold some promise for shedding light on the foundations of quantum theory.

quant-ph↗

Cryptographic Distinguishability Measures for Quantum Mechanical States

This paper, mostly expository in nature, surveys four measures of distinguishability for quantum-mechanical states. This is done from the point of view of the cryptographer with a particular eye on applications in quantum cryptography. Each of the measures considered is rooted in an analogous classical measure of distinguishability for probability distributions: namely, the probability of an identification error, the Kolmogorov distance, the Bhattacharyya coefficient, and the Shannon distinguishability (as defined through mutual information). These measures have a long history of use in statistical pattern recognition and classical cryptography. We obtain several inequalities that relate the quantum distinguishability measures to each other, one of which may be crucial for proving the security of quantum cryptographic key distribution. In another vein, these measures and their connecting inequalities are used to define a single notion of cryptographic exponential indistinguishability for two families of quantum states. This is a tool that may prove useful in the analysis of various quantum cryptographic protocols.

quant-ph↗

Entanglement of Assistance

The newfound importance of ``entanglement as a resource'' in quantum computation and quantum communication compels us to quantify it in as many distinct ways as possible. Here we explore a new measure of entanglement for mixed quantum states of bipartite systems, which we name the Entanglement of Assistance. We show it to be the maximum average entanglement of all pure-state ensembles consistent with the given density matrix. In this sense, the Entanglement of Assistance is a quantity directly dual to the more standard Entanglement of Formation. With the help of lower and upper bounds, we calculate the Entanglement of Assistance for a few cases and use these results to show that it possesses the surprising property of superadditivity. We believe that this may shed some light on the question of additivity for the Entanglement of Formation.

quant-ph↗

Optimal Eavesdropping in Quantum Cryptography. I

We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rate in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe, consisting of two qubits. The qubits' interaction and their subsequent measurement are described explicitly. These results are combined to give an expression for the optimal information an eavesdropper can obtain for a given average disturbance when her interaction and measurements are performed signal by signal. Finally, the relation between quantum cryptography and violations of Bell's inequalities is discussed.

quant-ph↗

Information Gain vs. State Disturbance in Quantum Theory

The engine that powers quantum cryptography is the principle that there are no physical means for gathering information about the identity of a quantum system's state (when it is known to be prepared in one of a set of nonorthogonal states) without disturbing the system in a statistically detectable way. This situation is often mistakenly described as a consequence of the ``Heisenberg uncertainty principle.'' A more accurate account is that it is a unique feature of quantum phenomena that rests ultimately on the Hilbert space structure of the theory along with the fact that time evolutions for isolated systems are unitary. In this paper we shall explore several aspects of the information--disturbance principle in an attempt to make it firmly quantitative and flesh out its significance for quantum theory as a whole.

quant-ph↗

Entanglement-Enhanced Classical Communication on a Noisy Quantum Channel

We consider the problem of trying to send a single classical bit through a noisy quantum channel when two transmissions through the channel are available as a resource. Classically, two transmissions add nothing to the receiver's capability of inferring the bit. In the quantum world, however, one has the possible further advantage of entangling the two transmissions. We demonstrate that, for certain noisy channels, such entangled transmissions enhance the receiver's capability of a correct inference.

quant-ph↗

Information Gain vs. State Disturbance in Quantum Theory

The engine that powers quantum cryptography is the principle that there are no physical means for gathering information about the identity of a quantum system's state (when it is known to be prepared in one of a set of nonorthogonal states) without disturbing the system in a statistically detectable way. This situation is often mistakenly described as a consequence of the ``Heisenberg uncertainty principle.'' A more accurate account is that it is a unique feature of quantum phenomena that rests ultimately on the Hilbert space structure of the theory along with the fact that time evolutions for isolated systems are unitary. In this paper I explore several aspects of the ``information / disturbance principle'' in an attempt to make it firmly quantitative for both pure and mixed states. The final section briefly explores the extent to which such a principle can be taken as a foundation for unitary dynamics rather than as a consequence.

quant-ph↗