Quantum Computer. Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study

Size: px
Start display at page:

Download "Quantum Computer. Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study"

Transcription

1 Quantum Computer Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study

2 KIAS (Korea Institute for Advanced Study) Established in 1996 Located in Seoul, Korea Pure Theoretical Basic Science Schools Mathematics Physics Computational Sciences By the computation, For the computation 20 Prof s, 2 Distinguished Prof s, 20 KIAS Scholars, 70 Research Fellows, 20 Staff Members

3 Quantum Physics Information Science Quantum Information Science Quantum Parallelism Quantum computing is exponentially larger and faster than digital computing. Quantum Fourier Transform, Quantum Database Search, Quantum Many-Body Simulation (Nanotechnology) No Clonability of Quantum Information, Irrevesability of Quantum Measurement Quantum Cryptography (Absolutely secure digital communication) Quantum Correlation by Quantum Entanglement Quantum Teleportation, Quantum Superdense Coding, Quantum Cryptography, Quantum Imaging

4 Twenty Questions Animal Four legs? Herbivorous?... Tiger? Yes(1) or No(0) Yes(1) or No(0) Yes(1) or No(0)..

5 It from Bit John A. Wheeler

6 Yoot =Ancient Korean Binary Dice x x x x x x x x x

7

8 Taegeukgi (Korean National Flag) 1 0 Qubit j = a 0 + b 1 Qubit = quantum bit (binary digit)

9 Businessweek 21 Ideas for the 21st Century

10 Transition to Quantum Mathematics: Real Complex Physics: Classical Quantum Digital Information Processing Hardwares by Quantum Mechanics Softwares and Operating Systems by Classical Ideas Quantum Information Processing All by Quantum Ideas

11 Quantum Information Processing Quantum Computer Quantum Algorithms: Softwares Simulation of quantum many-body systems Factoring large integers Database search Experiments: Hardwares Ion Traps NMR Cavity QED, etc. NT IT BT

12 Quantum Information Processing Quantum Communication Quantum Cryptography Absolutely secure digital communication Generation and Distribution of Quantum Key ~100 km through optical fiber (Toshiba) 23.4 km wireless secure satellite communication Quantum Teleportation Photons Atoms, Molecules Quantum Imaging and Quantum Metrology IT

13 Cryptography and QIP Public Key Cryptosystem (Asymmetric) Computationally Secure Based on unproven mathematical conjectures Cursed by Quantum Computation One-Time Pad (Symmetric) Unconditionally Secure Impractical Saved by Quantum Cryptography Giving disease, Giving medicine. Out with the old, In with the new.

14 KIAS-ETRI, December km Quantum Cryptography T.G. Noh and JK

15 Classical Computation Hilbert (1900): 23 most challenging math problems The Last One: Is there a mechanical procedure by which the truth or falsity of any mathematical conjecture could be decided? Turing Conjecture ~ Sequence of 0 s and 1 s Read/Write Head: Logic Gates Model of Modern Computers

16 Turing Machine Finite State Machine: Head q q q = f( qs, ) s = gqs (, ) d = dqs (, ) d Bit {0,1} s s' Infinitely long tape: Storage

17 Bit and Logic Gate NOT AND OR XOR NAND C-NOT CCN ( Toffoli ) C-Exch ( Fredkin ) Universal Reversible Universal Reversible

18 DNA Computing Bit { 0, 1 } Tetrit (?) { A, G, T, C} Gate Enzyme Parallel Ensemble Computation Hamiltonian Path Problem Adleman

