A Graph Model for Imperative Computation

Scott's graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values. We consider a similar model based on relations whose input values are finite sequences rather than sets. This alteration means that we are taking into account the order in which observations are made. This new notion of graph gives rise to a model of affine lambda-calculus that admits an interpretation of imperative constructs including variable assignment, dereferencing and allocation. Extending this untyped model, we construct a category that provides a model of typed higher-order imperative computation with an affine type system. An appropriate language of this kind is Reynolds's Syntactic Control of Interference. Our model turns out to be fully abstract for this language. At a concrete level, it is the same as Reddy's object spaces model, which was the first "state-free" model of a higher-order imperative programming language and an important precursor of games models. The graph model can therefore be seen as a universal domain for Reddy's model

Smooth bumps, a Borel theorem and partitions of smooth functions on p.c.f. fractals

We provide two methods for constructing smooth bump functions and for smoothly cutting off smooth functions on fractals, one using a probabilistic approach and sub-Gaussian estimates for the heat operator, and the other using the analytic theory for p.c.f. fractals and a fixed point argument. The heat semigroup (probabilistic) method is applicable to a more general class of metric measure spaces with Laplacian, including certain infinitely ramified fractals, however the cut off technique involves some loss in smoothness. From the analytic approach we establish a Borel theorem for p.c.f. fractals, showing that to any prescribed jet at a junction point there is a smooth function with that jet. As a consequence we prove that on p.c.f. fractals smooth functions may be cut off with no loss of smoothness, and thus can be smoothly decomposed subordinate to an open cover. The latter result provides a replacement for classical partition of unity arguments in the p.c.f. fractal setting.Comment: 26 pages. May differ slightly from published (refereed) versio

Qubit relaxation from evanescent-wave Johnson noise

In many quantum computer architectures, the qubits are in close proximity to metallic device elements. Metals have a high density of photon modes, and the fields spill out of the bulk metal because of the evanescent-wave component. Thus thermal and quantum electromagnetic Johnson- type noise from metallic device elements can decohere nearby qubits. In this paper we use quantum electrodynamics to compute the strength of this evanescent-wave Johnson noise as a function of distance z from a metallic half-space. Previous treatments have shown unphysical divergences at z = 0. We remedy this by using a proper non-local dielectric function. Decoherence rates of local qubits are proportional to the magnitude of electric or magnetic correlation functions evaluated at the qubit position. We present formulas for the decoherence rates. These formulas serve as an important constraint on future device architectures.Comment: 5 pages, 4 figure