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.

Teleportation with a uniformly accelerated partner

In this work, we give a description of the process of teleportation between Alice in an inertial frame, and Rob who is in uniform acceleration with respect to Alice. The fidelity of the teleportation is reduced due to Davies-Unruh radiation in Rob's frame. In so far as teleportation is a measure of entanglement, our results suggest that quantum entanglement is degraded in noninertial frames.

Development of a physical and genetic map of the virulent Wolbachia strain wMelPop

We report here the construction of a physical and genetic map of the virulent Wolbachia strain, wMelPop. This map was determined by ordering 28 chromosome fragments that resulted from digestion with the restriction endonucleases FseI, ApaI, SmaI, and AscI and were resolved by pulsed-field gel electrophoresis. Southern hybridization was done with 53 Wolbachia-specific genes as probes in order to determine the relative positions of these restriction fragments and use them to serve as markers. Comparison of the resulting map with the whole genome sequence of the closely related benign Wolbachia strain, wMel, shows that the two genomes are largely conserved in gene organization with the exception of a single inversion in the chromosome.

Impact of Commercial Search Engines and International Databases on Engineering Teaching and Research

For the last three decades, the engineering higher education and professional environments have been completely transformed by the "electronic/digital information revolution" that has included the introduction of personal computer, the development of email and world wide web, and broadband Internet connections at home. Herein the writer compares the performances of several digital tools with traditional library resources. While new specialised search engines and open access digital repositories may fill a gap between conventional search engines and traditional references, these should be not be confused with real libraries and international scientific databases that encompass textbooks and peer-reviewed scholarly works. An absence of listing in some Internet search listings, databases and repositories is not an indication of standing. Researchers, engineers and academics should remember these key differences in assessing the quality of bibliographic "research" based solely upon Internet searches.

Air Bubble Entrainment in Hydraulic Jumps: Physical Modelling and Scale Effects

A hydraulic jump is characterised by strong energy dissipation and air entrainment. In the present study, new air-water flow measurements were performed in hydraulic jumps with partially-developed flow conditions in relatively large-size facilities with phase-detection probes. The experiments were conducted with identical Froude numbers, but a range of Reynolds numbers and relative channel widths. The results showed drastic scale effects at small Reynolds numbers in terms of void fraction and bubble count rate distributions. The void fraction distributions implied comparatively greater detrainment at low Reynolds numbers leading to a lesser overall aeration of the jump roller, while dimensionless bubble count rates were drastically lower especially in the mixing layer. The experimental results suggested also that the relative channel width had little effect on the air-water flow properties for identical inflow Froude and Reynolds numbers.

Protein fold recognition without Boltzmann statistics or explicit physical basis

We present a fast method for finding optimal parameters for a low-resolution (threading) force field intended to distinguish correct from incorrect folds for a given protein sequence. In contrast to other methods, the parameterization uses information from >10(7) misfolded structures as well as a set of native sequence-structure pairs. In addition to testing the resulting force field's performance on the protein sequence threading problem, results are shown that characterize the number of parameters necessary for effective structure recognition.

New limits on the possible variation of physical constants

Recent detections of high-redshift absorption by both atomic hydrogen and molecular gas in the radio spectra of quasars have provided a powerful tool for measuring possible temporal and spatial variations of physical 'constants' in the Universe. We compare the frequency of high-redshift hydrogen 21-cm absorption with that of associated molecular absorption in two quasars to place new (1 sigma) upper limits on any variation in y = g(p) alpha(2) (where alpha is the fine-structure constant, and g(p) is the proton g-factor) of \Delta y/y\ < 5 x 10(-6) at redshifts z = 0.25 and 0.68. These quasars are separated by a comoving distance of 3000 Mpc (for H-0=75 km s(-1) Mpc(-1) and q(0) = 0). We also derive limits on the time rates of change of \(g) over dot (p)/(g) over dot (p)\ < 1 x 10(-15) yr(-1) and \(alpha) over dot/(a) over dot\ < 5 x 10(-16) yr(-1) between the present epoch and z = 0.68, These limits are more than an order of magnitude smaller than previous results derived from highredshift measurements.

Measurement and state preparation via ion trap quantum computing

We investigate in detail the effects of a QND vibrational number measurement made on single ions in a recently proposed measurement scheme for the vibrational state of a register of ions in a linear rf trap [C. D'HELON and G. J. MILBURN, Phys Rev. A 54, 5141 (1996)]. The performance of a measurement shows some interesting patterns which are closely related to searching.

Expokit: A software package for computing matrix exponentials

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.