Impact of climate change and population growth on a risk assessment for endocrine disruption in fish due to steroid estrogens in England and Wales

In England and Wales, steroid estrogens: estrone, estradiol and ethinylestradiol have previously been identified as the main chemicals causing endocrine disruption in male fish. A national risk assessment is already available for intersex in fish arising from estrogens under current flow conditions. This study presents, to our knowledge, the first set of national catchment-based risk assessments for steroid estrogen under future scenarios. The river flows and temperatures were perturbed using three climate change scenarios (ranging from relatively dry to wet). The effects of demographic changes on estrogen consumption and human population served by sewage treatment works were also included. Compared to the current situation, the results indicated increased future risk:the percentage of high risk category sites, where endocrine disruption is more likely to occur, increased. These increases were mainly caused by changes in human population. This study provides regulators with valuable information to prepare for this potential increased risk

Effect of Host Plant on Parasitism of Helicoverpa armigera (Hübner) (Lepidoptera: Noctuidae) by Hyposoter didymator Thunberg (Hymenoptera: Ichneumonidae) and Cotesia kazak (Telenga) (Hymenoptera: Braconidae)

The effect of host plant on parasitism of second-instar Helicoverpa armigera by two introduced larval parasitoids, Hyposoter didymator and Cotesia kazak, was investigated in glasshouse experiments. Parasitism was lowest on chickpea (5.4% for H. didymator and 11.8% for C. kazak). Higher levels of parasitism (50.1-85.0% for H. didymator and 25.7-55.3% for C. kazak) were recorded on sorghum, sunflower, cotton, soybean and pigeonpea. This suggests that the parasitoids should be released against Helicoverpa spp. infestations on the major summer crops—sorghum, sunflower, cotton and soybean—rather than against the first spring generation infesting chickpea. Sorghum and sunflower are preferred release crops because parasitism levels are high and disruption by insecticide sprays is less likely

Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing

Quantum search algorithms are considered in the context of protein sequence comparison in biocomputing. Given a sample protein sequence of length m (i.e m residues), the problem considered is to find an optimal match in a large database containing N residues. Initially, Grover's quantum search algorithm is applied to a simple illustrative case - namely where the database forms a complete set of states over the 2^m basis states of a m qubit register, and thus is known to contain the exact sequence of interest. This example demonstrates explicitly the typical O(sqrt{N}) speedup on the classical O(N) requirements. An algorithm is then presented for the (more realistic) case where the database may contain repeat sequences, and may not necessarily contain an exact match to the sample sequence. In terms of minimizing the Hamming distance between the sample sequence and the database subsequences the algorithm finds an optimal alignment, in O(sqrt{N}) steps, by employing an extension of Grover's algorithm, due to Boyer, Brassard, Hoyer and Tapp for the case when the number of matches is not a priori known.Comment: LaTeX, 5 page

Universal simulation of Hamiltonian dynamics for qudits

What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling N-qubit Hamiltonian, and local unitaries. We extend this result to the case where the component systems have D dimensions. As a consequence we explain how universal quantum computation can be performed with any fixed two-body entangling N-qudit Hamiltonian, and local unitaries.Comment: 13 pages, an error in the "Pauli-Euclid-Gottesman Lemma" fixed, main results unchange

Implementation of a Deutsch-like quantum algorithm utilizing entanglement at the two-qubit level, on an NMR quantum information processor

We describe the experimental implementation of a recently proposed quantum algorithm involving quantum entanglement at the level of two qubits using NMR. The algorithm solves a generalisation of the Deutsch problem and distinguishes between even and odd functions using fewer function calls than is possible classically. The manipulation of entangled states of the two qubits is essential here, unlike the Deutsch-Jozsa algorithm and the Grover's search algorithm for two bits.Comment: 4 pages, two eps figure

Schemes for Parallel Quantum Computation Without Local Control of Qubits

Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally applied transformations. Here we demonstrate the minimum physical requirements for such an approach: a one-dimensional array composed of two alternating 'types' of two-state system. Each system need be sensitive only to the net state of its nearest neighbors, i.e. the number in state 1 minus the number in state 2. Additionally, we show that all such arrays can perform quite general parallel operations. A broad range of physical systems and interactions are suitable: we highlight two potential implementations.Comment: 12 pages + 3 figures. Several small corrections mad

NMR quantum computation with indirectly coupled gates

An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR implementation of the Deutsch-Jozsa algorithm for functions with three argument bits and demonstrates a technique essential for multi-qubit quantum computation.Comment: 9 pages, 2 figures. 10 additional figures illustrating output spectr

A Denotational Semantics for First-Order Logic

In Apt and Bezem [AB99] (see cs.LO/9811017) we provided a computational interpretation of first-order formulas over arbitrary interpretations. Here we complement this work by introducing a denotational semantics for first-order logic. Additionally, by allowing an assignment of a non-ground term to a variable we introduce in this framework logical variables. The semantics combines a number of well-known ideas from the areas of semantics of imperative programming languages and logic programming. In the resulting computational view conjunction corresponds to sequential composition, disjunction to ``don't know'' nondeterminism, existential quantification to declaration of a local variable, and negation to the ``negation as finite failure'' rule. The soundness result shows correctness of the semantics with respect to the notion of truth. The proof resembles in some aspects the proof of the soundness of the SLDNF-resolution.Comment: 17 pages. Invited talk at the Computational Logic Conference (CL 2000). To appear in Springer-Verlag Lecture Notes in Computer Scienc