407 research outputs found
Experimental Realization of Br\"{u}schweiler's exponentially fast search algorithm in a homo-nuclear system
Compared with classical search algorithms, Grover quantum algorithm [ Phys.
Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid
quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential
speedup. In this paper, we report the experimental realization of the
Bruschweiler$ algorithm in a 3-qubit NMR ensemble system. The pulse sequences
are used for the algorithms and the measurement method used here is improved on
that used by Bruschweiler, namely, instead of quantitatively measuring the spin
projection of the ancilla bit, we utilize the shape of the ancilla bit
spectrum. By simply judging the downwardness or upwardness of the corresponding
peaks in an ancilla bit spectrum, the bit value of the marked state can be read
out, especially, the geometric nature of this read-out can make the results
more robust against errors.Comment: 10 pages and 3 figure
Multiqubit Spin
It is proposed that the state space of a quantum object with a complicated
discrete spectrum can be used as a basis for multiqubit recording and
processing of information in a quantum computer. As an example, nuclear spin
3/2 is considered. The possibilities of writing and reading two quantum bits of
information, preparation of the initial state, implementation of the "rotation"
and "controlled negation" operations, which are sufficient for constructing any
algorithms, are demonstrated.Comment: 7 pages, PostScript, no figures; translation of Pis'ma Zh. Eksp.
Teor. Fiz. 70, No. 1, pp. 59-63, 10 July 1999; (Submitted 29 April 1999;
resubmitted 2 June 1999
Effective Pure States for Bulk Quantum Computation
In bulk quantum computation one can manipulate a large number of
indistinguishable quantum computers by parallel unitary operations and measure
expectation values of certain observables with limited sensitivity. The initial
state of each computer in the ensemble is known but not pure. Methods for
obtaining effective pure input states by a series of manipulations have been
described by Gershenfeld and Chuang (logical labeling) and Cory et al. (spatial
averaging) for the case of quantum computation with nuclear magnetic resonance.
We give a different technique called temporal averaging. This method is based
on classical randomization, requires no ancilla qubits and can be implemented
in nuclear magnetic resonance without using gradient fields. We introduce
several temporal averaging algorithms suitable for both high temperature and
low temperature bulk quantum computing and analyze the signal to noise behavior
of each.Comment: 24 pages in LaTex, 14 figures, the paper is also avalaible at
http://qso.lanl.gov/qc
3. Launching the New Enterprise
As the academic year of 1945-46 approached, the intensity of activity in preparation for actually opening the school in the fall term became overwhelming. Incredible though it may seem, Ives and Day were able in a period of a few weeks to assemble the nucleus of a faculty, several of whom formed a continuing source of counsel and advice both during the school’s formative years and thereafter. Includes: The First Dean and the School’s Dedication; A Participant’s View of the Early Years; Ives Moves On; Several Views of Martin P. Catherwood; The Founders
Genomic organization of the mouse granzyme A gene. Two mRNAs encode the same mature granzyme A with different leader peptides
Granzyme A is a serine protease that, together with the other granular components of cytotoxic T lymphocyte (CTL) cells, has been implicated in the cytolysis process. We report here two different messages and the genomic organization of the mouse granzyme A gene. The granzyme A gene is composed of six exons spanning 7 kilobases. Alternative splicing of the second exon results in the two transcripts. The two mRNA species encode the same mature granzyme A protein but with different leader sequences. The first (HF1) encodes a typical leader signal sequence similar to other granzymes, but the second (HF2) putative leader sequence is different and less hydrophobic. Both messages are present in cultured CTL cell lines and in normal lymphoid tissues. They are both induced when CTL cells are activated in vitro or in vivo. Both messages can be translated in vitro, although the HF1 message appears to be much more efficient as a template. The putative 5' promoter region of the HF gene sequenced (500 base pairs of upstream sequences) contains no well defined promoter sequences aside from the TATA box. The results suggest that (a) granzyme A may be produced with putative different leader sequences from two different mRNAs; (b) this may provide a model system for studying alternate splicing and the evolution of a complex enzymatic system in an organelle; and (c) the genomic DNA reported will be useful for studying transcription regulations involved in controlling the specific expression pattern of this gene
Fetching marked items from an unsorted database in NMR ensemble computing
Searching a marked item or several marked items from an unsorted database is
a very difficult mathematical problem. Using classical computer, it requires
steps to find the target. Using a quantum computer, Grover's
algorithm uses steps. In NMR ensemble computing,
Brushweiler's algorithm uses steps. In this Letter, we propose an
algorithm that fetches marked items in an unsorted database directly. It
requires only a single query. It can find a single marked item or multiple
number of items.Comment: 4 pages and 1 figur
Local dimension and finite time prediction in spatiotemporal chaotic systems
We show how a recently introduced statistics [Patil et al, Phys. Rev. Lett.
81 5878 (2001)] provides a direct relationship between dimension and
predictability in spatiotemporal chaotic systems. Regions of low dimension are
identified as having high predictability and vice-versa. This conclusion is
reached by using methods from dynamical systems theory and Bayesian modelling.
We emphasize in this work the consequences for short time forecasting and
examine the relevance for factor analysis. Although we concentrate on coupled
map lattices and coupled nonlinear oscillators for convenience, any other
spatially distributed system could be used instead, such as turbulent fluid
flows.Comment: 5 pagers, 7 EPS figure
Mapping quantitative trait loci for seizure response to a GABAA receptor inverse agonist in mice
To define the genetic contributions affecting individual differences in seizure threshold, a beta carboline [methyl-beta-carboline-3-carboxylate (beta-CCM)]-induced model of generalized seizures was genetically dissected in mice. beta-CCM is a GABAA receptor inverse agonist and convulsant. By measuring the latency to generalized seizures after beta-CCM administration to A/J and C57BL6/J mice and their progeny, we estimated a heritability of 0.28 +/- 0.10. A genome wide screen in an F2 population of these parental strains (n = 273) mapped quantitative trait loci (QTLs) on proximal chromosome 7 [logarithm of the likelihood for linkage (LOD) = 3.71] and distal chromosome 10 (LOD = 4.29) for seizure susceptibility, explaining approximately 22 and 25%, respectively, of the genetic variance for this seizure trait. The best fitting logistic regression model suggests that the A/J allele at each locus increases the likelihood of seizures approximately threefold. In a subsequent backcross population (n = 223), we mapped QTLs on distal chromosome 4 (LOD = 2.88) and confirmed the distal chromosome 10 QTLs (LOD = 4.36). In the backcross, the C57BL/6J allele of the chromosome 10 QTL decreases the risk of seizures approximately twofold. These QTLs may ultimately lead to the identification of genes influencing individual differences in seizure threshold in mice and the discovery of novel anticonvulsant agents. The colocalization on distal chromosome 10 of a beta-CCM susceptibility QTL and a QTL for open field ambulation and vertical movement suggests the existence of a single, pleiotropic locus, which we have named Exq1
- …