Results 1  10
of
52
Unconditionally Secure Quantum Bit Commitment is Impossible,” Phys
 Rev. Lett
, 1997
"... The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not rely on any restriction on the time, space or technology available to the cheaters. We show that this claim cannot be applied to any quantum bit c ..."
Abstract

Cited by 134 (10 self)
 Add to MetaCart
The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not rely on any restriction on the time, space or technology available to the cheaters. We show that this claim cannot be applied to any quantum bit commitment protocol. We briefly discuss the consequences for quantum cryptography.
Quantum mechanics as quantum information (and only a little more), Quantum Theory: Reconsideration of Foundations
, 2002
"... In this paper, I try once again to cause some goodnatured trouble. The issue remains, when will we ever stop burdening the taxpayer with conferences devoted to the quantum foundations? The suspicion is expressed that no end will be in sight until a means is found to reduce quantum theory to two or ..."
Abstract

Cited by 61 (6 self)
 Add to MetaCart
In this paper, I try once again to cause some goodnatured trouble. The issue remains, when will we ever stop burdening the taxpayer with conferences devoted to the quantum foundations? The suspicion is expressed that no end will be in sight until a means is found to reduce quantum theory to two or three statements of crisp physical (rather than abstract, axiomatic) significance. In this regard, no tool appears better calibrated for a direct assault than quantum information theory. Far from a strained application of the latest fad to a timehonored problem, this method holds promise precisely because a large part—but not all—of the structure of quantum theory has always concerned information. It is just that the physics community needs reminding. This paper, though takingquantph/0106166 as its core, corrects one mistake and offers several observations beyond the previous version. In particular, I identify one element of quantum mechanics that I would not label a subjective term in the theory—it is the integer parameter D traditionally ascribed to a quantum system via its Hilbertspace dimension. 1
Entanglementassisted capacity of a quantum channel and the reverse shannon theorem
 IEEE Trans. Inf. Theory
, 2002
"... Abstract—The entanglementassisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entangleme ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
Abstract—The entanglementassisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of after half of it has passed through the channel. We calculate entanglementassisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglementassisted communication—communication over a discrete memoryless channel (DMC) between parties who share prior random information—we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency. Index Terms—Channel capacity, entanglement, quantum information, Shannon theory. I.
Unknown quantum states: the quantum de Finetti representation
 J. Math. Phys
"... 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 advanc ..."
Abstract

Cited by 44 (7 self)
 Add to MetaCart
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 densityoperator assignments and provides an operational definition of the concept of an “unknown quantum state ” in quantumstate tomography. This result is especially important for informationbased 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. I.
Quantum multiprover interactive proof systems with limited prior entanglement
 Journal of Computer and System Sciences
"... This paper gives the first formal treatment of a quantum analogue of multiprover interactive proof systems. In quantum multiprover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among prov ..."
Abstract

Cited by 29 (3 self)
 Add to MetaCart
This paper gives the first formal treatment of a quantum analogue of multiprover interactive proof systems. In quantum multiprover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among provers. This paper focuses on the latter situation and proves that, if provers do not share any prior entanglement each other, the class of languages that have quantum multiprover interactive proof systems is equal to NEXP. It implies that the quantum multiprover interactive proof systems without prior entanglement have no gain to the classical ones. This result can be extended to the following statement of the cases with prior entanglement: if a language L has a quantum multiprover interactive proof system allowing at most polynomially many prior entangled qubits among provers, L is necessarily in NEXP. Another interesting result shown in this paper is that, in the case the prover does not have his private qubits, the class of languages that have singleprover quantum interactive proof systems is also equal to NEXP. Our results are also of importance in the sense of giving exact correspondances between quantum and classical complexity classes, because there have been known only a few results giving such correspondances.
Characterizing quantum theory in terms of informationtheoretic constraints
 Foundations of Physics
, 2003
"... We show that three fundamental informationtheoretic constraints—the impossibility of superluminal information transfer between two physical systems by performing measurements on one of them, the impossibility of broadcasting the information contained in an unknown physical state, and the impossibil ..."
Abstract

Cited by 28 (3 self)
 Add to MetaCart
