150,629 research outputs found
Communication Complexity and Intrinsic Universality in Cellular Automata
The notions of universality and completeness are central in the theories of
computation and computational complexity. However, proving lower bounds and
necessary conditions remains hard in most of the cases. In this article, we
introduce necessary conditions for a cellular automaton to be "universal",
according to a precise notion of simulation, related both to the dynamics of
cellular automata and to their computational power. This notion of simulation
relies on simple operations of space-time rescaling and it is intrinsic to the
model of cellular automata. Intrinsinc universality, the derived notion, is
stronger than Turing universality, but more uniform, and easier to define and
study. Our approach builds upon the notion of communication complexity, which
was primarily designed to study parallel programs, and thus is, as we show in
this article, particulary well suited to the study of cellular automata: it
allowed to show, by studying natural problems on the dynamics of cellular
automata, that several classes of cellular automata, as well as many natural
(elementary) examples, could not be intrinsically universal
Two-Loop g -> gg Splitting Amplitudes in QCD
Splitting amplitudes are universal functions governing the collinear behavior
of scattering amplitudes for massless particles. We compute the two-loop g ->
gg splitting amplitudes in QCD, N=1, and N=4 super-Yang-Mills theories, which
describe the limits of two-loop n-point amplitudes where two gluon momenta
become parallel. They also represent an ingredient in a direct x-space
computation of DGLAP evolution kernels at next-to-next-to-leading order. To
obtain the splitting amplitudes, we use the unitarity sewing method. In
contrast to the usual light-cone gauge treatment, our calculation does not rely
on the principal-value or Mandelstam-Leibbrandt prescriptions, even though the
loop integrals contain some of the denominators typically encountered in
light-cone gauge. We reduce the integrals to a set of 13 master integrals using
integration-by-parts and Lorentz invariance identities. The master integrals
are computed with the aid of differential equations in the splitting momentum
fraction z. The epsilon-poles of the splitting amplitudes are consistent with a
formula due to Catani for the infrared singularities of two-loop scattering
amplitudes. This consistency essentially provides an inductive proof of
Catani's formula, as well as an ansatz for previously-unknown 1/epsilon pole
terms having non-trivial color structure. Finite terms in the splitting
amplitudes determine the collinear behavior of finite remainders in this
formula.Comment: 100 pages, 33 figures. Added remarks about leading-transcendentality
argument of hep-th/0404092, and additional explanation of cut-reconstruction
uniquenes
A speculative execution approach to provide semantically aware contention management for concurrent systems
PhD ThesisMost modern platforms offer ample potention for parallel execution of concurrent programs yet concurrency control is required to exploit parallelism while maintaining program correctness. Pessimistic con-
currency control featuring blocking synchronization and mutual ex-
clusion, has given way to transactional memory, which allows the
composition of concurrent code in a manner more intuitive for the
application programmer. An important component in any transactional memory technique however is the policy for resolving conflicts
on shared data, commonly referred to as the contention management
policy.
In this thesis, a Universal Construction is described which provides
contention management for software transactional memory. The technique differs from existing approaches given that multiple execution
paths are explored speculatively and in parallel. In the resolution of
conflicts by state space exploration, we demonstrate that both concur-
rent conflicts and semantic conflicts can be solved, promoting multi-
threaded program progression.
We de ne a model of computation called Many Systems, which defines the execution of concurrent threads as a state space management
problem. An implementation is then presented based on concepts
from the model, and we extend the implementation to incorporate
nested transactions. Results are provided which compare the performance of our approach with an established contention management
policy, under varying degrees of concurrent and semantic conflicts. Finally, we provide performance results from a number of search strategies, when nested transactions are introduced
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
A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton
We describe a simple n-dimensional quantum cellular automaton (QCA) capable
of simulating all others, in that the initial configuration and the forward
evolution of any n-dimensional QCA can be encoded within the initial
configuration of the intrinsically universal QCA. Several steps of the
intrinsically universal QCA then correspond to one step of the simulated QCA.
The simulation preserves the topology in the sense that each cell of the
simulated QCA is encoded as a group of adjacent cells in the universal QCA.Comment: 13 pages, 7 figures. In Proceedings of the 4th International
Conference on Language and Automata Theory and Applications (LATA 2010),
Lecture Notes in Computer Science (LNCS). Journal version: arXiv:0907.382
Universal Quantum Computation through Control of Spin-Orbit Coupling
We propose a method for quantum computation which uses control of spin-orbit
coupling in a linear array of single electron quantum dots. Quantum gates are
carried out by pulsing the exchange interaction between neighboring electron
spins, including the anisotropic corrections due to spin-orbit coupling.
Control over these corrections, even if limited, is sufficient for universal
quantum computation over qubits encoded into pairs of electron spins. The
number of voltage pulses required to carry out either single qubit rotations or
controlled-Not gates scales as the inverse of a dimensionless measure of the
degree of control of spin-orbit coupling.Comment: 4 pages, 3 figures (minor revision, references added
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture
One of the major open problems in complexity theory is proving super-polynomial lower bounds for circuits with logarithmic depth (i.e., P ̸ ⊆ NC1). This problem is interesting for two reasons: first, it is tightly related to understanding the power of parallel computation and of small-space computation; second, it is one of the first milestones toward proving superpolynomial circuit lower bounds. Karchmer, Raz, and Wigderson [KRW95] suggested to approach this problem by proving the following conjecture: given two boolean functions f and g, the depth complexity of the composed function g ◦ f is roughly the sum of the depth complexities of f and g. They showed that the validity of this conjecture would imply that P ̸ ⊆ NC1. As a starting point for studying the composition of functions, they introduced a relation called “the universal relation”, and suggested to study the composition of universal relations. This suggestion proved fruitful, and an analogue of the KRW conjecture for the universal relation was proved by Edmonds et. al. [EIRS01]. An alternative proof was given later by H˚astad and Wigderson [HW93]. However, studying the composition of functions seems more difficult, and the KRW conjecture is still wide open. In this work, we make a natural step in this direction, which lies between what is known and the original conjecture: we show that an analogue of the conjecture holds for the composition of a function with a universal relation. We also suggest a candidate for the next step and provide initial results toward it. Our main technical contribution is developing an approach based on the notion of information complexity for analyzing KW relations – communication problems that are closely related to questions on circuit depth and formula complexity. Recently, information complexity has proved to be a powerful tool, and underlined some major progress on several long-standing open problems in communication complexity. In this work, we develop general tools for analyzing the information complexity of KW relations, which may be of independent interest.
- …