19 Complexity N= (# bits to describe the problem, size of the problem) (#steps to solve the problem) = Pol(N) P(polynomial) : Tractable, easy (#steps to verify the solution) = Pol(N) NP (nondeterministic polynomial) : Intractable P NP NP P NP P or NP=P?

20 Quantum Information Bit {0,1} Qubit N bits 2 N states, One at a time Linearly parallel computing AT BEST N qubits Linear superposition of 2 N states at the same time Exponentially parallel computing Quantum Parallelism But when you extract result, a 0 + b1 with a + b = 1 Deutsch you cannot get all of them. 2 2

21 Quantum Algorithms 1. [Feynman] Simulation of Quantum Physical Systems with HUGE Hilber space ( 2 N -D ) e.g. Strongly Correlated Electron Systems 2. [Peter Shor] Factoring large integers, period finding t q Pol (N) t cl Exp (N 1/3 ) 3. [Grover] Searching t q N t cl ~ N/2

22 N bits N bits Digital Computer Digital Computers in parallel m{ 1 N m N N bits N bits Quantum Computer : Quantum Parallelism N bits 2 N N bits

23 Quantum Gates Time-dependent Schrödinger Eq. ih ψ = H ψ t iht / h ψ() t = e ψ(0) = Ut () ψ(0) P ( ) = i 0 I θ θ e 0 1 X = = Z=P( π )= Y = XZ= H= Unitary Transform Norm Preserving Reversible H H 0 = = = = = = ( ) ( ) Hadamard

24 Hadamard Gate H1 H2... HN N 1 ( ) 1 ( ) 1 = ( ) N N = ( ) 1 2 N N N N 2 N = k( ) N 2 k = 0

25 Universal Quantum Gates General Rotation of a Single Qubit q -if q cos -ie sin Ł2ł Ł2ł V( qf, ) = + if q q -ie sin cos Ł Ł2ł Ł2ł ł X c : CNOT (controlled - NOT) or XOR Ł0 0ł Ł0 1ł Ł0 1ł Ł1 0ł = 0 0 I X V X a b = a a b c

26 Quantum Circuit/Network Scalable Qubits Initial State DiVincenzo, Qu-Ph/ Unitary evolution : Deterministic : Reversible Universal Gates Ψæ 0æ 0æ 0æ H t X X 1 H 2C X 13 Yæ M M M Cohere, Not Decohere Quantum measurement : Probabilistic : Irreversible change

27 Quantum Key Distribution [BB84,B92] QKD[E91] Quantum Repeater Quantum Teleportation Single-Qubit Gates Single- & Two-Qubit Gates 3 3 Quantum Error Correction Quantum Computer 7-Qubit QC Single- & Two-Qubit Gates

28 Physical systems actively considered for quantum computer implementation Liquid-state NMR NMR spin lattices Linear ion-trap spectroscopy Neutral-atom optical lattices Cavity QED + atoms Linear optics with single photons Nitrogen vacancies in diamond Electrons on liquid He Small Josephson junctions charge qubits flux qubits Spin spectroscopies, impurities in semiconductors Coupled quantum dots Qubits: spin,charge, excitons Exchange coupled, cavity coupled

29 15= 3 5 Chuang Nature 414, (20/27 Dec 2001) OR QP/

30 Concept device: spin-resonance transistor R. Vrijen et al, Phys. Rev. A 62, (2000)

31 Quantum-dot array proposal

32 Ion Traps Couple lowest centre-of-mass modes to internal electronic states of N ions.

33 Quantum Error Correcting Code Three Bit Code Encode Recover Decode φ 0 0 channel noise 0 0 M M U m1m2 φ

34 Molding a Quantum State Yæ 0æ 0æ H X X 1 H 2C X 13 Yæ M M 0æ t M Molding

35 Sculpturing a Quantum State - Cluster state quantum computing - One-way quantum computing -- +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ 1. Initialize each qubit in +æ state. 2. Contolled-Phase between the neighboring qubits. 3. Single qubit manipulations and single qubit measurements only [Sculpturing]. No two qubit operations!

36 Controlled-NOT XOR X X = 0 0 I X AB AA B AA B = = = A B A B AB AB AB

37 Qubit Copying Circuit? x x x x 0 y x y x ψ = a 0 + b1 0 ψ = a 0 + b1 a 00 + b 11 ψ = a 0 + b1

38 Entanglement by Two-Qubit Gates a 0æ + b 1æ 0æ a 0æ + b 1æ 0æ 0æ a 0æ 0æ + b 1æ 1æ a 0æ 0æ 0æ + b 1æ 1æ 1æ

39 Single Particle Entanglement Single Photon ( ) Single Electron + + H = t c1 c2 + c2c1 Beam Splitter 1 ψ = ( ) 2 1 or ψ = fe + ef 2 ( ) φ = + 2 ( )

40 Quantum Teleportation using a single particle entanglement Lee, JK, Qu-ph/ ; Phys. Rev. A 63, (2001)

41 No Cloning Theorem An Unknown Quantum State Cannot Be Cloned. <Proof> U ( α 0 ) ( 0 ) = α α Zurek, Wootters U β = β β α β 1 Let γ = ( α + β ). 2 1 Then U ( γ 0 ) = ( α α + β β ) γ γ 2

42 If If an unknow quantum state can be cloned Quantum States can be measured as accurately as possible??? yæ yæ, yæ, yæ, yæ measure, measure, Commnunication Faster Than Light? yæ = 0æ A 1æ B - 1æ A 0æ B for 0 = +æ A -æ B - -æ A +æ B for 1

43 Communication Faster Than Light? If an unknown quantum state can be copied; yæ = 0æ A 1æ B - 1æ A 0æ B for 0 = +æ A -æ B - -æ A +æ B for 1 Alice wants to send Bob 1. yæ = +æ A -æ B - -æ A +æ B for 1 Alice mesures her qubit in { +>, ->}. Alice s state will become +> or ->. Bob s state will become -> or +>. Let s assume it is +>. +æ Bob makes many copies of this. +æ, +æ, +æ, +æ, He measures them in { +>, ->}, and gets 100% +>. He measures them in { 0>, 1>}, and gets 50% 0> and 50% 1>. Thus Bob can conclude that Alice measured her state in { +>, ->}.

44 Mysterious Connection Between QM & Relativity Weinberg: Can QM be nonlinear? Experiments: Not so positive result. Polchinski, Gisin: If QM is nonlinear, communication faster than light is possible.

45 Cluster State 1. Qubits on lattice sites are initialized to be = = 2 H 0 2. Operate Control-Z on neighboring qubits. Cont-Z = 0 0 I+ 1 1 X = =

46 Cont-Z 0i e i 0 e 0 0 = = 0i e i e π H= σ1 z + σ2z σ1z σ2z + I = 0 1 I+ I I = = Cont-Z = π i H e 4

47 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ 0æ

48 +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ

49 +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ

50 One-way quantum computing +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ +æ Optical Lattice, Quantum Dots, Superconductors, etc. Single qubit manipulations and single qubit measurements only [Sculpturing]. No two qubit operations!

51 Quantum computing with quantum-dot cellular automata Géza Tóth and Craig S. Lent PRA 63, D array

52 Some comments 1-D cluster state quantum computing can be efficiently simulated by digital computing. 2-D cluster state quantum computing is equivalent to quantum circuit quantum computing, but needs more(just polynomially more) qubits. Proposal : 2-D array of vertical QDs 2-D cluster state does not seem to be a ground state of some Hamiltonian. Once the cluster state is prepared, only single qubit measurements are needed.

53 QUIPU [kí:pu] 1. Quantum Information Processing Unit [JK] 2. A device consisting of a cord with knotted strings of various colors attached, used by the ancient Peruvians for recording events, keeping accounts, etc. Computation Communication * Peruvian Information Processing Unit for Computation and Communication *Rosary *Buddhist Beads

Quantum Information Science. Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study Seoul, Korea

Quantum Information Science. Jaewan Kim School of Computational Sciences Korea Institute for Advanced Study Seoul, Korea Quantum Information Science Jaewan Kim (jaewan@kias.re.kr) School of Computational Sciences Korea Institute for Advanced Study Seoul, Korea Quantum Physics Information Science Quantum Information Science

More information

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation QSIT09.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical

More information

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

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction

More information

quantum mechanics is a hugely successful theory... QSIT08.V01 Page 1

quantum mechanics is a hugely successful theory... QSIT08.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical physics fails

More information

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

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and

More information

Quantum Computers. Todd A. Brun Communication Sciences Institute USC

Quantum Computers. Todd A. Brun Communication Sciences Institute USC Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual

More information

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

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005 Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron

More information

IBM quantum experience: Experimental implementations, scope, and limitations

IBM quantum experience: Experimental implementations, scope, and limitations IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various

More information

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

2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).

More information

Secrets of Quantum Information Science

Secrets of Quantum Information Science Secrets of Quantum Information Science Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose

More information

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

phys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)

