The Deutsch-Josza Algorithm in NMR

Similar documents
Measuring Spin-Lattice Relaxation Time

Experimental Realization of Shor s Quantum Factoring Algorithm

INTRODUCTION TO NMR and NMR QIP

Factoring 15 with NMR spectroscopy. Josefine Enkner, Felix Helmrich

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information

INTRODUCTION TO NMR and NMR QIP

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005

arxiv:quant-ph/ v2 10 Jun 2004

Michael Mehring Physikalisches Institut, Univ. Stuttgart, Germany. Coworkers. A. Heidebrecht, J. Mende, W. Scherer

Shor s Prime Factorization Algorithm

An introduction to Quantum Computing using Trapped cold Ions

Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles

Quantum Information Processing with Liquid-State NMR

Experimental Realization of Brüschweiler s exponentially fast search algorithm in a 3-qubit homo-nuclear system

Short Course in Quantum Information Lecture 8 Physical Implementations

NANOSCALE SCIENCE & TECHNOLOGY

PHYSICAL REVIEW A, 66,

Quantum Computing with NMR: Deutsch-Josza and Grover Algorithms

Experimental Quantum Computing: A technology overview

Errata list, Nielsen & Chuang. rrata/errata.html

Superoperators for NMR Quantum Information Processing. Osama Usman June 15, 2012

Quantum Phase Estimation using Multivalued Logic

Classical behavior of magnetic dipole vector. P. J. Grandinetti

QUANTUM COMPUTING. Part II. Jean V. Bellissard. Georgia Institute of Technology & Institut Universitaire de France

Quantum gate. Contents. Commonly used gates

arxiv:quant-ph/ v1 1 Oct 1999

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.

Quantum Computation with Neutral Atoms Lectures 14-15

Seminar 1. Introduction to Quantum Computing

phys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference

DNP in Quantum Computing Eisuke Abe Spintronics Research Center, Keio University

arxiv: v1 [quant-ph] 21 Dec 2009

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA

b) (5 points) Give a simple quantum circuit that transforms the state

Introduction to Quantum Computing

Ancilla-driven universal quantum computing

Shallow Donors in Silicon as Electron and Nuclear Spin Qubits Johan van Tol National High Magnetic Field Lab Florida State University

Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)

Unitary Dynamics and Quantum Circuits

17. Oktober QSIT-Course ETH Zürich. Universality of Quantum Gates. Markus Schmassmann. Basics and Definitions.

arxiv:quant-ph/ v2 5 Feb 2000

Quantum Computing. Thorsten Altenkirch

Chapter 10. Quantum algorithms

Introduction to Quantum Computing

NUCLEAR MAGNETIC RESONANCE QUANTUM COMPUTATION

Superconducting quantum bits. Péter Makk

Quantum Algorithms. Andreas Klappenecker Texas A&M University. Lecture notes of a course given in Spring Preliminary draft.

Nuclear Magnetic Resonance Quantum Computing Using Liquid Crystal Solvents

Perturbation Theory and Numerical Modeling of Quantum Logic Operations with a Large Number of Qubits

QUANTUM CRYPTOGRAPHY QUANTUM COMPUTING. Philippe Grangier, Institut d'optique, Orsay. from basic principles to practical realizations.

Log-mod-finding: A New Idea for Implementation of Shor's Algorithm

12 Understanding Solution State NMR Experiments: Product Operator Formalism

Ph 219b/CS 219b. Exercises Due: Wednesday 20 November 2013

Biophysical Chemistry: NMR Spectroscopy

Observations of Quantum Dynamics by Solution-State NMR Spectroscopy

Error tolerance in an NMR Implementation of Grover s Fixed-Point Quantum Search Algorithm

Introduction to Quantum Computing

Quantum Computation with Neutral Atoms

Quantum Error Correction Codes-From Qubit to Qudit. Xiaoyi Tang, Paul McGuirk

Classical Description of NMR Parameters: The Bloch Equations

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where

Towards quantum metrology with N00N states enabled by ensemble-cavity interaction. Massachusetts Institute of Technology

Quantum Algorithms for Quantum Field Theories

Measuring progress in Shor s factoring algorithm

Lecture 4: Elementary Quantum Algorithms

Introduction to Quantum Computing. Lecture 1

