Biomedical subjects

C S Yannoni

Publications and source records attributed to C S Yannoni.

3 recordsLinked to original sources

PubMed2001

Electron spin relaxation near a micron-size ferromagnet.

Magnetic resonance force microscopy was used to study the behavior of small ensembles of unpaired electron spins in silica near a micrometer-size ferromagnetic tip. Using a cantilever-driven spin manipulation protocol and a magnetic field gradient greater than 10(5) T/m, signals from as few as 100 net spins within a 20 nm thick resonant slice could be studied. A sixfold increase in the spin-lattice relaxation rate was found within 800 nm of the ferromagnet, while no effect due to silica surface proximity was detected. The results are interpreted in terms of Larmor-frequency magnetic field fluctuations emanating from the ferromagnet.

Journal Article↗

PubMed2000

Experimental realization of an order-finding algorithm with an NMR quantum computer.

We report the realization of a nuclear magnetic resonance quantum computer which combines the quantum Fourier transform with exponentiated permutations, demonstrating a quantum algorithm for order finding. This algorithm has the same structure as Shor's algorithm and its speed-up over classical algorithms scales exponentially. The implementation uses a particularly well-suited five quantum bit molecule and was made possible by a new state initialization procedure and several quantum control techniques.

Journal Article↗

PubMedDate not supplied

Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance.

The number of steps any classical computer requires in order to find the prime factors of an l-digit integer N increases exponentially with l, at least using algorithms known at present. Factoring large integers is therefore conjectured to be intractable classically, an observation underlying the security of widely used cryptographic codes. Quantum computers, however, could factor integers in only polynomial time, using Shor's quantum factoring algorithm. Although important for the study of quantum computers, experimental demonstration of this algorithm has proved elusive. Here we report an implementation of the simplest instance of Shor's algorithm: factorization of N = 15 (whose prime factors are 3 and 5). We use seven spin-1/2 nuclei in a molecule as quantum bits, which can be manipulated with room temperature liquid-state nuclear magnetic resonance techniques. This method of using nuclei to store quantum information is in principle scalable to systems containing many quantum bits, but such scalability is not implied by the present work. The significance of our work lies in the demonstration of experimental and theoretical techniques for precise control and modelling of complex quantum computers. In particular, we present a simple, parameter-free but predictive model of decoherence effects in our system.

Journal Article↗