Quantum Computing with an 'Always On' Heisenberg Interaction

Many promising ideas for quantum computing demand the experimental ability to directly switch 'on' and 'off' a physical coupling between the component qubits. This is typically the key difficulty in implementation, and precludes quantum computation in generic solid state systems, where interactions between the constituents are 'always on'. Here we show that quantum computation is possible in strongly coupled (Heisenberg) systems even when the interaction cannot be controlled. The modest ability of 'tuning' the transition energies of individual qubits proves to be sufficient, with a suitable encoding of the logical qubits, to generate universal quantum gates. Furthermore, by tuning the qubits collectively we provide a scheme with exceptional experimental simplicity: computations are controlled via a single 'switch' of only six settings. Our schemes are applicable to a wide range of physical implementations, from excitons and spins in quantum dots through to bulk magnets.Comment: 4 pages, 3 figs, 2 column format. To appear in PR

X-ray Studies of Two Neutron Stars in 47 Tucanae: Toward Constraints on the Equation of State

We report spectral and variability analysis of two quiescent low mass X-ray binaries (X5 and X7, previously detected with the ROSAT HRI) in a Chandra ACIS-I observation of the globular cluster 47 Tuc. X5 demonstrates sharp eclipses with an 8.666+-0.01 hr period, as well as dips showing an increased N_H column. The thermal spectra of X5 and X7 are well-modeled by unmagnetized hydrogen atmospheres of hot neutron stars. No hard power law component is required. A possible edge or absorption feature is identified near 0.64 keV, perhaps an OV edge from a hot wind. Spectral fits imply that X7 is significantly more massive than the canonical 1.4 \Msun neutron star mass, with M>1.8 \Msun for a radius range of 9-14 km, while X5's spectrum is consistent with a neutron star of mass 1.4 \Msun for the same radius range. Alternatively, if much of the X-ray luminosity is due to continuing accretion onto the neutron star surface, the feature may be the 0.87 keV rest-frame absorption complex (O VIII & other metal lines) intrinsic to the neutron star atmosphere, and a mass of 1.4 \Msun for X7 may be allowed.Comment: 16 pages, 7 figures, accepted by Ap

Towards practical classical processing for the surface code: timing analysis

Topological quantum error correction codes have high thresholds and are well suited to physical implementation. The minimum weight perfect matching algorithm can be used to efficiently handle errors in such codes. We perform a timing analysis of our current implementation of the minimum weight perfect matching algorithm. Our implementation performs the classical processing associated with an nxn lattice of qubits realizing a square surface code storing a single logical qubit of information in a fault-tolerant manner. We empirically demonstrate that our implementation requires only O(n^2) average time per round of error correction for code distances ranging from 4 to 512 and a range of depolarizing error rates. We also describe tests we have performed to verify that it always obtains a true minimum weight perfect matching.Comment: 13 pages, 13 figures, version accepted for publicatio

Climate Ready Estuaries - COAST in Action: 2012 Projects from Maine and New Hampshire

In summer 2011 the US EPA’s Climate Ready Estuaries program awarded funds to the Casco Bay Estuary Partnership (CBEP) in Portland, Maine, and the Piscataqua Region Estuaries Partnership (PREP) in coastal New Hampshire, to further develop and use COAST (COastal Adaptation to Sea level rise Tool) in their sea level rise adaptation planning processes. The New England Environmental Finance Center worked with municipal staff, elected officials, and other stakeholders to select specific locations, vulnerable assets, and adaptation actions to model using COAST. The EFC then collected the appropriate base data layers, ran the COAST simulations, and provided visual, numeric, and presentation-based products in support of the planning processes underway in both locations. These products helped galvanize support for the adaptation planning efforts. Through facilitated meetings they also led to stakeholders identifying specific action steps and begin to determine how to implement them

The effect of treatment on pathogen virulence.

The optimal virulence of a pathogen is determined by a trade-off between maximizing the rate of transmission and maximizing the duration of infectivity. Treatment measures such as curative therapy and case isolation exert selective pressure by reducing the duration of infectivity, reducing the value of duration-increasing strategies to the pathogen and favoring pathogen strategies that maximize the rate of transmission. We extend the trade-off models of previous authors, and represents the reproduction number of the pathogen as a function of the transmissibility, host contact rate, disease-induced mortality, recovery rate, and treatment rate, each of which may be influenced by the virulence. We find that when virulence is subject to a transmissibility-mortality trade-off, treatment can lead to an increase in optimal virulence, but that in other scenarios (such as the activity-recovery trade-off) treatment decreases the optimal virulence. Paradoxically, when levels of treatment rise with pathogen virulence, increasing control efforts may raise predicted levels of optimal virulence. Thus we show that conflict can arise between the epidemiological benefits of treatment and the evolutionary risks of heightened virulence

Sail On Ceylon Moon

https://digitalcommons.library.umaine.edu/mmb-vp/6701/thumbnail.jp

A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors

We describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algorithm to specific problems are considered, and we find that classically intractable and interesting problems from atomic physics may be solved with between 50 and 100 quantum bits.Comment: 10 page