Symbolic dynamics I. Finite dispersive billiards

Orbits in different dispersive billiard systems, e.g. the 3 disk system, are mapped into a topological well ordered symbol plane and it is showed that forbidden and allowed orbits are separated by a monotone pruning front. The pruning front can be approximated by a sequence of finite symbolic dynamics grammars.Comment: CYCLER Paper 93Jan00

Direct Fidelity Estimation from Few Pauli Measurements

We describe a simple method for certifying that an experimental device prepares a desired quantum state ρ. Our method is applicable to any pure state ρ, and it provides an estimate of the fidelity between ρ and the actual (arbitrary) state in the lab, up to a constant additive error. The method requires measuring only a constant number of Pauli expectation values, selected at random according to an importance-weighting rule. Our method is faster than full tomography by a factor of d, the dimension of the state space, and extends easily and naturally to quantum channels

MPC for MPC: Secure Computation on a Massively Parallel Computing Architecture

Massively Parallel Computation (MPC) is a model of computation widely believed to best capture realistic parallel computing architectures such as large-scale MapReduce and Hadoop clusters. Motivated by the fact that many data analytics tasks performed on these platforms involve sensitive user data, we initiate the theoretical exploration of how to leverage MPC architectures to enable efficient, privacy-preserving computation over massive data. Clearly if a computation task does not lend itself to an efficient implementation on MPC even without security, then we cannot hope to compute it efficiently on MPC with security. We show, on the other hand, that any task that can be efficiently computed on MPC can also be securely computed with comparable efficiency. Specifically, we show the following results: - any MPC algorithm can be compiled to a communication-oblivious counterpart while asymptotically preserving its round and space complexity, where communication-obliviousness ensures that any network intermediary observing the communication patterns learn no information about the secret inputs; - assuming the existence of Fully Homomorphic Encryption with a suitable notion of compactness and other standard cryptographic assumptions, any MPC algorithm can be compiled to a secure counterpart that defends against an adversary who controls not only intermediate network routers but additionally up to 1/3 - ? fraction of machines (for an arbitrarily small constant ?) - moreover, this compilation preserves the round complexity tightly, and preserves the space complexity upto a multiplicative security parameter related blowup. As an initial exploration of this important direction, our work suggests new definitions and proposes novel protocols that blend algorithmic and cryptographic techniques

Leptogenesis via Axion Oscillations after Inflation

Once a light axionlike scalar field couples to the electroweak gauge bosons, its classical motion during reheating induces an effective chemical potential for the fermion number. In the presence of rapid lepton number (L)-violating processes in the plasma, such a chemical potential provides a favorable opportunity for baryogenesis via leptogenesis. We are able to demonstrate that L violation due to the exchange of heavy Majorana neutrinos is sufficient for a successful realization of this idea. Our mechanism represents a novel and minimal alternative to thermal leptogenesis, which turns out to be insensitive to the masses and CP-violating phases in the heavy neutrino sector. It is consistent with heavy neutrino masses close to the scale of grand unification and, quite complementary to thermal leptogenesis, requires the reheating temperature to be at least of order 10^12 GeV.Comment: 6 pages, 2 figures; v2: slightly extended discussion, matches version published in PR