Quantum Computing Professor Andrew M. Steane Oxford University

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

Introduction to Quantum Computing

Quantum computing and the entanglement frontier. John Preskill NAS Annual Meeting 29 April 2018

Quantum Information Processing

Quantum Computing. Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract HISTORY OF QUANTUM COMPUTING-

Quantum computing. Jan Černý, FIT, Czech Technical University in Prague. České vysoké učení technické v Praze. Fakulta informačních technologií

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

Introduction to Quantum Information Processing

P vs NP & Computational Complexity

Quantum technology popular science description

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

IBM Q: building the first universal quantum computers for business and science. Federico Mattei Banking and Insurance Technical Leader, IBM Italy

simulations of the Polarization dependence of the light Potential equation in quantum ComPUting

Short introduction to Quantum Computing

Requirements for scaleable QIP

INTRODUCTORY NOTES ON QUANTUM COMPUTATION

MAA509: Quantum Computing and Information Introduction

Lecture 1: Introduction to Quantum Computing

Intel s approach to Quantum Computing

Seminar 1. Introduction to Quantum Computing

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

Lecture 1: Introduction to Quantum Computing

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

IBM Systems for Cognitive Solutions

- Why aren t there more quantum algorithms? - Quantum Programming Languages. By : Amanda Cieslak and Ahmana Tarin

Quantum Computers. Todd A. Brun Communication Sciences Institute USC

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE

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

Quantum Information Transfer and Processing Miloslav Dušek

Secrets of Quantum Information Science

Quantum Computing. Thorsten Altenkirch

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT

Shor s Algorithm. Polynomial-time Prime Factorization with Quantum Computing. Sourabh Kulkarni October 13th, 2017

An Architectural Framework For Quantum Algorithms Processing Unit (QAPU)

Logical AND. Logical XOR

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

How to Train Your Photon Dragon

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

Introduction to Quantum Computing

Fourier Sampling & Simon s Algorithm

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

Shor s Prime Factorization Algorithm

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

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

The Reality of Quantum Computing

CS 126 Lecture T6: NP-Completeness

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI

Entanglement. arnoldzwicky.org. Presented by: Joseph Chapman. Created by: Gina Lorenz with adapted PHYS403 content from Paul Kwiat, Brad Christensen

Adiabatic quantum computation a tutorial for computer scientists

Analog Computing: a different way to think about building a (quantum) computer

Quantum Computing Lecture 6. Quantum Search

Quantum Computation. Dr Austin Fowler Centre for Quantum Computer Technology. New Scientist, 10/11/07

Great Ideas in Theoretical Computer Science. Lecture 28: A Gentle Introduction to Quantum Computation

Quantum computing with superconducting qubits Towards useful applications

Algorithms for quantum computers. Andrew Childs Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo

Cyber Security in the Quantum Era

What is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd.

6.080/6.089 GITCS May 13, Lecture 24

Promise of Quantum Computation

Ion trap quantum processor

6.896 Quantum Complexity Theory November 11, Lecture 20

Jim Held, Ph.D., Intel Fellow & Director Emerging Technology Research, Intel Labs. HPC User Forum April 18, 2018

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

Lecture 4: Elementary Quantum Algorithms

Quantum Mechanics & Quantum Computation

Quantum Memory Hierarchies

A central problem in cryptography: the key distribution problem.

Quantum Computation. Michael A. Nielsen. University of Queensland

6.896 Quantum Complexity Theory September 18, Lecture 5

Quantum Computer Architecture

Introduction into Quantum Computations Alexei Ashikhmin Bell Labs

Introduction to Quantum Computing

Simon s algorithm (1994)

Harvard CS 121 and CSCI E-121 Lecture 22: The P vs. NP Question and NP-completeness

From Niels Bohr to Quantum Computing - from philosophical struggle to technological revolution

Quantum Circuits and Algorithms

Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum Computing University of Waterloo

Introduction to Quantum Computing

Cryptography in a quantum world

Quantum Computing An Overview

Quantum theory has opened to us the microscopic world of particles, atoms and photons..and has given us the keys of modern technologies

Lecture 11, May 11, 2017

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

Experimental Quantum Computing: A technology overview

Quantum Computing. The Future of Advanced (Secure) Computing. Dr. Eric Dauler. MIT Lincoln Laboratory 5 March 2018

Introduction to Quantum Computing

6. Quantum error correcting codes

von Neumann Architecture

Quantum Computers Is the Future Here?

Quantum computing for beginners

Quantum computing! quantum gates! Fisica dell Energia!

Quantum Computer Simulation Using CUDA (Quantum Fourier Transform Algorithm)

Quantum Computers. Peter Shor MIT