More information

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

Quantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles

More information

Introduction to Quantum Computation

Introduction to Quantum Computation Chapter 1 Introduction to Quantum Computation 1.1 Motivations The main task in this course is to discuss application of quantum mechanics to information processing (or computation). Why? Education:Asingleq-bitisthesmallestpossiblequantummechanical

More information

Seminar 1. Introduction to Quantum Computing

Seminar 1. Introduction to Quantum Computing Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences

More information

Some Introductory Notes on Quantum Computing

Some Introductory Notes on Quantum Computing Some Introductory Notes on Quantum Computing Markus G. Kuhn http://www.cl.cam.ac.uk/~mgk25/ Computer Laboratory University of Cambridge 2000-04-07 1 Quantum Computing Notation Quantum Computing is best

More information

Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016

Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016 Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to

More information

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

Errata list, Nielsen & Chuang.  rrata/errata.html Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation

More information

Physics is becoming too difficult for physicists. David Hilbert (mathematician)

Physics is becoming too difficult for physicists. David Hilbert (mathematician) Physics is becoming too difficult for physicists. David Hilbert (mathematician) Simple Harmonic Oscillator Credit: R. Nave (HyperPhysics) Particle 2 X 2-Particle wave functions 2 Particles, each moving

More information

Quantum computing! quantum gates! Fisica dell Energia!

