Results 1  10
of
18
Why the Quantum?
, 2004
"... 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 19 (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.
The quantum bit commitment theorem
 Foundations of Physics 31: 735–756
, 2001
"... Unconditionally secure twoparty bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The qua ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
(Show Context)
Unconditionally secure twoparty bit commitment based solely on the principles of quantum mechanics (without exploiting special relativistic signalling constraints, or principles of general relativity or thermodynamics) has been shown to be impossible, but the claim is repeatedly challenged. The quantum bit commitment theorem is reviewed here and the central conceptual point, that an ``Einstein Podolsky Rosen' ' attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. There is, indeed, no loophole in the theorem. 1.
Quantum Mechanics is About Quantum Information
, 2005
"... I argue that quantum mechanics is fundamentally a theory about the representation and manipulation of information, not a theory about the mechanics of nonclassical waves or particles. The notion of quantum information is to be understood as a new physical primitive—just as, following Einstein’s spec ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
I argue that quantum mechanics is fundamentally a theory about the representation and manipulation of information, not a theory about the mechanics of nonclassical waves or particles. The notion of quantum information is to be understood as a new physical primitive—just as, following Einstein’s special theory of relativity, a field is no longer regarded as the physical manifestation of vibrations in a mechanical medium, but recognized as a new physical entity in its own right.
Quantum information and computation
 arXiv:quantph/0512125. Forthcoming in Butterfield and Earman (eds.) Handbook of Philosophy of Physics
, 2005
"... This Chapter deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum communication, quantum cryptography, and quantum computation, ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
This Chapter deals with theoretical developments in the subject of quantum information and quantum computation, and includes an overview of classical information and some relevant quantum mechanics. The discussion covers topics in quantum communication, quantum cryptography, and quantum computation, and concludes by considering whether a perspective in terms of quantum information
Punchscan with Independent Ballot Sheets: Simplifying Ballot Printing and Distribution with Independently Selected Ballot Halves (extended abstract)
"... We propose and implement a modification to the Punchscan protocol that simplifies ballot printing and distribution. In this improved version, each voter creates a ballot at the polling location by combining independently selected ballot halves, rather than using two preselected halves with the same ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
We propose and implement a modification to the Punchscan protocol that simplifies ballot printing and distribution. In this improved version, each voter creates a ballot at the polling location by combining independently selected ballot halves, rather than using two preselected halves with the same serial number. The only time a ballot used for voting is humanreadable is when it is in the voter’s hands, reducing possible opportunities to violate voter privacy. This small but nontrivial change lets election officials print and distribute ballots using multiple printers more easily, without giving any one printer the ability to compromise voter privacy with certainty.
InformationTheoretically Secure Voting Without an Honest Majority
"... Abstract. We present three voting protocols with unconditional privacy and informationtheoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present three voting protocols with unconditional privacy and informationtheoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. Privacy of the ballot is unconditional, but any voter can cause the protocol to fail, in which case information about the tally may nevertheless transpire. Our second protocol introduces voting authorities which allow the implementation of the first protocol, while reducing the interaction and limiting it to be only between voters and authorities and among the authorities themselves. The simultaneous broadcast is also limited to the authorities. As long as a single authority is honest, the privacy is unconditional, however, a single corrupt authority or a single corrupt voter can cause the protocol to fail. Our final protocol provides a safeguard against corrupt voters by enabling a verification technique to allow the authorities to revoke incorrect votes. We also discuss the implementation of a simultaneous broadcast channel with the use of temporary computational assumptions, yielding versions of our protocols achieving everlasting security.
1 Private information via the Unruh effect
, 807
"... Abstract — In a relativistic theory of quantum information, the possible presence of horizons is a complicating feature placing restrictions on the transmission and retrieval of information. We consider two inertial participants communicating via a noiseless qubit channel in the presence of a unifor ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — In a relativistic theory of quantum information, the possible presence of horizons is a complicating feature placing restrictions on the transmission and retrieval of information. We consider two inertial participants communicating via a noiseless qubit channel in the presence of a uniformly accelerated eavesdropper. Owing to the Unruh effect, the eavesdropper’s view of any encoded information is noisy, a feature the two inertial participants can exploit to achieve perfectly secure quantum communication. We show that the associated private quantum capacity is equal to the entanglementassisted quantum capacity for the channel to the eavesdropper’s environment, which we evaluate for all accelerations. Quantum information theory for the most part assumes that the senders, receivers and eavesdroppers involved in a protocol share an inertial frame. For many of the applications
Unconditionally Secure Quantum Bit Commitment Really Is Impossible
, 2000
"... Unconditionally secure quantum bit commitment has been shown to be impossible by Mayers [22] and Lo and Chau [18, 19], but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an ”EinsteinPodolskyRosen ’ attack or cheating strategy ..."
Abstract
 Add to MetaCart
(Show Context)
Unconditionally secure quantum bit commitment has been shown to be impossible by Mayers [22] and Lo and Chau [18, 19], but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an ”EinsteinPodolskyRosen ’ attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. PACS numbers: 03.67.a, 03.67.Dd, 89.70.+c 1
Unconditionally Secure (Nonrelativistic) Quantum Bit Commitment Really Is Impossible
, 2000
"... Unconditionally secure (nonrelativistic) quantum bit commitment has been shown to be impossible by Mayers [23] and Lo and Chau [19, 20], but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an ‘EinsteinPodolskyRosen ’ attack or ..."
Abstract
 Add to MetaCart
(Show Context)
Unconditionally secure (nonrelativistic) quantum bit commitment has been shown to be impossible by Mayers [23] and Lo and Chau [19, 20], but the claim is repeatedly challenged. The bit commitment theorem is reviewed here and the central conceptual point, that an ‘EinsteinPodolskyRosen ’ attack or cheating strategy can always be applied, is clarified. The question of whether following such a cheating strategy can ever be disadvantageous to the cheater is considered and answered in the negative. PACS numbers: 03.67.a, 03.67.Dd, 89.70.+c 1
Quantum Cryptography: A Survey
, 2005
"... We survey some results in quantum cryptography. After a brief introduction to classical cryptography, we provide the quantummechanical background needed to present some fundamental protocols from quantum cryptography. In particular, we review quantum key distribution via the BB84 protocol and its s ..."
Abstract
 Add to MetaCart
(Show Context)
We survey some results in quantum cryptography. After a brief introduction to classical cryptography, we provide the quantummechanical background needed to present some fundamental protocols from quantum cryptography. In particular, we review quantum key distribution via the BB84 protocol and its security proof, as well as the related quantum bit commitment protocol and its proof of insecurity.