A SHORT INTRODUCTION TO QUANTUM INFORMATION AND QUANTUM COMPUTATION

Chapter 1. Introduction

An Introduction to Quantum Computation and Quantum Information

Quantum Algorithms for Leader Election Problem in Distributed Systems

We all live in a yellow submarine

Ph 219b/CS 219b. Exercises Due: Wednesday 22 February 2006

Cryptography in the Quantum Era. Tomas Rosa and Jiri Pavlu Cryptology and Biometrics Competence Centre, Raiffeisen BANK International

Transcription:

Quantum Computing The Laws of ature, or How everything works Professor Andrew M. teane Oxford University Computers and how they work

Popular Mechanics magazine, March 1949: "Where a calculator on the Eniac is equipped with 18,000 vacuum tubes and weighs 30 tons, it is possible that the computer of the future may have only 1,000 vacuum tubes and weigh only 1.5 tons."

ummary 1. Quantum entanglement shows that the physical world is not fully separable into component parts 2. Quantum computing offers a tremendous speedup on certain specialised mathematical problems 3. A brief impression of how it works

Part 1: Quantum Entanglement

Quantum uperposition Examples of objects that are two things at once 1. an oscillating guitar string

Quantum superposition Examples of objects that are two things at once 1. an oscillating guitar string 2. a step up a hill: = = + 3. A small magnet = = +

Atoms Things (for example, a brick) are made of atoms. Atoms are small magnets!

Quantum superposition with atoms A B = ( + ) ( + ) A B A B

Two atoms A B = = ( + ) ( + ) A & & & A B A B A B A B B

An important property of entanglement It is possible to place two atoms in the entangled state: & A B A B The order of writing doesn t matter, so Turn atom A upside down: & ow turn atom B upside down: & = & But this is exactly what we started with!!!

The unity of the entangled state & After turning one atom upside down, if I want to get back to where I started I can now turn either of the two atoms. It is as if I only have OE object, even though it is made of two parts which can be in separate places.

The Oxford Atom Trap Quantum Computer A string of calcium atoms held in a vacuum chamber and manipulated by laser beams: 10 cm 8 atoms in the trap!

Part 2: Information and physics

The same information expressed in different ways The quantum computer is very interesting. L ordinateur quantique est très intéressant. a 97, b 98, c 99: 116 104 101 32 113 117 97 110 116 117 109... 1110100 1101000 1100101 100000 1110001...

Compare with other basic concepts in physics c.f. Energy, momentum kinetic energy example: Proton at CER a rolling marble Information is another basic physical property whose behaviour is described by the laws of ature.

Examples of the physics of information 1. peed of light = speed of information Information cannot travel faster than 299,792,458 metres per second 2. Thermal physics information and entropy

Classical computer science: 2 main ideas All computers are alike (Turing 1920s) Universal machine: One machine can simulate another peed of an algorithm is measured by how the number of steps scales with the input size ( polynomial verses exponential )

Flexibility of information processing

The flexibility of information processing The quantum computer is very interesting. L ordinateur quantique est très intéressant. a 1, b 2, c 3: 20 8 5 0 17 21 1 14 20 21 13 0 3 15 13 16 21 10100 1000 101 0 1 111 10101 1 1110 10100 10101 red 1, orange 2, yellow 3 green 4, blue 5, indigo 6, violet 7 Picture = (1,1,5), (2,1,5), (3,1,5) (120,130,1), (121,130,1), (122,130,4) 1111000 10000010 1 111001 10000010 1

Quantum computers are fast at some calculations 24 17 6 3 24 17 6 3 24 17 6 3 24 17 6 3 24 17 6 3 Period finding: Given f(x) such that f(x+ n p) = f(x) (i.e. periodic with period p), find the period p. 24 17 6 3 18 9 2 65 72 45 7 8 12 22 28 36 47 55 27 51 64 1 81 98 32 41 74 5 19 23 33 25 37 52 63 83 92 16 31 43 87 72 73 91 31 14 11 4 38 1 20 3 13 10 15 25 18 26 30 29 34 42 35 37 39 61 71 46 90 48 49 53 56 86 62 21 27 34 24 17 6 3 18 9 2 65 72 45 7 8 12 22 28 36 47 55 27 51 64 1 81 98 32 4 1 74 5 19 23 33 25 37 52 63 83 92 16 31 43 87 72 73 91 31 14 11 4 38 1 20 3 13 10 15 25 18 26 30 29 34 42 35 37 39 61 71 46 90 48 49 53 56 86 62 21 27 34 24 17 6 3 18 9 2 65 72 45 7 8 12 22 28 36 47 55 27 51 64 1 81 98 32 41 74 5 19 23 33 25 37 52 63 83 92 16 31 43 87 72 73 91 31 14 11 4 38 1 20 3 13 10 15 25 18 26 30 29 34 42 35 37 39 61 71 46 90 48 49 53 56 86 62 21 27 34 24 17 6 3 18 9 2 65 72 45 7 8 12 22 28 36 47 55 27 51 64 1 81 98 32 41 74 5 19 23 33 25 37 52 63 83 92 16 31 43 87 72 73 91 31 14 11 4 38 1 20 3 13 10 15 25 18 26 30 29 34 42 35 Repeats every 78 numbers