Quantum computing! quantum gates! Fisica dell Energia! Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!

More information

Experimental Quantum Computing: A technology overview

Experimental Quantum Computing: A technology overview Experimental Quantum Computing: A technology overview Dr. Suzanne Gildert Condensed Matter Physics Research (Quantum Devices Group) University of Birmingham, UK 15/02/10 Models of quantum computation Implementations

More information

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

Logic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate

More information

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

QUANTUM CRYPTOGRAPHY QUANTUM COMPUTING. Philippe Grangier, Institut d'optique, Orsay. from basic principles to practical realizations. QUANTUM CRYPTOGRAPHY QUANTUM COMPUTING Philippe Grangier, Institut d'optique, Orsay 1. Quantum cryptography : from basic principles to practical realizations. 2. Quantum computing : a conceptual revolution

More information

Short Course in Quantum Information Lecture 8 Physical Implementations

Short Course in Quantum Information Lecture 8 Physical Implementations Short Course in Quantum Information Lecture 8 Physical Implementations Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture : Intro

More information

Introduction to Quantum Computing. Lecture 1

Introduction to Quantum Computing. Lecture 1 Introduction to Quantum Computing Lecture 1 1 OUTLINE Why Quantum Computing? What is Quantum Computing? History Quantum Weirdness Quantum Properties Quantum Computation 2 Why Quantum Computing? 3 Transistors

More information

Quantum Computing. Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September :00am PST, Teleplace

Quantum Computing. Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September :00am PST, Teleplace Quantum Computing Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September 2010 10:00am PST, Teleplace The Hope All computing is constrained by the laws of Physics and

More information

Introduction to Quantum Computing for Folks

Introduction to Quantum Computing for Folks Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum

More information

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

