Single-Step Quantum Search Using Problem Structure

The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem properties. The structure of random k-SAT allows determining the asymptotic average behavior of these algorithms, showing they improve on quantum algorithms, such as amplitude amplification, that ignore detailed problem structure but remain exponential for hard problem instances. Compared to good classical methods, the algorithm performs better, on average, for weakly and highly constrained problems but worse for hard cases. The analytic techniques introduced here also apply to other quantum algorithms, supplementing the limited evaluation possible with classical simulations and showing how quantum computing can use ensemble properties of NP search problems.Comment: 39 pages, 12 figures. Revision describes further improvement with multiple steps (section 7). See also http://www.parc.xerox.com/dynamics/www/quantum.htm

Probing the Role of the Barrier Layer in Magnetic Tunnel Junction Transport

Magnetic tunnel junctions with a ferrimagnetic barrier layer have been studied to understand the role of the barrier layer in the tunneling process - a factor that has been largely overlooked until recently. Epitaxial oxide junctions of highly spin polarized La0.7Sr0.3MnO3 and Fe3O4 electrodes with magnetic NiMn2O4 (NMO) insulating barrier layers provide a magnetic tunnel junction system in which we can probe the effect of the barrier by comparing junction behavior above and below the Curie temperature of the barrier layer. When the barrier is paramagnetic, the spin polarized transport is dominated by interface scattering and surface spin waves; however, when the barrier is ferrimagnetic, spin flip scattering due to spin waves within the NMO barrier dominates the transport.Comment: 10 pages, 3 figure

Landscape of solutions in constraint satisfaction problems

We present a theoretical framework for characterizing the geometrical properties of the space of solutions in constraint satisfaction problems, together with practical algorithms for studying this structure on particular instances. We apply our method to the coloring problem, for which we obtain the total number of solutions and analyze in detail the distribution of distances between solutions.Comment: 4 pages, 4 figures. Replaced with published versio

Performance of an environmental test to detect Mycobacterium bovis infection in badger social groups

A study by Courtenay and others (2006) demonstrated that the probability of detecting Mycobacterium bovis by PCR in soil samples from the spoil heaps of main badger setts correlated with the prevalence of excretion (infectiousness) of captured badgers belonging to the social group. It has been proposed that such a test could be used to target badger culling to setts containing infectious animals (Anon 2007). This short communication discusses the issues surrounding this concept, with the intention of dispelling any misconceptions among relevant stakeholders (farmers, policy makers and conservationists)

Life at the extreme: Lessons from the genome

© 2012 BioMed Central Ltd. Extremophile plants thrive in places where most plant species cannot survive. Recent developments in high-throughput technologies and comparative genomics are shedding light on the evolutionary mechanisms leading to their adaptation

The Peculiar Phase Structure of Random Graph Bisection

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over sparse random graphs, the phase structure of the graph bisection problem displays certain familiar properties, but also some surprises. It is known that when the mean degree is below the critical value of 2 log 2, the cutsize is zero with high probability. We study how the minimum cutsize increases with mean degree above this critical threshold, finding a new analytical upper bound that improves considerably upon previous bounds. Combined with recent results on expander graphs, our bound suggests the unusual scenario that random graph bisection is replica symmetric up to and beyond the critical threshold, with a replica symmetry breaking transition possibly taking place above the threshold. An intriguing algorithmic consequence is that although the problem is NP-hard, we can find near-optimal cutsizes (whose ratio to the optimal value approaches 1 asymptotically) in polynomial time for typical instances near the phase transition.Comment: substantially revised section 2, changed figures 3, 4 and 6, made minor stylistic changes and added reference

NASA space station automation: AI-based technology review. Executive summary

Research and Development projects in automation technology for the Space Station are described. Artificial Intelligence (AI) based technologies are planned to enhance crew safety through reduced need for EVA, increase crew productivity through the reduction of routine operations, increase space station autonomy, and augment space station capability through the use of teleoperation and robotics

Phase Transition in the Number Partitioning Problem

Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the pseudo-polynomiality of number partitioning. The phase diagram and the value of the typical ground state energy are calculated.Comment: minor changes (references, typos and discussion of results