Complexity classes Travelling salesman period finding => factorisation PPACE (small memory but slow) P (slow but easily checked) P (fast) disordered list search ordered list

BQP =Bounded error, quantum, polynomial time Travelling salesman PPACE (small memory but slow) disordered list search period finding => factorisation BQP P (slow but easily checked) P (fast) ordered list

BQP =Bounded error, quantum, polynomial time Travelling salesman PPACE (small memory but slow) disordered list search period finding => factorisation BQP P (slow but easily checked) P (fast) quantum chemistry, protein folding, machine learning, ordered list

Quantum computing cannot calculate anything that could not in principle be calculated by an ordinary computer that runs for long enough. However, long enough might be millions of years! That is to say, there exist significant tasks for which a traditional computer would require millions of years (or millions of processors), whereas a quantum computer would complete the calculation in seconds or hours.

Part 3: How A quantum Computer Works

Two atoms A B = = ( + ) ( + ) A & & & A B A B A B A B 1 1 1 0 0 1 0 0 = 3 2 1 0 B

More atoms = ( & )( & )( & ) A B = 111 & 110 & 101 & 100 & 011 & 010 & 001 & 000 so 3 atoms can keep track of 8 numbers 4 atoms can keep track of 16 numbers 23 atoms can compute 10 million numbers 100 atoms can compute 100 billion billion Gbytes! C

Universal quantum computer (Deutsch 1985) 1. Well-behaved and controllable set of 2-state systems (e.g. atoms) = set of qubits = quantum register 2. Prepare initial state, e.g. all in ground state 3. ingle-bit gate = general rotation of any one qubit ufficient to 4. Two-bit logic gate (for example, controlled-rotation) simulate AY between chosen neighbouring pairs quantum evolution! 5. Measure final state

Entanglement and quantum parallelism A B A 0 B 0 FT x x U f (x) 0 f (x) FT The computer: 2 registers, n qubits each etwork diagram time 2 n -1 Fourier transform network: 0 0 x=0 x 0 Effect of U: 2 n -1 x=0 2 n -1 x=0 x 0 x f (x) Quantum Parallelism The periodicity of f(x) in register B is now reflected in register A by entanglement econd Fourier transform: reorganise register A to move a random offset into the overall phase of the state makes the (inverse) period appear in measured result.

A quantum algorithm: e.g. period-finding 14 17 6 3 18 9 2 6 21 27 34 45 7 8 12 22 28 36 47 98 5 19 23 33 25 37 52 63 83 92 16 32 43 87 72 73 91 31 24 11 4 38 51 14 17 6 3 18 9 2 6 21 27 ext, observe ( measure ) B. A B A,B= 0, 14 & 1, 17 & 2, 6 & 3, 3 & 4, 18... e.g. suppose number 17 is found in B. uddenly, by entanglement, the only numbers left in A are 1, 43, 85,...

The Quantum Computer: period-finding A,B= Finally, observe ( measure ) A. A B & 1, 17 & 43, 17 & 85, 17 & 127,17... The number in A gives the period r of the Fourier series, and the period of the original function is p = / r.

Feasibility? To factorize a 200-digit (600 bit) number the algorithm needs approximately 2n = 1000 qubits, n 3 = 10 9 operations Therefore each operation has to have precision about 1 part in 10 9!! This looks impossible.

Controlling errors tabilization requires detection and feedback, BUT you can t observe a quantum state without disturbing it!

Quantum Error Correction H H H H H H H Fault-tolerant quantum error correction network H H H H H H H quantum network for preparing error-correcting code word, and getting error syndrome Quantum information is now distributed in a subtle way in multi-qubit entangled states With these states we can find global check measurements which observe (and disturb) the errors without observing the stored quantum information.

Most financial and diplomatic transactions done in the world today derive their security from coding methods which a quantum computer can break but you can still resort to very long keys. Fortunately, quantum mechanics also provides new methods that allow truly unbreakable codes. However, the most interesting scientific and commercial application of quantum computers is in quantum chemistry and biochemistry possible impact on pharmaceuticals etc. The other thing I learn from all this is how subtle and wonderful the world is.