Quantum Computing and Nuclear Magnetic Resonance Jonathan Jones EPS-12, Budapest, August 29 2002 Oxford Centre for Quantum Computation

Slides:



Advertisements
Similar presentations
Henry Haselgrove School of Physical Sciences University of Queensland
Advertisements

University of Queensland
Pulse Techniques. Off-Resonance Effects Initial magnetization along z x-pulse (  = 0) On-resonance: M z -> -M y Off-resonance: phase 
Density Matrix Tomography, Contextuality, Future Spin Architectures T. S. Mahesh Indian Institute of Science Education and Research, Pune.
Nuclei With Spin Align in Magnetic Fields HoHo anti-parallel parallel Alignment Energy  E = h  H o Efficiency factor- nucleus ConstantsStrength of magnet.
1 Parahydrogen induced polarization Parahydrogen induced polarization Thomas Theis University of California Berkeley Physics /17/2008.
The Quantum Mechanics of MRI Part 1: Basic concepts
An Introduction to Parahydrogen Projects in the Pines Lab David Trease Special Topics... March Chip Crawford.
7- Double Resonance 1. Types of double resonance experiments 2. 1 H-{ 1 H} Homonuclear Decoupling C-{ 1 H} Heteronuclear Decoupling.
Polarization transfer So far we have dealt vectors (magnetizations) that are proportional to the sensitivity of the nuclei we are studying. In multiple.
NMR Nuclear Magnetic Resonance. 1 H, 13 C, 15 N, 19 F, 31 P.
Quantum Computation and the Bloch Sphere
Quantum Computing Paul McGuirk 21 April Motivation: Factorization An important problem in computing is finding the prime factorization of an integer.
ECE 497NC: Unconventional Computer Architecture Lecture 12: Quantum Computers II – Implementation Issues Nicholas Carter.
Universal Optical Operations in Quantum Information Processing Wei-Min Zhang ( Physics Dept, NCKU )
Quantum Computing Lecture 19 Robert Mann. Nuclear Magnetic Resonance Quantum Computers Qubit representation: spin of an atomic nucleus Unitary evolution:
FT-NMR. Fundamentals Nuclear spin Spin quantum number – ½ Nuclei with spin state ½ are like little bar magnets and align with a B field. Can align with.
Quantum Computing Ambarish Roy Presentation Flow.
1 Welcome to the presentation on Computational Capabilities with Quantum Computer By Anil Kumar Javali.
NMR Quantum Information Processing and Entanglement R.Laflamme, et al. presented by D. Motter.
Quantum Computation and Error Correction Ali Soleimani.
University of Queensland
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
UNIVERSITY OF NOTRE DAME Xiangning Luo EE 698A Department of Electrical Engineering, University of Notre Dame Superconducting Devices for Quantum Computation.
A short presentation in the group by Prem Basnet 09/29/04.
Dynamic Effects in NMR. The timescale in nmr is fairly long; processes occurring at frequencies of the order of chemical shift differences will tend to.
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Magnetic Resonance Imaging Basic principles of MRI This lecture was taken from “Simply Physics” Click here to link to this site.
Real Quantum Computers Sources Richard Spillman Mike Frank Mike Frank Julian Miller Isaac Chuang, M. Steffen, L.M.K. Vandersypen, G. Breyta, C.S. Yannoni,
A Fault-tolerant Architecture for Quantum Hamiltonian Simulation Guoming Wang Oleg Khainovski.
Experimental Realization of Shor’s Quantum Factoring Algorithm ‡ ‡ Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001) M. Steffen 1,2,3, L.M.K.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
Quantum Information Processing
Quantum computing Alex Karassev. Quantum Computer Quantum computer uses properties of elementary particle that are predicted by quantum mechanics Usual.
By: Mike Neumiller & Brian Yarbrough
DNA and Quantum Computers Russell Deaton Associate Professor Computer Science and Engineering University of Arkansas.
Quantum Devices (or, How to Build Your Own Quantum Computer)
Liquid State NMR Quantum Computing
Quantum Computing The Next Generation of Computing Devices? by Heiko Frost, Seth Herve and Daniel Matthews.
From Bits to Qubits Wayne Viers and Josh Lamkins
Quantum Computing Presented by: Don Davis PHYS
Quantum Computer Speaker: Qeopten Date: 04/12/23.
NMR spectroscopy in solids: A comparison to NMR spectroscopy in liquids Mojca Rangus Mentor: Prof. Dr. Janez Seliger Comentor: Dr. Gregor Mali.
Lecture note 8: Quantum Algorithms
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
The Road to Quantum Computing: Boson Sampling Nate Kinsey ECE 695 Quantum Photonics Spring 2014.
NUCLEAR MAGNETIC RESONANCE SPECTROSCOPY Basics of …….. NMR phenomenonNMR phenomenon Chemical shiftChemical shift Spin-spin splittingSpin-spin splitting.
Quantum Control Synthesizing Robust Gates T. S. Mahesh
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Global control, perpetual coupling and the like Easing the experimental burden Simon Benjamin, Oxford. EPSRC. DTI, Royal Soc.
Quantum Computing Paola Cappellaro
David G. Cory Department of Nuclear Engineering Massachusetts Institute of Technology Using Nuclear Spins for Quantum Information Processing and Quantum.
Quantum Computer 電機四 鄭仲鈞. Outline Quantum Computer Quantum Computing Implement of Quantum Computer Nowadays research of Quantum computer.
Quantum Computing – Part 2 Amanda Denton – Evil Dictator Jesse Millikan – Mad Scientist Lee Ballard – Some Guy With A Beard September 30, 2001.
What is Qu antum In formation and T echnology? Prof. Ivan H. Deutsch Dept. of Physics and Astronomy University of New Mexico Second Biannual Student Summer.
A Study of Error-Correcting Codes for Quantum Adiabatic Computing Omid Etesami Daniel Preda CS252 – Spring 2007.
Quantum Computers by Ran Li.
Coherent cooling: a momentum state quantum computer Tim Freegarde Dipartimento di Fisica, Università di Trento, Povo, ItalyQuantum Optics & Laser.
Bulk Spin Resonance Quantum Information Processing Yael Maguire Physics and Media Group (Prof. Neil Gershenfeld) MIT Media Lab ACAT 2000 Fermi National.
Introduction to Quantum Computing
Quantum Circuit Placement: Optimizing Qubit-to-qubit Interactions through Mapping Quantum Circuits into a Physical Experiment D. Maslov (spkr) – IQC/UWaterloo,
As if computers weren’t fast enough already…
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Purdue University Spring 2016 Prof. Yong P. Chen Lecture 18 (3/24/2016) Slide Introduction to Quantum Photonics.
Quantum gates SALEEL AHAMMAD SALEEL. Introduction.
OSU Quantum Information Seminar
Presentation transcript:

