Lower bounds on the complexity of simulating quantum gates

We give a simple proof of a formula for the minimal time required to simulate a two-qubit unitary operation using a fixed two-qubit Hamiltonian together with fast local unitaries. We also note that a related lower bound holds for arbitrary n-qubit gates.

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

Enzyme deactivation in fixed bed reactors with michaelis-menten kinetics

Rate expression for enzyme poisoning which are consistent with a Michaelis-Menten main reaction are used to analyze the performance of a fixed bed reactor containing immobilized enzyme. When enzyme deactivation results from the irreversible bonding of a product molecule to an existing substrate-enzyme complex, it is shown that minimum enzyme activity can occur in the interior of the bed, well away from the ends. This suggests that bed sectioning techniques may enable direct evaluation of fundamental poisoning mechanisms.

Fixed bed reactors with catalyst poisoning - first order kinetics.

The long performance of an isothermal fixed bed reactor undergoing catalyst poisoning is theoretically analyzed using the dispersion model. First order reaction with dth order deactivation is assumed and the model equations are solved by matched asymptotic expansions for large Peclet number. Simple closed-form solutions, uniformly valid in time, are obtained.

Vehicle and driver attributes affecting distance from the steering wheel in motor vehicles

The current study was designed to confirm that female drivers sit closer to the steering wheel than do male drivers and to investigate whether this expected difference in sitting position is attributable to differences in the physical dimensions of men and women. Driver body dimensions and multiple measures of sitting distance from the steering wheel were collected from a sample of 150 men and 150 women. The results confirmed that on average, women sit closer to the steering wheel than men do and that this difference is accounted for by variations in body dimensions, especially height. This result suggests that driver height may provide a good surrogate for sitting distance from the steering wheel when investigating the role of driver position in real-world crash outcomes. The potential applications of this research include change to vehicle design that allows independent adjustment of the relative distance among the driver's seat, the steering wheel, and the floor pedals.

Effect of hardness on three very different forms of wear

Different abrasive wear tests have been applied to materials with hardnesses ranging from 80 HV (aluminium) to 1700 HV (tungsten carbide). The tests were: dry sand rubber wheel (DSRbrW); a similar test using a steel wheel (DSStlW); a new combined impact-abrasion test (FIA). The DSRbrW results were as expected, giving generally decreasing wear with increasing hardness. White cast irons and tool steels containing coarse, hard carbide particles performed better than more homogeneous materials of comparable hardness. When normalized to load and distance, the DSStlW results for the homogeneous materials were similar to the DSRbrW results. The multi-phase materials performed poorly in the DSStlW test, with volume loss for high-speed steel (880 HV) higher than that of aluminium. Within this group, wear increased with increasing hardness. These unexpected results are explained in terms of (a) differential friction coefficients of wheel and specimen, (b) increased fracture of sand, and (c) introduction of microfracture wear mechanisms. The FIA combined impact-abrasion results lacked clear correlations with hardness. The span of relative wear rates was similar to that reported for materials in ball mills. White cast irons at maximum hardness performed fairly poorly and showed evidence of microfracture. (C) 1997 Elsevier Science S.A.

The metamorphosis of lambda-fold 4-wheel systems into lambda-fold 4-cycle systems

A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.

Fixed point theorems of upper semicontinuous multivalued mappings with applications in hyperconvex metric spaces

In the present paper, we establish two fixed point theorems for upper semicontinuous multivalued mappings in hyperconvex metric spaces and apply these to study coincidence point problems and minimax problems. (C) 2002 Elsevier Science (USA). All rights reserved.

Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit Hamiltonian and local unitary operations. It follows that universal quantum computation can be performed using any entangling interaction and local unitary operations.

Nondeterministic gates for photonic single-rail quantum logic

We discuss techniques for producing, manipulating, and measuring qubits encoded optically as vacuum- and single-photon states. We show that a universal set of nondeterministic gates can be constructed using linear optics and photon counting. We investigate the efficacy of a test gate given realistic detector efficiencies.

A uniform white-noise model for fixed-point roundoff errors in digital systems

Fixed-point roundoff noise in digital implementation of linear systems arises due to overflow, quantization of coefficients and input signals, and arithmetical errors. In uniform white-noise models, the last two types of roundoff errors are regarded as uniformly distributed independent random vectors on cubes of suitable size. For input signal quantization errors, the heuristic model is justified by a quantization theorem, which cannot be directly applied to arithmetical errors due to the complicated input-dependence of errors. The complete uniform white-noise model is shown to be valid in the sense of weak convergence of probabilistic measures as the lattice step tends to zero if the matrices of realization of the system in the state space satisfy certain nonresonance conditions and the finite-dimensional distributions of the input signal are absolutely continuous.