QUANTUM COMPUTING. Part II. Jean V. Bellissard. Georgia Institute of Technology & Institut Universitaire de France QUANTUM COMPUTING Part II Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France QUANTUM GATES: a reminder Quantum gates: 1-qubit gates x> U U x> U is unitary in M 2 ( C

More information

Hacking Quantum Cryptography. Marina von Steinkirch ~ Yelp Security

Hacking Quantum Cryptography. Marina von Steinkirch ~ Yelp Security Hacking Quantum Cryptography Marina von Steinkirch ~ Yelp Security Agenda 1. Quantum Mechanics in 10 mins 2. Quantum Computing in 11 mins 3. Quantum Key Exchange in 100 mins (or more minutes) Some disclaimers

More information

Quantum Entanglement and Decoherence

Quantum Entanglement and Decoherence Quantum Entanglement an Decoherence Jaewan Kim (jaewan@kias.re.kr) KIAS I think of my lifetime in physics as ivie into three perios. In the first perio I was in the grip of the iea that Everything is Particles,

More information

Entanglement and Quantum Teleportation

Entanglement and Quantum Teleportation Entanglement and Quantum Teleportation Stephen Bartlett Centre for Advanced Computing Algorithms and Cryptography Australian Centre of Excellence in Quantum Computer Technology Macquarie University, Sydney,

More information

An Introduction to Quantum Information and Applications

An Introduction to Quantum Information and Applications An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded

More information

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction

Tutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states

More information

10.2 Introduction to quantum information processing

10.2 Introduction to quantum information processing AS-Chap. 10-1 10. Introduction to quantum information processing AS-Chap. 10-10. Introduction to Information Processing Information General concept (similar to energy) Many forms: Mechanical, thermal,

More information

Quantum Gates, Circuits & Teleportation

Quantum Gates, Circuits & Teleportation Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary

More information

Quantum Teleportation Pt. 1

Quantum Teleportation Pt. 1 Quantum Teleportation Pt. 1 PHYS 500 - Southern Illinois University April 17, 2018 PHYS 500 - Southern Illinois University Quantum Teleportation Pt. 1 April 17, 2018 1 / 13 Types of Communication In the

More information

The Three Upcoming Revolutions in Physics and Astronomy that will Affect Everyone. Quantum Information Nov. 12, 2002

The Three Upcoming Revolutions in Physics and Astronomy that will Affect Everyone. Quantum Information Nov. 12, 2002 The Three Upcoming Revolutions in Physics and Astronomy that will Affect Everyone Quantum Information Nov. 12, 2002 The History of Secrecy Enemy of the State You re being watched Big Brother You are captured

More information

Quantum Computation: From Quantum Teleportation to the Shor s Algorithm

Quantum Computation: From Quantum Teleportation to the Shor s Algorithm Quantum Computation: From Quantum Teleportation to the Shor s Algorithm J. J. Ruiz-Lorenzo Dep. Física, Universidad de Extremadura Instituto de Computación Científica Avanzada de Extremadura (ICCAEx) http://www.eweb.unex.es/eweb/fisteor/juan

More information

Realization of Single Qubit Operations Using. Coherence Vector Formalism in. Quantum Cellular Automata

Realization of Single Qubit Operations Using. Coherence Vector Formalism in. Quantum Cellular Automata Adv. Studies Theor. Phys., Vol. 6, 01, no. 14, 697-70 Realization of Single Qubit Operations Using Coherence Vector Formalism in Quantum Cellular Automata G. Pavan 1, N. Chandrasekar and Narra Sunil Kumar

More information

Chapter 10. Quantum algorithms

Chapter 10. Quantum algorithms Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,

More information

Quantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity

Quantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search

More information

Information quantique, calcul quantique :

Information quantique, calcul quantique : Séminaire LARIS, 8 juillet 2014. Information quantique, calcul quantique : des rudiments à la recherche (en 45min!). François Chapeau-Blondeau LARIS, Université d Angers, France. 1/25 Motivations pour

More information

Lecture 4: Postulates of quantum mechanics

Lecture 4: Postulates of quantum mechanics Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying

More information

The long road of Quantum Computing

The long road of Quantum Computing The long road of Quantum Computing Thierry Ferrus Hitachi Cambridge Laboratory Tutorial Outline Evolution of thoughts : from corpuscles to quantum world Quantum Information and Quantum Computers Various

More information

Magnetic semiconductors. (Dilute) Magnetic semiconductors

Magnetic semiconductors. (Dilute) Magnetic semiconductors Magnetic semiconductors We saw last time that: We d like to do spintronics in semiconductors, because semiconductors have many nice properties (gateability, controllable spin-orbit effects, long spin lifetimes).

More information

6.2 Introduction to quantum information processing

6.2 Introduction to quantum information processing AS-Chap. 6. - 1 6. Introduction to quantum information processing 6. Introduction to information processing AS-Chap. 6. - Information General concept (similar to energy) Many forms: Mechanical, thermal,

More information

Quantum Computing. Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge

Quantum Computing. Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge Quantum Computing Richard Jozsa Centre for Quantum Information and Foundations DAMTP University of Cambridge Physics and Computation A key question: what is computation....fundamentally? What makes it

More information

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

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 Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,

More information

10.2 Introduction to quantum information processing

10.2 Introduction to quantum information processing AS-Chap. 10-1 10. Introduction to quantum information processing 10. Introduction to information processing AS-Chap. 10 - Information General concept (similar to energy) Many forms: Mechanical, thermal,

More information

Chapter 10. Superconducting Quantum Circuits

Chapter 10. Superconducting Quantum Circuits Chapter 10 Superconducting Quantum Circuits 10.1 Motivation AS-Chap. 10-2 Repetition: current-phase and voltage-phase relation are classical, but have quantum origin (macroscopic quantum model) primary

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Petros Wallden Lecture 1: Introduction 18th September 2017 School of Informatics, University of Edinburgh Resources 1. Quantum Computation and Quantum Information by Michael

More information

Single qubit + CNOT gates

Single qubit + CNOT gates Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose

More information

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits

Quantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited

More information

Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L.

Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L. Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models CS448J, Autumn 2015, Stanford University Dominik L. Michels Advanced Computation Models There is a variety of advanced

More information

Quantum Information Transfer and Processing Miloslav Dušek

Quantum Information Transfer and Processing Miloslav Dušek Quantum Information Transfer and Processing Miloslav Dušek Department of Optics, Faculty of Science Palacký University, Olomouc Quantum theory Quantum theory At the beginning of 20 th century about the

More information

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. ) Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson

More information

Quantum Information Processing

Quantum Information Processing Quantum Information Processing Jonathan Jones http://nmr.physics.ox.ac.uk/teaching The Information Age Communication Shannon Computation Turing Current approaches are essentially classical which is wrong

More information

Quantum Information Processing and Diagrams of States

Quantum Information Processing and Diagrams of States Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University

More information

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar

Quantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical

More information

The information content of a quantum

The information content of a quantum The information content of a quantum A few words about quantum computing Bell-state measurement Quantum dense coding Teleportation (polarisation states) Quantum error correction Teleportation (continuous

More information

Quantum Information Science (QIS)

Quantum Information Science (QIS) Quantum Information Science (QIS) combination of three different fields: Quantum Physics QIS Computer Science Information Theory Lecture 1 - Outline 1. Quantum Mechanics 2. Computer Science History 3.

More information

Quantum Computation and Communication

Quantum Computation and Communication Tom Lake tswsl1989@sucs.org 16/02/2012 quan tum me chan ics: The branch of mechanics that deals with the mathematical description of the motion and interaction of subatomic particles - OED quan tum me

More information

Compute the Fourier transform on the first register to get x {0,1} n x 0.

Compute the Fourier transform on the first register to get x {0,1} n x 0. CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary

More information

Security Implications of Quantum Technologies

Security Implications of Quantum Technologies Security Implications of Quantum Technologies Jim Alves-Foss Center for Secure and Dependable Software Department of Computer Science University of Idaho Moscow, ID 83844-1010 email: jimaf@cs.uidaho.edu

More information

Quantum Computing. Thorsten Altenkirch

Quantum Computing. Thorsten Altenkirch Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the

More information

Quantum computing and mathematical research. Chi-Kwong Li The College of William and Mary

Quantum computing and mathematical research. Chi-Kwong Li The College of William and Mary and mathematical research The College of William and Mary Classical computing Classical computing Hardware - Beads and bars. Classical computing Hardware - Beads and bars. Input - Using finger skill to

More information

Quantum Computation with Neutral Atoms Lectures 14-15

Quantum Computation with Neutral Atoms Lectures 14-15 Quantum Computation with Neutral Atoms Lectures 14-15 15 Marianna Safronova Department of Physics and Astronomy Back to the real world: What do we need to build a quantum computer? Qubits which retain

More information

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

Hilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding. CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as

More information

Image courtesy of Keith Schwab http://www.lbl.gov/science-articles/archive/afrd Articles/Archive/AFRD-quantum-logic.html http://www.wmi.badw.de/sfb631/tps/dqd2.gif http://qist.lanl.gov/qcomp_map.shtml

More information

Gates for Adiabatic Quantum Computing

Gates for Adiabatic Quantum Computing Gates for Adiabatic Quantum Computing Richard H. Warren Abstract. The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle

More information

Schrödinger Cats, Maxwell s Demon and Quantum Error Correction

Schrödinger Cats, Maxwell s Demon and Quantum Error Correction Schrödinger Cats, Maxwell s Demon and Quantum Error Correction Experiment Michel Devoret Luigi Frunzio Rob Schoelkopf Andrei Petrenko Nissim Ofek Reinier Heeres Philip Reinhold Yehan Liu Zaki Leghtas Brian

More information

A central problem in cryptography: the key distribution problem.

A central problem in cryptography: the key distribution problem. Scientific American 314, 48-55 (2016) A central problem in cryptography: the key distribution problem. Mathematics solution: public key cryptography. Public-key cryptography relies on the computational

More information

Quantum Computation with Neutral Atoms

Quantum Computation with Neutral Atoms Quantum Computation with Neutral Atoms Marianna Safronova Department of Physics and Astronomy Why quantum information? Information is physical! Any processing of information is always performed by physical

More information

Quantum Information Processing with Liquid-State NMR

Quantum Information Processing with Liquid-State NMR Quantum Information Processing with Liquid-State NMR Pranjal Vachaspati, Sabrina Pasterski MIT Department of Physics (Dated: May 8, 23) We demonstrate the use of a Bruker Avance 2 NMR Spectrometer for

More information

Quantum Computer Architecture

Quantum Computer Architecture Quantum Computer Architecture Scalable and Reliable Quantum Computers Greg Byrd (ECE) CSC 801 - Feb 13, 2018 Overview 1 Sources 2 Key Concepts Quantum Computer 3 Outline 4 Ion Trap Operation The ion can

More information

Challenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley

Challenges in Quantum Information Science. Umesh V. Vazirani U. C. Berkeley Challenges in Quantum Information Science Umesh V. Vazirani U. C. Berkeley 1 st quantum revolution - Understanding physical world: periodic table, chemical reactions electronic wavefunctions underlying

More information

10 - February, 2010 Jordan Myronuk

10 - February, 2010 Jordan Myronuk 10 - February, 2010 Jordan Myronuk Classical Cryptography EPR Paradox] The need for QKD Quantum Bits and Entanglement No Cloning Theorem Polarization of Photons BB84 Protocol Probability of Qubit States