Quantum Computing and Nuclear Magnetic Resonance Jonathan Jones EPS-12, Budapest, August Oxford Centre for Quantum Computation

Outline l What is quantum computing? l How to do quantum computing with NMR l What has been done? l What are we trying to do? l How far can we go? l J. A. Jones, PhysChemComm 11 (2001) l J. A. Jones, Prog. NMR Spectrosc. 38, 325 (2001)

Qubits & quantum registers 0 or 1 Classical Bit 0 or 1 or 0 1 Quantum Bit Classical register 101 Quantum register

F(000) F(001) F(010) F(011) F(100) F(101) F(110) F(111) F (x) Quantum Processor Quantum logic gates INPUT OUTPUT Quantum parallel processing

What could we do with one? l Easy to do the calculations, but hard to get the answers out from the resulting superposition! l Simulate quantum mechanics l Factor numbers: Shor’s algorithm »The end of public key cryptography? »Generalises to the Abelian Hidden Subgroup problem l Speed up searches: Grover’s algorithm l QC is not the answer to everything!

How might we build one? l To build a quantum computer you need l quantum two level systems (qubits), l interacting strongly with one another, l isolated from the environment, but l accessible for read out of answers etc. l See Fortschritte der Physik 48, (2000) »Scalable Quantum Computers - Paving the Way to Realization, S. L. Braunstein and H.-K. Lo

Nuclear Magnetic Resonance l Conventional liquid state NMR systems (common in chemistry and biochemistry labs) l Use two spin states of spin-1/2 nuclei ( 1 H, 13 C, 15 N, 19 F, 31 P) as a qubit l Address and observe them with RF radiation l Nuclei communicate by J couplings l Conventional multi-pulse NMR techniques allow gates to be implemented l Actually have a hot thermal ensemble of computers

NMR experiments

NMR Hamiltonians l Usually written using “product operators”. For two coupled spins l Can apply RF pulses, with good control of amplitude, frequency and phase. Normally work in a frame rotating at the RF frequency. For a single spin