Chapter 1 Geometric Algebra Methods in Quantum Information Processing by NMR Spectroscopy

Quantum Error Correction Codes - From Qubit to Qudit

C/CS/Phy191 Problem Set 6 Solutions 3/23/05

Requirements for scaleable QIP

Classical Description of NMR Parameters: The Bloch Equations

Spin resonance. Basic idea. PSC 3151, (301)

Recalling the Hadamard gate H 0 = 1

Introduction into Quantum Computations Alexei Ashikhmin Bell Labs

Parallelization of the QC-lib Quantum Computer Simulator Library

Experimental realization of a two-bit phase damping quantum code

Lecture note 8: Quantum Algorithms

Biophysical Chemistry: NMR Spectroscopy

arxiv:quant-ph/ v3 19 May 1997

Shortest Paths for Efficient Control of Indirectly Coupled Qubits

Chemistry 431. Lecture 23

Talk by Johannes Vrana

Optimal Controlled Phasegates for Trapped Neutral Atoms at the Quantum Speed Limit

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation

Electron spins in nonmagnetic semiconductors

Quantum Computing with Para-hydrogen

arxiv:quant-ph/ v1 3 Jan 2006

NMR course at the FMP: NMR of organic compounds and small biomolecules - II -

Introduction to Quantum Error Correction

Quantum Computing ~ Algorithms. HIO) 0 HIO) 010) = ~(l000) ) ) ))

Electrical quantum engineering with superconducting circuits

PHYSICS OF QUANTUM COMPUTATION

Lie algebraic aspects of quantum control in interacting spin-1/2 (qubit) chains

Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm

Quantum information processing with trapped Ca+ ions

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.

example: e.g. electron spin in a field: on the Bloch sphere: this is a rotation around the equator with Larmor precession frequency ω

Gates for Adiabatic Quantum Computing

The Bloch Sphere. Ian Glendinning. February 16, QIA Meeting, TechGate 1 Ian Glendinning / February 16, 2005

Ph 219b/CS 219b. Exercises Due: Wednesday 4 December 2013

Transcription:

December 20, 2010 Matteo Biondi, Thomas Hasler

Introduction Algorithm presented in 1992 by Deutsch and Josza First implementation in 1998 on NMR system: - Jones, JA; Mosca M; et al. of a quantum algorithm on a nuclear magnetic resonance quantum computer. J. Chem. Phys. 109, 1648 (1998) - Chuang, IL; Vandersypen, LMK; Zhou, X; et al. Experimental realization of a quantum algorithm. Nature 393, 143 (1998) Little practical use, but first demonstration of a quantum algorithm that performs a task more efficiently than any classical one

Table of Contents 1 Deutsch Problem 2 The NMR Hamiltonian Quantum Gates 3 Deutsch Algorithm Initialisation U f Read-out 4

Deutsch Algorithm: Task In General: Given unknown function f: {0, 1} N {0, 1} f is constant if f (x) = 0 or f (x) = 1 x f is balanced if f (x) = 0 for half the input and f (x) = 1 for other half of input Simple case: f: {0, 1} {0, 1} Input is 1 bit f 1 (x) = 0, constant f 2 (x) = 1, constant 4 possibilities f 3 (x) = x, balanced f 4 (x) = NOT x, balanced Analogous task: Determine whether a coin is fair or fake

The System Hamiltonian The NMR Hamiltonian Quantum Gates H NMR = H sys + H control + H env where H sys = ω A I z A ω BI z B + 2πJ I z A I z B free precession about B 0 ω A 500 MHz, ω B 125 MHz single qubit addressing (heteronuclear spins: 1 H (A) and 13 C (B) ; rf range) scalar spin-spin coupling two-qubit gates

The NMR Hamiltonian Quantum Gates The Control and the Environment Hamiltonians H control = i=a,b ω i [cos(ω rf t + φ)i x i sin(ω rf t + φ)i y i ] where ω i = γ i B rf shifting to the rotating frame, H rot is no longer t dependent H env leads to decoherence (good in NMR): spin-spin couplings, fluctuating B fields T 2 1 s elastic scattering couplings spins-lattice T 1 10 2 10 3 s inelastic scattering

