Variable Bias Coin Tossing

Alice is a charismatic quantum cryptographer who believes her parties are unmissable; Bob is a (relatively) glamorous string theorist who believes he is an indispensable guest. To prevent possibly traumatic collisions of self-perception and reality, their social code requires that decisions about invitation or acceptance be made via a cryptographically secure variable bias coin toss (VBCT). This generates a shared random bit by the toss of a coin whose bias is secretly chosen, within a stipulated range, by one of the parties; the other party learns only the random bit. Thus one party can secretly influence the outcome, while both can save face by blaming any negative decisions on bad luck. We describe here some cryptographic VBCT protocols whose security is guaranteed by quantum theory and the impossibility of superluminal signalling, setting our results in the context of a general discussion of secure two-party computation. We also briefly discuss other cryptographic applications of VBCT.Comment: 14 pages, minor correction

Microbial dynamics during various activities in residential areas of Lahore, Pakistan

Bioaerosols are ubiquitous in the atmosphere with their levels affected by a variety of environmental factors as well as type of activities being carried out at any specific time. The present study investigated how indoor activities influence bioaerosol concentrations in five residential houses of Lahore. Agar coated petri plates were exposed face upwards for twenty minutes in kitchens and living rooms during activity and non-activity periods. The temperature and relative humidity levels were noted as well. The bioaerosol concentrations in kitchens during the activity time ranged between 1022 to 4481 cfu/m3 and in living rooms from 1179 to 3183 cfu/m3 . Lower values were observed during non-activity periods. A paired-t test revealed a significant difference in bacterial loads during activity and non-activity times in both micro-environments (p = 0.038 in kitchen and p = 0.021 in living room). The predominant species identified were Micrococcus spp., Staphylococcus spp., and Bacillus spp. which are a common constituent of the indoor environment and are known to be opportunistic pathogens as well

A Two-Threshold Model for Scaling Laws of Non-Interacting Snow Avalanches

The sizes of snow slab failure that trigger snow avalanches are power-law distributed. Such a power-law probability distribution function has also been proposed to characterize different landslide types. In order to understand this scaling for gravity driven systems, we introduce a two-threshold 2-d cellular automaton, in which failure occurs irreversibly. Taking snow slab avalanches as a model system, we find that the sizes of the largest avalanches just preceeding the lattice system breakdown are power law distributed. By tuning the maximum value of the ratio of the two failure thresholds our model reproduces the range of power law exponents observed for land-, rock- or snow avalanches. We suggest this control parameter represents the material cohesion anisotropy.Comment: accepted PR

Tight bounds for classical and quantum coin flipping

Coin flipping is a cryptographic primitive for which strictly better protocols exist if the players are not only allowed to exchange classical, but also quantum messages. During the past few years, several results have appeared which give a tight bound on the range of implementable unconditionally secure coin flips, both in the classical as well as in the quantum setting and for both weak as well as strong coin flipping. But the picture is still incomplete: in the quantum setting, all results consider only protocols with perfect correctness, and in the classical setting tight bounds for strong coin flipping are still missing. We give a general definition of coin flipping which unifies the notion of strong and weak coin flipping (it contains both of them as special cases) and allows the honest players to abort with a certain probability. We give tight bounds on the achievable range of parameters both in the classical and in the quantum setting.Comment: 18 pages, 2 figures; v2: published versio

The Impossibility Of Secure Two-Party Classical Computation

We present attacks that show that unconditionally secure two-party classical computation is impossible for many classes of function. Our analysis applies to both quantum and relativistic protocols. We illustrate our results by showing the impossibility of oblivious transfer.Comment: 10 page

Causality - Complexity - Consistency: Can Space-Time Be Based on Logic and Computation?

