Quantum Mechanics helps in searching for a needle in a haystack

Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50%, any classical algorithm (whether deterministic or probabilistic) will need to access the database a minimum of O(N) times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) accesses to the database.Comment: Postscript, 4 pages. This is a modified version of the STOC paper (quant-ph/9605043) and is modified to make it more comprehensible to physicists. It appeared in Phys. Rev. Letters on July 14, 1997. (This paper was originally put out on quant-ph on June 13, 1997, the present version has some minor typographical changes

Observations of the J = 2→1 transitions of ¹²C¹⁶O and ¹²C¹⁸O towards galactic H II regions

Observations are reported of the J = 2→1 transitions of CO and 12C18O at 230 and 219 GHz respectively from a number of galactic sources. A map of the central 1/2° × 1/2° of the Orion A molecular cloud is presented. The spectra are interpreted to derive molecular densities and abundance ratios in the molecular clouds observed

Characterization of aerosol associated with enhanced small particle number concentrations in a suburban forested environment

Two elevated particle number/mass growth events associated with Aitken‐mode particles were observed during a sampling campaign (13–29 September 2004) at the Duke University Free‐Air CO2 Enrichment facility, a forested field site located in suburban central North Carolina. Aerosol growth rates between 1.2 and 4.9 nm hr−1 were observed, resulting in net increases in geometric mean diameter of 21 and 37 nm during events. Growth was dominated by addition of oxidized organic compounds. Campaign‐average aerosol mass concentrations measured by an Aerodyne quadrupole aerosol mass spectrometer (Q‐AMS) were 1.9 ± 1.6 (σ), 1.6 ± 1.9, 0.1 ± 0.1, and 0.4 ± 0.4 μg m−3 for organic mass (OM), sulfate, nitrate, and ammonium, respectively. These values represent 47%, 40%, 3%, and 10%, respectively, of the measured submicron aerosol mass. Based on Q‐AMS spectra, OM was apportioned to hydrocarbon‐like organic aerosol (HOA, likely representing primary organic aerosol) and two types of oxidized organic aerosol (OOA‐1 and OOA‐2), which constituted on average 6%, 58%, and 36%, respectively, of the apportioned OM. OOA‐1 probably represents aged, regional secondary organic aerosol (SOA), while OOA‐2 likely reflects less aged SOA. Organic aerosol characteristics associated with the events are compared to the campaign averages. Particularly in one event, the contribution of OOA‐2 to overall OM levels was enhanced, indicating the likelihood of less aged SOA formation. Statistical analyses investigate the relationships between HOA, OOA‐1, OOA‐2, other aerosol components, gas‐phase species, and meteorological data during the campaign and individual events. No single variable clearly controls the occurrence of a particle growth event

SAGA: A project to automate the management of software production systems

The project to automate the management of software production systems is described. The SAGA system is a software environment that is designed to support most of the software development activities that occur in a software lifecycle. The system can be configured to support specific software development applications using given programming languages, tools, and methodologies. Meta-tools are provided to ease configuration. Several major components of the SAGA system are completed to prototype form. The construction methods are described

Quantum computation with phase drift errors

We present results of numerical simulations of the evolution of an ion trap quantum computer made out of 18 ions which are subject to a sequence of nearly 15000 laser pulses in order to find the prime factors of N=15. We analyze the effect of random and systematic phase drift errors arising from inaccuracies in the laser pulses which induce over (under) rotation of the quantum state. Simple analytic estimates of the tolerance for the quality of driving pulses are presented. We examine the use of watchdog stabilization to partially correct phase drift errors concluding that, in the regime investigated, it is rather inefficient.Comment: 5 pages, RevTex, 2 figure

Exploration of factors driving incorporation of unnatural dNTPS into DNA by Klenow fragment (DNA polymerase I) and DNA polymerase α

In order to further understand how DNA polymerases discriminate against incorrect dNTPs, we synthesized two sets of dNTP analogues and tested them as substrates for DNA polymerase α (pol α) and Klenow fragment (exo(−)) of DNA polymerase I (Escherichia coli). One set of analogues was designed to test the importance of the electronic nature of the base. The bases consisted of a benzimidazole ring with one or two exocyclic substituent(s) that are either electron-donating (methyl and methoxy) or electron-withdrawing (trifluoromethyl and dinitro). Both pol α and Klenow fragment exhibit a remarkable inability to discriminate against these analogues as compared to their ability to discriminate against incorrect natural dNTPs. Neither polymerase shows any distinct electronic or steric preferences for analogue incorporation. The other set of analogues, designed to examine the importance of hydrophobicity in dNTP incorporation, consists of a set of four regioisomers of trifluoromethyl benzimidazole. Whereas pol α and Klenow fragment exhibited minimal discrimination against the 5- and 6-regioisomers, they discriminated much more effectively against the 4- and 7-regioisomers. Since all four of these analogues will have similar hydrophobicity and stacking ability, these data indicate that hydrophobicity and stacking ability alone cannot account for the inability of pol α and Klenow fragment to discriminate against unnatural bases. After incorporation, however, both sets of analogues were not efficiently elongated. These results suggest that factors other than hydrophobicity, sterics and electronics govern the incorporation of dNTPs into DNA by pol α and Klenow fragment

Perfect quantum error correction coding in 24 laser pulses

An efficient coding circuit is given for the perfect quantum error correction of a single qubit against arbitrary 1-qubit errors within a 5 qubit code. The circuit presented employs a double `classical' code, i.e., one for bit flips and one for phase shifts. An implementation of this coding circuit on an ion-trap quantum computer is described that requires 26 laser pulses. A further circuit is presented requiring only 24 laser pulses, making it an efficient protection scheme against arbitrary 1-qubit errors. In addition, the performance of two error correction schemes, one based on the quantum Zeno effect and the other using standard methods, is compared. The quantum Zeno error correction scheme is found to fail completely for a model of noise based on phase-diffusion.Comment: Replacement paper: Lost two laser pulses gained one author; added appendix with circuits easily implementable on an ion-trap compute

Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat

We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with moderate imperfections is able to simulate accurately the unstable chaotic classical dynamics for long times. The algorithm can be easily implemented on systems of a few qubits.Comment: revtex, 4 pages, 4 figure

Simulation of Many-Body Fermi Systems on a Universal Quantum Computer

We provide fast algorithms for simulating many body Fermi systems on a universal quantum computer. Both first and second quantized descriptions are considered, and the relative computational complexities are determined in each case. In order to accommodate fermions using a first quantized Hamiltonian, an efficient quantum algorithm for anti-symmetrization is given. Finally, a simulation of the Hubbard model is discussed in detail.Comment: Submitted 11/7/96 to Phys. Rev. Lett. 10 pages, 0 figure