Classical computation with quantum systems

As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it, becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed.is operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian. with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the subsystem.,, in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for in analysis of the static properties of quantum sub-systems.

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy {\em churn} (i.e., nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a {\em constant} degree graph with {\em high expansion} even under {\em continuous high adversarial} churn. Our protocol can tolerate a churn rate of up to $O(n/\poly\log(n))$ per round (where $n$ is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only $O(\poly\log(n))$ overhead for topology maintenance: only polylogarithmic (in $n$) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.

Measurement of oxygen storage capacity in automotive catalysts

There is considerable disagreement in the literature on available oxygen storage capacity, and on the reaction rates associated with the storage process, for three-way automotive catalysts. This paper seeks to address the issue of oxygen storage capacity in a clear and precise manner. The work described involved a detailed investigation of oxygen storage capacity in typical samples of automotive catalysts. The capacity has also been precisely defined and estimates have been made of the specific capacity based on catalyst dimensions. A purpose-built miniature catalyst test rig has been assembled to allow measurement of the capacity and the experimental procedure has been developed to ensure accurate measurement. The measurements from the first series of experiments have been compared with the theoretical calculations and good agreement is seen. A second series of experiments allowed the effect of temperature on oxygen storage capacity to be investigated. This work shows very clearly the large variation of the capacity with temperature.

Influence of plasticizer type and storage conditions on properties of poly(methyl vinyl ether-co-maleic anhydride) bioadhesive films

Poly(methyl vinyl ether-co-maleic anhydride) formed films from aqueous formulations with characteristics that are ideal as a basis for producing a drug-containing bioadhesive delivery system when plasticized with a monohydroxyl functionalized plasticizer. Hence, films containing a novel plasticizer, tripropylene glycol methyl ether (TPME), maintained their adhesive strength and tensile properties when packaged in aluminized foil for extended periods of time. Films plasticized with commonly used polyhydric alcohols, such as the glycerol in this study, underwent an esterification reaction that led to polymer crosslinking, as shown in NMR studies. These revealed the presence of peaks in the ester/carbonyl region, suggesting that glyceride residue formation had been initiated. Given the polyfunctional nature of glycerol, progressive esterification would result in a polyester network and an accompanying profound alteration in the physical characteristics. Indeed, films became brittle over time with a loss of both the aqueous solubility and bioadhesion to porcine skin. In addition, a swelling index was measurable after 7 days, a property not seen with those films containing TPME. This change in bioadhesive strength and pliability was independent of the packaging conditions, rendering the films that contain glycerol as unsuitable as a basis for topical bioadhesive delivery of drug substances. Consequently, films containing TPME have potential as an alternative formulation strategy.

BSP -Style Computation: A Semantic Investigation

A BSP (Bulk Synchronous Parallelism) computation is characterized by the generation of asynchronous messages in packages during independent execution of a number of processes and their subsequent delivery at synchronization points. Bundling messages together represents a significant departure from the traditional ‘one communication at a time’ approach. In this paper the semantic consequences of communication packaging are explored. In particular, the BSP communication structure is identified with a general form of substitution—predicate substitution. Predicate substitution provides a means of reasoning about the synchronized delivery of asynchronous communications when the immediate programming context does not explicitly refer to the variables that are to be updated (unlike traditional operations, such as the assignment $x := e$, where the names of the updated variables can be extracted from the context). Proofs of implementations of Newton's root finding method and prefix sum are used to illustrate the practical application of the proposed approach.

Efficient quantum computation using coherent states

We study universal quantum computation using optical coherent states. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.