Single qubit and two-qubit gates The NMR Hamiltonian Quantum Gates quantum control U = U k U k 1... U 2 U 1 single-qubit gate U U = e iα R x (β)r y (γ)r x (δ) where Rˆn (θ) = exp [ i θ ˆn σ 2 ] rf fields U rf = exp [iω(cos φ I x sin φ I y )t pw ] where t pw is the pulse width for example, R z (θ) = X R y (θ) X pulse sequence design two-qubit gates J coupling : U CNOT = i Z A Z B X B U J (1/2J) Y B = 1 0 0 0 0 1 0 0 0 0 0 1 0 0 1 0

Experimental limitations The NMR Hamiltonian Quantum Gates cross-talk pulse on resonance with qubit A perturbs the state of qubit B (frequency bandwidth 1/t pw wide frequency range excitation) solution: from hard (rectangular) pulses, to soft pulses increase t pw, but: decoherence effects get worse off-resonance effects J coupling always present frequency shifting to ω i ± πj turning the coupling off when undesired: refocusing X 2 A U J(τ) X 2 A = U J( τ)

Deutsch Algorithm Initialisation U f Read-out Deutsch Algorithm: Quantum-mechanical Approach Formally: Evaluate f (0) f (1) (addition modulo 2) Classically: Try twice with both inputs QM: Try once with a superposition as input 2-qubit system with 1 input-qubit and 1 work-qubit To have reversible process: Unitary operation U f that contains f x y U f x y f (x) Way how to evaluate f(x) classically on a quantum computer

Deutsch Algorithm Initialisation U f Read-out Deutsch Algorithm: Quantum-mechanical Approach Use superposition as input, achieved with Hadamard gates ( ) ( ) 0 + 1 0 1 2 2 ( ) ( ) U f 0 + ( 1) ( 1) f (0) f (0) f (1) 1 0 1 2 2 Value of f (0) f (1) is stored in relative phase of first qubit Convert superposition back into eigenstates at the end with Hadamard gates

Deutsch Algorithm Initialisation U f Read-out Deutsch Algorithm on NMR: Initialisation CHCl 3 molecules in acetone solvent At room temperature, therefore use temporal averaging (3 measurements after permutations) π/2 rotations in Bloch sphere with pulses in x-y plane Radiofrequency pulse in y-direction rotates vector about y-axis Way to implement Hadamard

Deutsch Algorithm Initialisation U f Read-out Deutsch Algorithm on NMR: Implementing U f x is input qubit A f 1 (x) = 0: Do nothing (identity) f 2 (x) = 1: Do always spin flip (180 pulse) on qubit B f 3 (x) = x: Flip qubit B when qubit A is in state 1 (CNOT) f 4 (x) = NOT x: Flip qubit B when qubit A is in state 0 Attention: In the experiment CNOT operates on superpositions

Deutsch Algorithm Initialisation U f Read-out Deutsch Algorithm on NMR: Read-out Left frequency corresponds to qubit A, right one to B 0 gives emission (>0), 1 absorption (<0) Work qubit always unchanged, qubit A is 0 when const. and 1 when balanced

integer N=15 factorization with the Shor algorithm l-digit integer: from O(2 l 1/3 ) to O(l 3 ) operations turning the factoring problem into a period finding problem f (x) = a x mod N find the period by QFT obtaining factors from period Figure: a: outline of the quantum circuit. b: detailed N=15, a=7 case

Conclusion Pulse techniques to implement quantum control NMR showed promise as a technology for the implementation of small QC (D-J alg.) Positive and negative aspects of NMR (q. coherence/exp. limitations, giant molecules?) Greatest result in QC through NMR factoring

List of the references used L. M. K. Vandersypen, I.L. Chuang NMR techniques for quantum control and computation, Reviews of Modern Physics, 76 (2004). L. M. K. Vandersypen et. Al. Experimental realization of Shor s quantum factoring algorithm using nuclear magnetic resonance, Nature, 414 (2001). I.L. Chuang, L. M. K. Vandersypen, X. Zhou, D.W. Leung, S. Lloyd, Experimental realization of a quantum algorithm, Nature, 393 (1998). J.A. Jones, M. Mosca of a quantum algorithm on a nuclear magnetic resonance quantum computer, Journal of Chemical Physics, 109, 5 (1998).