Practical scheme for quantum computation with any two-qubit entangling gate

Which gates are universal for quantum computation? Although it is well known that certain gates on two-level quantum systems (qubits), such as the controlled-NOT, are universal when assisted by arbitrary one-qubit gates, it has only recently become clear precisely what class of two-qubit gates is universal in this sense. We present an elementary proof that any entangling two-qubit gate is universal for quantum computation, when assisted by one-qubit gates. A proof of this result for systems of arbitrary finite dimension has been provided by Brylinski and Brylinski; however, their proof relies on a long argument using advanced mathematics. In contrast, our proof provides a simple constructive procedure which is close to optimal and experimentally practical.

ROM-based computation: Quantum versus classical

We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical ROM-based computer. We also comment on the time-efficiency advantages of quantum computation within this model.

A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries

Libraries of cyclic peptides are being synthesized using combinatorial chemistry for high throughput screening in the drug discovery process. This paper describes the min_syn_steps.cpp program (available at http://www.imb.uq.edu.au/groups/smythe/tran), which after inputting a list of cyclic peptides to be synthesized, removes cyclic redundant sequences and calculates synthetic strategies which minimize the synthetic steps as well as the reagent requirements. The synthetic steps and reagent requirements could be minimized by finding common subsets within the sequences for block synthesis. Since a brute-force approach to search for optimum synthetic strategies is impractically large, a subset-orientated approach is utilized here to limit the size of the search. (C) 2002 Elsevier Science Ltd. All rights reserved.

Fast neutron mutagenesis of soybean (Glycine soja L.) produces a supernodulating mutant containing a large deletion in linkage group H

We describe for the first time the application of fast neutron mutagenesis to the genetic dissection of root nodulation in legumes. We demonstrate the utility of chromosomal deletion mutations through production of a soybean supernodulation mutant FN37 that lacks the internal autoregulation of nodulation mechanism. After inoculation with microsymbiont Bradyrhizobium japonicum, FN37 forms at least 10 times more nodules than the wild type G. soja parent and has a phenotype identical to that of chemically induced allelic mutants nts382 and nts1007 (NTS-1 locus). Reciprocal grafting of shoots and roots confirmed systemic shoot control of the FN37 nodulation phenotype. RFLP/PCR marker pUTG132a and AFLP marker UQC-IS1 which are tightly linked to NTS-1 allowed the isolation of BAC contigs delineating both ends of the deletion. The genetic/physical distance ratio in the NTS-1 region is 279 kb/cM. The deletion is estimated to be about 460 kb based on the absence of markers and bacterial artificial chromosomes (BAC) ends as well as genetic and physical mapping. Deletion break points were determined physically and placed within flanking BAC contigs.

The tree cut and merge algorithm for estimation of network reliability

This article presents Monte Carlo techniques for estimating network reliability. For highly reliable networks, techniques based on graph evolution models provide very good performance. However, they are known to have significant simulation cost. An existing hybrid scheme (based on partitioning the time space) is available to speed up the simulations; however, there are difficulties with optimizing the important parameter associated with this scheme. To overcome these difficulties, a new hybrid scheme (based on partitioning the edge set) is proposed in this article. The proposed scheme shows orders of magnitude improvement of performance over the existing techniques in certain classes of network. It also provides reliability bounds with little overhead.

Fast, scalable master equation solution algorithms. IV. Lanczos iteration with diffusion approximation preconditioned iterative inversion

In this paper we propose a second linearly scalable method for solving large master equations arising in the context of gas-phase reactive systems. The new method is based on the well-known shift-invert Lanczos iteration using the GMRES iteration preconditioned using the diffusion approximation to the master equation to provide the inverse of the master equation matrix. In this way we avoid the cubic scaling of traditional master equation solution methods while maintaining the speed of a partial spectral decomposition. The method is tested using a master equation modeling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long-lived isomerizing intermediates. (C) 2003 American Institute of Physics.

Fast, scalable master equation solution algorithms. III. Direct time propagation accelerated by a diffusion approximation preconditioned iterative solver

In this paper we propose a novel fast and linearly scalable method for solving master equations arising in the context of gas-phase reactive systems, based on an existent stiff ordinary differential equation integrator. The required solution of a linear system involving the Jacobian matrix is achieved using the GMRES iteration preconditioned using the diffusion approximation to the master equation. In this way we avoid the cubic scaling of traditional master equation solution methods and maintain the low temperature robustness of numerical integration. The method is tested using a master equation modelling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long lived isomerizing intermediates. (C) 2003 American Institute of Physics.

A genetic algorithm/method of moments approach to the optimization of an RF coil for MRI applications - Theoretical considerations - Abstract

A Combined Genetic Algorithm and Method of Moments design methods is presented for the design of unusual near-field antennas for use in Magnetic Resonance Imaging systems. The method is successfully applied to the design of an asymmetric coil structure for use at 190MHz and demonstrates excellent radiofrequency field homogeneity.

Identification of slow and fast-acting toxins in a highly ciguatoxic barracuda (Sphyraena barracuda) by HPLC/MS and radiolabelled ligand binding

A barracuda implicated in ciguatera fish poisoning in Guadeloupe was estimated to have an overall flesh toxicity of 15 MUg/g using mouse bioassay. A lipid soluble extract was separated into two toxic fractions, FrA and FrB, on a LH20 Sephadex column eluted with dichloromethane/methanol (1:1). When intraperitoneal injected into mice, FrA provoked symptoms characteristic of slow-acting ciguatoxins, whereas FrB produced symptoms indicative of fast-acting toxins (FAT). High performance liquid chromatography/mass spectrometry/radio-ligand binding (HPLC/MS/RLB) analysis confirmed the two fractions were distinct, because only a weak overlap of some compounds was observed. HPLC/MS/RLB analysis revealed C-CTX-1 as the potent toxin present in FrA, and two coeluting active compounds at m/z 809.43 and 857.42 in FrB, all displaying the characteristic pattern of ion formation for hydroxy-polyethers. Other C-CTX congeners and putative hydroxy-polyether-like compounds were detected in both fractions, however, the RLB found them inactive. C-CTX-1 accounted for >90% of total toxicity in this barracuda and was confirmed to be a competitive inhibitor of brevetoxin binding to voltage-sensitive sodium channels (VSSCs) with a potency two-times lower than P-CTX-1. However, FAT active on VSSCs and

Mapping the royal road and other hierarchical functions

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.