The difficulty of explaining non-local correlations in a fixed causal structure sheds new light on the old debate on whether space and time are to be seen as fundamental. Refraining from assuming space-time as given a priori has a number of consequences. First, the usual definitions of randomness depend on a causal structure and turn meaningless. So motivated, we propose an intrinsic, physically motivated measure for the randomness of a string of bits: its length minus its normalized work value, a quantity we closely relate to its Kolmogorov complexity (the length of the shortest program making a universal Turing machine output this string). We test this alternative concept of randomness for the example of non-local correlations, and we end up with a reasoning that leads to similar conclusions as in, but is conceptually more direct than, the probabilistic view since only the outcomes of measurements that can actually all be carried out together are put into relation to each other. In the same context-free spirit, we connect the logical reversibility of an evolution to the second law of thermodynamics and the arrow of time. Refining this, we end up with a speculation on the emergence of a space-time structure on bit strings in terms of data-compressibility relations. Finally, we show that logical consistency, by which we replace the abandoned causality, it strictly weaker a constraint than the latter in the multi-party case.Comment: 17 pages, 16 figures, small correction

Inability of the entropy vector method to certify nonclassicality in linelike causal structures

Bell's theorem shows that our intuitive understanding of causation must be overturned in light of quantum correlations. Nevertheless, quantum mechanics does not permit signalling and hence a notion of cause remains. Understanding this notion is not only important at a fundamental level, but also for technological applications such as key distribution and randomness expansion. It has recently been shown that a useful way to decide which classical causal structures could give rise to a given set of correlations is to use entropy vectors. These are vectors whose components are the entropies of all subsets of the observed variables in the causal structure. The entropy vector method employs causal relationships among the variables to restrict the set of possible entropy vectors. Here, we consider whether the same approach can lead to useful certificates of non-classicality within a given causal structure. Surprisingly, we find that for a family of causal structures that include the usual bipartite Bell structure they do not. For all members of this family, no function of the entropies of the observed variables gives such a certificate, in spite of the existence of nonclassical correlations. It is therefore necessary to look beyond entropy vectors to understand cause from a quantum perspective.Comment: 5 pages + appendix, v2: added references, v3: new title, added journal referenc

No extension of quantum theory can have improved predictive power

According to quantum theory, measurements generate random outcomes, in stark contrast with classical mechanics. This raises the question of whether there could exist an extension of the theory which removes this indeterminism, as suspected by Einstein, Podolsky and Rosen (EPR). Although this has been shown to be impossible, existing results do not imply that the current theory is maximally informative. Here we ask the more general question of whether any improved predictions can be achieved by any extension of quantum theory. Under the assumption that measurements can be chosen freely, we answer this question in the negative: no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself. Our result has significance for the foundations of quantum mechanics, as well as applications to tasks that exploit the inherent randomness in quantum theory, such as quantum cryptography.Comment: 6 pages plus 7 of supplementary material, 3 figures. Title changed. Added discussion on Bell's notion of locality. FAQ answered at http://perimeterinstitute.ca/personal/rcolbeck/FAQ.htm

Entropic uncertainty relations for extremal unravelings of super-operators

A way to pose the entropic uncertainty principle for trace-preserving super-operators is presented. It is based on the notion of extremal unraveling of a super-operator. For given input state, different effects of each unraveling result in some probability distribution at the output. As it is shown, all Tsallis' entropies of positive order as well as some of Renyi's entropies of this distribution are minimized by the same unraveling of a super-operator. Entropic relations between a state ensemble and the generated density matrix are revisited in terms of both the adopted measures. Using Riesz's theorem, we obtain two uncertainty relations for any pair of generalized resolutions of the identity in terms of the Renyi and Tsallis entropies. The inequality with Renyi's entropies is an improvement of the previous one, whereas the inequality with Tsallis' entropies is a new relation of a general form. The latter formulation is explicitly shown for a pair of complementary observables in a $d$-level system and for the angle and the angular momentum. The derived general relations are immediately applied to extremal unravelings of two super-operators.Comment: 8 pages, one figure. More explanations are given for Eq. (2.19) and Example III.5. One reference is adde