More information

Universal quantum computers

Universal quantum computers F. UNIVERSAL QUANTUM COMPUTERS 169 F Universal quantum computers Hitherto we have used a practical definition of universality: since conventional digital computers are implemented in terms of binary digital

More information

Measurement Based Quantum Computing, Graph States, and Near-term Realizations

Measurement Based Quantum Computing, Graph States, and Near-term Realizations Measurement Based Quantum Computing, Graph States, and Near-term Realizations Miami 2018 Antonio Russo Edwin Barnes S. E. Economou 17 December 2018 Virginia Polytechnic Institute and State University A.

More information

arxiv:quant-ph/ v5 6 Apr 2005

arxiv:quant-ph/ v5 6 Apr 2005 Nonunitary quantum circuit Hiroaki Terashima 1, and Masahito Ueda 1, arxiv:quant-ph/3461v5 6 Apr 5 1 Department of Physics, Tokyo Institute of Technology, Tokyo 15-8551, Japan CREST, Japan Science and

More information

Introduction to Superconductivity. Superconductivity was discovered in 1911 by Kamerlingh Onnes. Zero electrical resistance

Introduction to Superconductivity. Superconductivity was discovered in 1911 by Kamerlingh Onnes. Zero electrical resistance Introduction to Superconductivity Superconductivity was discovered in 1911 by Kamerlingh Onnes. Zero electrical resistance Meissner Effect Magnetic field expelled. Superconducting surface current ensures

More information

Quantum Computers Is the Future Here?

Quantum Computers Is the Future Here? Quantum Computers Is the Future Here? Tal Mor CS.Technion ISCQI Feb. 2016 128?? [ 2011 ; sold to LM ] D-Wave Two :512?? [ 2013 ; sold to NASA + Google ] D-Wave Three: 1024?? [ 2015 ; also installed at

More information

Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography. D. J. Guan

Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography. D. J. Guan Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography D. J. Guan Abstract The development of quantum algorithms and quantum information theory, as well as the design

More information

Quantum computing hardware

Quantum computing hardware Quantum computing hardware aka Experimental Aspects of Quantum Computation PHYS 576 Class format 1 st hour: introduction by BB 2 nd and 3 rd hour: two student presentations, about 40 minutes each followed

More information

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Volume 3, No. 5, May 2012 Journal of Global Research in Computer Science REVIEW ARTICLE Available Online at www.jgrcs.info COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Tirtharaj Dash

More information

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

b) (5 points) Give a simple quantum circuit that transforms the state C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish

More information

Linear-optical quantum information processing: A few experiments

Linear-optical quantum information processing: A few experiments Linear-optical quantum information processing: A few experiments Miloslav Dušek Lucie Čelechovská, Karel Lemr, Michal Mičuda, Antonín Černoch, Jaromír Fiurášek, Miroslav Ježek, ek, Jan Soubusta, Radim

More information

Solid-state quantum communications and quantum computation based on single quantum-dot spin in optical microcavities

Solid-state quantum communications and quantum computation based on single quantum-dot spin in optical microcavities CQIQC-V -6 August, 03 Toronto Solid-state quantum communications and quantum computation based on single quantum-dot spin in optical microcavities Chengyong Hu and John G. Rarity Electrical & Electronic

More information

EPR paradox, Bell inequality, etc.

EPR paradox, Bell inequality, etc. EPR paradox, Bell inequality, etc. Compatible and incompatible observables AA, BB = 0, then compatible, can measure simultaneously, can diagonalize in one basis commutator, AA, BB AAAA BBBB If we project

More information

Quantum Circuits and Algorithms

Quantum Circuits and Algorithms Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements

More information

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p. Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell

More information

Other Topics in Quantum Information

Other Topics in Quantum Information p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.

More information

The Deutsch-Josza Algorithm in NMR

The Deutsch-Josza Algorithm in NMR 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

More information

Experimental Realization of Shor s Quantum Factoring Algorithm

Experimental Realization of Shor s Quantum Factoring Algorithm Experimental Realization of Shor s Quantum Factoring Algorithm M. Steffen1,2,3, L.M.K. Vandersypen1,2, G. Breyta1, C.S. Yannoni1, M. Sherwood1, I.L.Chuang1,3 1 IBM Almaden Research Center, San Jose, CA

More information

Introduction. An Introduction to Quantum Computation and Quantum Communication. Why would we care? What approximation do we remove?

Introduction. An Introduction to Quantum Computation and Quantum Communication. Why would we care? What approximation do we remove? An Introduction to Quantum Computation and Quantum Communication Rob Pike Bell Labs Lucent Technologies rob@plan9.bell-labs.com June 23, 2000 An analogy: Introduction Newtonian physics is an approximation

More information

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

example: e.g. electron spin in a field: on the Bloch sphere: this is a rotation around the equator with Larmor precession frequency ω Dynamics of a Quantum System: QM postulate: The time evolution of a state ψ> of a closed quantum system is described by the Schrödinger equation where H is the hermitian operator known as the Hamiltonian

More information

An Introduction. Dr Nick Papanikolaou. Seminar on The Future of Cryptography The British Computer Society 17 September 2009

An Introduction. Dr Nick Papanikolaou. Seminar on The Future of Cryptography The British Computer Society 17 September 2009 An Dr Nick Papanikolaou Research Fellow, e-security Group International Digital Laboratory University of Warwick http://go.warwick.ac.uk/nikos Seminar on The Future of Cryptography The British Computer

More information

Advanced Cryptography Quantum Algorithms Christophe Petit

Advanced Cryptography Quantum Algorithms Christophe Petit The threat of quantum computers Advanced Cryptography Quantum Algorithms Christophe Petit University of Oxford Christophe Petit -Advanced Cryptography 1 Christophe Petit -Advanced Cryptography 2 The threat

More information

P 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0

P 3/2 P 1/2 F = -1.5 F S 1/2. n=3. n=3. n=0. optical dipole force is state dependent. n=0 (two-qubit gate): tools: optical dipole force P 3/2 P 1/2 F = -1.5 F n=3 n=3 n=0 S 1/2 n=0 optical dipole force is state dependent tools: optical dipole force (e.g two qubits) ω 2 k1 d ω 1 optical dipole

More information

Quantum Key Distribution and the Future of Encryption

Quantum Key Distribution and the Future of Encryption Quantum Key Distribution and the Future of Encryption Konstantinos Karagiannis Global Technical Lead, Ethical Hacking BT Security Amsterdam, October 16 th, 2014 Understanding QM? I think I can safely say

More information