Quantum Computing. Part I. Thorsten Altenkirch

Similar documents
Quantum Computing. Thorsten Altenkirch

Basics on quantum information

6.896 Quantum Complexity Theory September 9, Lecture 2

Quantum Entanglement. Chapter Introduction. 8.2 Entangled Two-Particle States

Unitary evolution: this axiom governs how the state of the quantum system evolves in time.

Basics on quantum information

10 - February, 2010 Jordan Myronuk

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

Q8 Lecture. State of Quantum Mechanics EPR Paradox Bell s Thm. Physics 201: Lecture 1, Pg 1

3/10/11. Which interpreta/on sounds most reasonable to you? PH300 Modern Physics SP11

EPR Paradox Solved by Special Theory of Relativity

Introduction to Quantum Computing

Introduction to Quantum Computing

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

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

Quantum Measurement and Bell s Theorem

The Relativistic Quantum World

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

Alan Mortimer PhD. Ideas of Modern Physics

Has CHSH-inequality any relation to EPR-argument?

THE DELAYED CHOICE QUANTUM EXPERIMENT

Closing the Debates on Quantum Locality and Reality: EPR Theorem, Bell's Theorem, and Quantum Information from the Brown-Twiss Vantage

INTRODUCTION TO QUANTUM COMPUTING

Light was recognised as a wave phenomenon well before its electromagnetic character became known.

Algorithms, Logic and Complexity. Quantum computation. basic explanations! &! survey of progress

The chemistry between Newton and Schrodinger

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

The Quantum Handshake Explored

Bell s Theorem. Ben Dribus. June 8, Louisiana State University

Quantum Physics & Reality

- Presentation - Quantum and Nano-Optics Laboratory. Fall 2012 University of Rochester Instructor: Dr. Lukishova. Joshua A. Rose

Lecture 20: conp and Friends, Oracles in Complexity Theory

The Einstein-Podolsky-Rosen thought-experiment and Bell s theorem

2 The Failure of Classical Mechanics and Wave-Particle Duality

A proof of Bell s inequality in quantum mechanics using causal interactions

CS154, Lecture 17: conp, Oracles again, Space Complexity

QUANTUM ENTANGLEMENT AND ITS ASPECTS. Dileep Dhakal Masters of Science in Nanomolecular Sciences

Quantum Information Science (QIS)

David Bohm s Hidden Variables

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

Problems with/failures of QM

ACTIVITY 3. Light and Waves. Goal We will look at a property of light and learn how scientists conclude that light behaves as a wave.

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

Shor s Prime Factorization Algorithm

The Duality of Light. Electromagnetic Radiation. Light as a Wave

Quantum Computers. Peter Shor MIT

The nature of Reality: Einstein-Podolsky-Rosen Argument in QM

EPR Paradox and Bell Inequalities

U.S. ARMY RESEARCH, DEVELOPMENT AND ENGINEERING COMMAND

Great Theoretical Ideas in Computer Science. Lecture 7: Introduction to Computational Complexity

The Einstein-Podolsky-Rosen thought experiment and Bell s theorem

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

J = L + S. to this ket and normalize it. In this way we get expressions for all the kets

INTRODUCTORY NOTES ON QUANTUM COMPUTATION

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

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

Introduction to Bell s theorem: the theory that solidified quantum mechanics

Causation and EPR. But, alas, this hypothesis is mathematically inconsistent with the results of the case b runs, those runs

Einstein-Podolsky-Rosen paradox and Bell s inequalities

Henok Tadesse, Electrical engineer, BSc., Debrezeit, Ethiopia Mobile: or

How does it work? QM describes the microscopic world in a way analogous to how classical mechanics (CM) describes the macroscopic world.

Quantum Information Processing

The act of measuring a particle fundamentally disturbs its state.

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

Honors 225 Physics Study Guide/Chapter Summaries for Final Exam; Roots Chapters 15-18

Quantum Mechanics and Society Honors 208. Office: PH 319 Office: Hoyt 120. Hours:??? Hours:??? Course Description:

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

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

Quantum computing for beginners

Quantum Computing: Foundations to Frontier

Violation of Bell Inequalities

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation

conp = { L L NP } (1) This problem is essentially the same as SAT because a formula is not satisfiable if and only if its negation is a tautology.

Modern Physics notes Spring 2007 Paul Fendley Lecture 27

Quantum Computation, NP-Completeness and physical reality [1] [2] [3]

Physics 11b Lecture #24. Quantum Mechanics

MACROREALISM, NONINVASIVENESS and WEAK MEASUREMENT

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

CHAPTER 2: POSTULATES OF QUANTUM MECHANICS

Lesson Plan. 1) Students will be aware of some key experimental findings and theoretical

GW Virginia Science & Technology Campus

SCH4U: History of the Quantum Theory

Odd Things about Quantum Mechanics: Abandoning Determinism In Newtonian physics, Maxwell theory, Einstein's special or general relativity, if an initi

B. BASIC CONCEPTS FROM QUANTUM THEORY 93