We show that three fundamental informationtheoretic constraints—the impossibility of superluminal information transfer between two physical systems by performing measurements on one of them, the impossibility of broadcasting the information contained in an unknown physical state, and the impossibility of unconditionally secure bit commitment—suffice to entail that the observables and state space of a physical theory are quantummechanical. We demonstrate the converse derivation in part, and consider the implications of alternative answers to a remaining open question about nonlocality and bit commitment. KEY WORDS: quantum theory; informationtheoretic constraints. Of John Wheeler’s ‘‘Really Big Questions,’ ’ the one on which most progress has been made is It from Bit?—does information play a significant role at the foundations of physics? It is perhaps less ambitious than some of the other Questions, such as How Come Existence?, because it does not necessarily require a metaphysical answer. And unlike, say, Why the Quantum?, it does not require the discovery of new laws of nature: there was room for hope that it might be answered through a better understanding of the laws as we currently know them, particularly those of quantum physics. And this is what has happened: the better understanding is the quantum theory of information and computation. 1
Information and Computation: Classical and Quantum Aspects
 REVIEWS OF MODERN PHYSICS
, 2001
"... Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely ..."
Abstract

Cited by 23 (2 self)
 Add to MetaCart
Quantum theory has found a new field of applications in the realm of information and computation during the recent years. This paper reviews how quantum physics allows information coding in classically unexpected and subtle nonlocal ways, as well as information processing with an efficiency largely surpassing that of the present and foreseeable classical computers. Some outstanding aspects of classical and quantum information theory will be addressed here. Quantum teleportation, dense coding, and quantum cryptography are discussed as a few samples of the impact of quanta in the transmission of information. Quantum logic gates and quantum algorithms are also discussed as instances of the improvement in information processing by a quantum computer. We provide finally some examples of current experimental
Quantum Foundations in the Light of Quantum Information
 PROCEEDINGS OF THE NATO ADVANCED RESEARCH WORKSHOP, MYKONOS GREECE
, 2001
"... In this paper, I try to cause some goodnatured trouble. The issue at stake is when will we ever stop burdening the taxpayer with conferences and workshops devoted— explicitly or implicitly—to the quantum foundations? The suspicion is expressed that no end will be in sight until a means is found to ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
In this paper, I try to cause some goodnatured trouble. The issue at stake is when will we ever stop burdening the taxpayer with conferences and workshops devoted— explicitly or implicitly—to the quantum foundations? The suspicion is expressed that no end will be in sight until a means is found to reduce quantum theory to two or three statements of crisp physical (rather than abstract, axiomatic) significance. In this regard, no tool appears to be better calibrated for a direct assault than quantum information theory. Far from being a strained application of the latest fad to a deepseated problem, this method holds promise precisely because a large part (but not all) of the structure of quantum theory has always concerned information. It is just that the physics community has somehow forgotten this.
Interpreting the Quantum
, 1997
"... This paper is a commentary on the foundational significance of the CliftonBubHalvorson theorem characterizing quantum theory in terms of three informationtheoretic constraints. I argue that: (1) a quantum theory is best understood as a theory about the possibilities and impossibilities of informa ..."
Abstract

Cited by 17 (1 self)
 Add to MetaCart
This paper is a commentary on the foundational significance of the CliftonBubHalvorson theorem characterizing quantum theory in terms of three informationtheoretic constraints. I argue that: (1) a quantum theory is best understood as a theory about the possibilities and impossibilities of information transfer, as opposed to a theory about the mechanics of nonclassical waves or particles, (2) given the informationtheoretic constraints, any mechanical theory of quantum phenomena that includes an account of the measuring instruments that reveal these phenomena must be empirically equivalent to a quantum theory, and (3) assuming the informationtheoretic constraints are in fact satisfied in our world, no mechanical theory of quantum phenomena that includes an account of measurement interactions can be acceptable, and the appropriate aim of physics at the fundamental level then becomes the representation and manipulation of information.
Linking classical and quantum key agreement: is there \bound information
 Algorithmica
, 2000
"... Abstract. After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Abstract. After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We show that the limits of tolerable noise are identical for classical and quantum protocols in many cases. More specifically, we prove that a quantum state between two parties is entangled if and only if the classical random variables resulting from optimal measurements provide some mutual classical information between the parties. In addition, we present evidence which strongly suggests that the potentials of classical and of quantum protocols are equal in every situation. An important consequence, in the purely classical regime, of such a correspondence would be the existence of a classical counterpart of socalled bound entanglement, namely “bound information” that cannot be used for generating a secret key by any protocol. This stands in sharp contrast to what was previously believed. Keywords. Secretkey agreement, intrinsic information, secretkey rate, quantum privacy amplification, purification, entanglement. 1