Coin Tossing is Strictly Weaker Than Bit Commitment

We define cryptographic assumptions applicable to two mistrustful parties who each control two or more separate secure sites between which special relativity guarantees a time lapse in communication. We show that, under these assumptions, unconditionally secure coin tossing can be carried out by exchanges of classical information. We show also, following Mayers, Lo and Chau, that unconditionally secure bit commitment cannot be carried out by finitely many exchanges of classical or quantum information. Finally we show that, under standard cryptographic assumptions, coin tossing is strictly weaker than bit commitment. That is, no secure classical or quantum bit commitment protocol can be built from a finite number of invocations of a secure coin tossing black box together with finitely many additional information exchanges.Comment: Final version; to appear in Phys. Rev. Let

On the communication cost of entanglement transformations

We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when the amount of entanglement does not increase. Moreover, the bound applies even if the initial state is supplemented with unlimited entanglement in the form of EPR pairs, and the communication is allowed to be quantum mechanical. We then apply the method to the determination of the communication cost of asymptotic entanglement concentration and dilution. While concentration is known to require no communication whatsoever, the best known protocol for dilution, discovered by Lo and Popescu [Phys. Rev. Lett. 83(7):1459--1462, 1999], requires a number of bits to be exchanged which is of the order of the square root of the number of EPR pairs. Here we prove a matching lower bound of the same asymptotic order, demonstrating the optimality of the Lo-Popescu protocol up to a constant factor and establishing the existence of a fundamental asymmetry between the concentration and dilution tasks. We also discuss states for which the minimal communication cost is proportional to their entanglement, such as the states recently introduced in the context of ``embezzling entanglement'' [W. van Dam and P. Hayden, quant-ph/0201041].Comment: 9 pages, 1 figure. Added a reference and some further explanations. In v3 some arguments are given in more detai

Unconditionally Secure Bit Commitment

We describe a new classical bit commitment protocol based on cryptographic constraints imposed by special relativity. The protocol is unconditionally secure against classical or quantum attacks. It evades the no-go results of Mayers, Lo and Chau by requiring from Alice a sequence of communications, including a post-revelation verification, each of which is guaranteed to be independent of its predecessor.Comment: Typos corrected. Reference details added. To appear in Phys. Rev. Let

WARNING: Physics Envy May Be Hazardous To Your Wealth!

The quantitative aspirations of economists and financial analysts have for many years been based on the belief that it should be possible to build models of economic systems - and financial markets in particular - that are as predictive as those in physics. While this perspective has led to a number of important breakthroughs in economics, "physics envy" has also created a false sense of mathematical precision in some cases. We speculate on the origins of physics envy, and then describe an alternate perspective of economic behavior based on a new taxonomy of uncertainty. We illustrate the relevance of this taxonomy with two concrete examples: the classical harmonic oscillator with some new twists that make physics look more like economics, and a quantitative equity market-neutral strategy. We conclude by offering a new interpretation of tail events, proposing an "uncertainty checklist" with which our taxonomy can be implemented, and considering the role that quants played in the current financial crisis.Comment: v3 adds 2 reference

Maximally Entangled Mixed States and Conditional Entropies

The maximally entangled mixed states of Munro, James, White, and Kwiat [Phys. Rev. A {\bf 64} (2001) 030302] are shown to exhibit interesting features vis a vis conditional entropic measures. The same happens with the Ishizaka and Hiroshima states [Phys. Rev. A {\bf 62} 022310 (2000)], whose entanglement-degree can not be increased by acting on them with logic gates. Special types of entangled states that do not violate classical entropic inequalities are seen to exist in the space of two qubits. Special meaning can be assigned to the Munro {\it et al.} special participation ratio of 1.8

Triggering up states in all-to-all coupled neurons

Slow-wave sleep in mammalians is characterized by a change of large-scale cortical activity currently paraphrased as cortical Up/Down states. A recent experiment demonstrated a bistable collective behaviour in ferret slices, with the remarkable property that the Up states can be switched on and off with pulses, or excitations, of same polarity; whereby the effect of the second pulse significantly depends on the time interval between the pulses. Here we present a simple time discrete model of a neural network that exhibits this type of behaviour, as well as quantitatively reproduces the time-dependence found in the experiments.Comment: epl Europhysics Letters, accepted (2010

Experimental demonstration of phase-remapping attack in a practical quantum key distribution system

Unconditional security proofs of various quantum key distribution (QKD) protocols are built on idealized assumptions. One key assumption is: the sender (Alice) can prepare the required quantum states without errors. However, such an assumption may be violated in a practical QKD system. In this paper, we experimentally demonstrate a technically feasible "intercept-and-resend" attack that exploits such a security loophole in a commercial "plug & play" QKD system. The resulting quantum bit error rate is 19.7%, which is below the proven secure bound of 20.0% for the BB84 protocol. The attack we utilize is the phase-remapping attack (C.-H. F. Fung, et al., Phys. Rev. A, 75, 32314, 2007) proposed by our group.Comment: 16 pages, 6 figure

Security Analysis of an Untrusted Source for Quantum Key Distribution: Passive Approach

We present a passive approach to the security analysis of quantum key distribution (QKD) with an untrusted source. A complete proof of its unconditional security is also presented. This scheme has significant advantages in real-life implementations as it does not require fast optical switching or a quantum random number generator. The essential idea is to use a beam splitter to split each input pulse. We show that we can characterize the source using a cross-estimate technique without active routing of each pulse. We have derived analytical expressions for the passive estimation scheme. Moreover, using simulations, we have considered four real-life imperfections: Additional loss introduced by the "plug & play" structure, inefficiency of the intensity monitor, noise of the intensity monitor, and statistical fluctuation introduced by finite data size. Our simulation results show that the passive estimate of an untrusted source remains useful in practice, despite these four imperfections. Also, we have performed preliminary experiments, confirming the utility of our proposal in real-life applications. Our proposal makes it possible to implement the "plug & play" QKD with the security guaranteed, while keeping the implementation practical.Comment: 35 pages, 19 figures. Published Versio

Violations of local realism by two entangled quNits

Results obtained in two recent papers, \cite{Kaszlikowski} and \cite{Durt}, seem to indicate that the nonlocal character of the correlations between the outcomes of measurements performed on entangled systems separated in space is not robust in the presence of noise. This is surprising, since entanglement itself is robust. Here we revisit this problem and argue that the class of gedanken-experiments considered in \cite{Kaszlikowski} and \cite{Durt} is too restrictive. By considering a more general class, involving sequences of measurements, we prove that the nonlocal correlations are in fact robust.Comment: Reference added, 3 pages, accepted for publication in J. Phys. A: Math. and Genera