Wave properties of matter & Quantum mechanics I. Chapter 5

D. Bouwmeester et. al. Nature (1997) Joep Jongen. 21th june 2007

6-1 Computational Complexity

Bell s inequalities and their uses

Cosmology Lecture 2 Mr. Kiledjian

Definition: conp = { L L NP } What does a conp computation look like?

Quantum Communication

MACROREALISM and WEAK MEASUREMENT

Bell's Inequalities Revisited

Lecture 2: Introduction to Quantum Mechanics

The Reality of Quantum Computing

Quantum reality. Syksy Räsänen University of Helsinki, Department of Physics and Helsinki Institute of Physics

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

Computability Theory

Great Ideas in Theoretical Computer Science

QUANTUM MECHANICS. So now we come to the theory which has quite literally

Transcription:

Quantum Computing Part I Thorsten Altenkirch

Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions

The Church-Turing thesis All computational formalisms define the same set of computable functions

The Church-Turing thesis All computational formalisms define the same set of computable functions What do we mean by all formalisms?

The Church-Turing thesis (CTT) All physically realizable computational formalisms define the same set of computable functions Most people believe CTT Hypercomputing?

The Church-Turing thesis All physically realizable computational formalisms define the same set of computable functions Most people believe CT Hypercomputing? Throw you TM in a black hole...

Feasible computation? Not all computable problems can be solved in practice. TAUT Example: Is (P Q R) (P Q R) a tautology? The best known algorithm for TAUT requires exponential time in the number of propositional variables.

The extended Church-Turing thesis (ECT) All physically realizable computational formalisms define the same set of feasible computable functions Challenged by non-standard computational formalisms P-systems inspired by biology Quantum Computing inspired by quantum physics

Factor & Primes FACTOR Input: a number (e.g. 15) Output: a (nontrivial) factor (e.g. 3 or 5) or prime PRIMES Input: a number (e.g. 15, 7) Output:yes (e.g. for 7) no (e.g. for 15) The best known algorithm for factorisation needs exponential time. Hence factorisation is not feasible. However, there is a polynomial algorithm for PRIMES (feasible). Important for public key cryptography (e.g. RSA)

Shor s algorithm Peter Shor (MIT) 1994 : Shor develops an (probabilistic) algorithm that would solve FACTOR in polynomial time on a (hypothetical) quantum computer. This indicates that the ECT doesn t hold for quantum computing

Activities Implement a program for factorisation in your favourite programming language. Try to make it as efficent as possible. Analyze its time complexity. Implement an efficient primality checker using a probabilistic algorithm (Hint: lookup Primality test on wikipedia).

Quantum Physics for dummies

Is light wave or particle? Light is made of particles Light is a wave Isaac Newton (1643-1727) Christiaan Huygens (1629 1695)

Young s double slit experiment In 1801 Thomas Young performed the double slit experiment It produces an interference pattern Light is a wave!

The photoelectric effect Photons can dislocate electrons in certain materials The energy of the electrons only depends on the frequency of the light Not on intensity! Below a certain intensity no electrons can dislocated. Conclusion: light consists of particles (photons).

Wave particle duality Electrons also behave this way. Copenhagen interpretation Particles are probability waves Amplitude corresponds to the probability that we observe the particle. Niels Bohr (1885 1962)

Einstein-Podelsky-Rosen paradox (EPR) Thought experiment about non-locality Two particles with opposite spin are produced. They are measured far apart. According to QM we always measure both particle if we measure one. EPR argue that there have to be hidden variables

Bell inequality Local variables or non-locality? Is there an experiment to show who is right? Bell showed that there are experiments which refute hidden-variable theory An intuitive account of Bell s theorem has been given by Mermin

Mermin s thought experiment Each time we press the button on C both detectors show a red or green light. If both detectors have the same settings (1,2,3) the same light goes on. If the detectors have different settings the same light goes on in 1/4 of the cases.

The conundrum of the device Each particle has to carry the information which light to flash for each setting (3 bits). Both particles have the same instruction set. Assume the instruction set is RRG. If we measure different bits, the same light goes on in at least 1/3 of all cases. The same is true for all other instruction sets. This is incompatible with the observation that same light went on only in 1/4 of all cases!

Non-locality rules! Mermin s experiment cannot explain by hidden variables. QM has a simple explanation: We are measuring the spin of entangled particles with orientations 0º, 120º, 240º. If the settings are different, the probability that the measurements agree is given by and: cos 2 0 2 =1 cos 2 120 2 = cos 2 240 2 = 1 4 cos 2 θ 2 While Mermin s experiment is a thought experiment, similar experiments have been carried out in practice.

Activities Compile a survey about experiments to test the Bell-inequality. What are the issues? Read Mermin s article (on the webpage, only 5 pages, easy reading) and try to explain it to sb else. Record your conversation. Implement a program (in your favourite language) that simulates Mermin s experiment using the quantum mechanic explanation (i.e. using cos and random numbers).