Typical frequencies (14.4T) l For a 1 H nucleus (magnets are usually described by their 1H NMR frequency) l For a 13 C nucleus l For a 19 F nucleus l J couplings lie in the range of 1Hz–1kHz

Single Qubit Rotations l Single spin rotations are implemented using resonant RF pulses l Different spins have different resonance frequencies and so can be selectively addressed l Frequency space can become quite crowded, especially for 1 H (other nuclei are much better)

Controlled- NOT ( CNOT ) gates l The controlled-NOT gate flips the target bit (T) if the control bit (C) is set to 1 C T C T C = C T = T  C (Exclusive- OR ) C0011C0011 T0101T0101 C´ 0 1 T´ 0 1 0

CNOT and SPI (1973) Selective Population Inversion: a 180° pulse applied to one line in a doublet is essentially equivalent to CNOT 180°

Hamiltonian Sculpting l Combine periods of evolution under the background Hamiltonian with periods when various RF pulses are also applied l The Average Hamiltonian over the entire pulse sequence can be manipulated l In general terms can be scaled down or removed at will, and desired forms can be implemented l Highly developed NMR technique l Ultimately equivalent to building circuits out of gates

The spin echo l Most NMR pulse sequences are built around spin echoes which refocus Zeeman interactions l Often thought to be unique to NMR, but in fact an entirely general quantum property l Interaction refocused up to a global phase

CNOT and INEPT (1979) The CNOT propagator can be expanded as a sequence of pulses and delays using a standard NMR approach… … to give a pulse sequence very similar to an INEPT coherence transfer experiment

Example results

Molecules and algorithms l A wide range of molecules have been used with 1 H, 13 C, 15 N, 19 F and 31 P nuclei l A wide range of quantum algorithms have been implemented l Some basic quantum phenomena have been demonstrated

State of the art l Shor’s quantum factoring algorithm to factor 15 Nature 414, 883 (2001)

The initialisation problem l Conventional QCs use single quantum systems which start in a well defined state l NMR QCs use an ensemble of molecules which start in a hot thermal state l Can create a “pseudo-pure” initial state from the thermal state: exponentially inefficient l Better approach: use para-hydrogen!

Two spin system l A homonuclear system of two spin 1/2 nuclei: four energy levels with nearly equal populations Equalise the populations of the upper states leaving a small excess in the lowest level

Two spin system l A homonuclear system of two spin 1/2 nuclei: four energy levels with nearly equal populations Equalise the populations of the upper states leaving a small excess in the lowest level A “pseudo-pure” state Excess population is exponentially small

para-hydrogen l The rotational and nuclear spin states of H 2 molecules are inextricably connected by the Pauli principle l Cooling to the J=0 state would give pure para- hydrogen with a singlet spin state l Cooling below 150K in the presence of an ortho/para catalyst gives significant enhancement of the para population l Enhancement is retained on warming if the ortho/para catalyst is removed

Using para-hydrogen l para-hydrogen has a pure singlet nuclear spin state Can’t do computing with this directly because the H 2 molecule is too symmetric: we need to break the symmetry so that we can address the two nuclei individually

Vaska’s catalyst l Add the p-H 2 to some other molecule, e.g. Vaska’s catalyst Ir PPh 3 OCOCCl + H—H Ir PPh 3 COCO Cl H H The two 1 H nuclei now have different chemical shifts and so can be separately addressed

Tackling systematic errors l Quantum computers are vulnerable to errors l Random errors can be tackled using advanced forms of error correcting codes l Systematic errors can be tackled using various approaches for robust coherent control l The traditional NMR approach (composite pulses) has already proved productive

Tycko composite 90 sequence l Tycko’s composite 90° pulse · ·25 0 gives good compensation for small off- resonance errors l Works well for any initial state, not just for z l Now generalised to arbitrary angles l New J. Phys. 2.6 (2000)

Pulse length errors l The composite 90° pulse · · corrects for pulse length errors l Works well for any initial state, not just z l Generalises to arbitrary angles l More complex sequences give even better results l quant-ph/

How far can we go with NMR? l NMR QCs with 2–3 qubits are routine l Experiments have been performed with up to 7 qubits; 10 qubits is in sight l Beyond 10 qubits it will get very tricky! »Exponentially small signal size »Selective excitation in a crowded frequency space »Decoherence (relaxation) »Lack of selective reinitialisation »Lack of projective measurements »Fortschritte der Physik 48, (2000)

Thanks to…