Quantum Computers The basics. Introduction 2/47 Dušan Gajević.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Matrix Representation
Puzzle Twin primes are two prime numbers whose difference is two.
Quantum Computers Gates, circuits and programming.
Quantum One: Lecture 16.
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Linear Transformations
Wavefunction Quantum mechanics acknowledges the wave-particle duality of matter by supposing that, rather than traveling along a definite path, a particle.
Review of Basics and Elementary introduction to quantum postulates.
DENSITY MATRICES, traces, Operators and Measurements
Chien Hsing James Wu David Gottesman Andrew Landahl.
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
Review of Basics and Elementary introduction to quantum postulates.
Group work Show that the Sx, Sy and Sz matrices can be written as a linear combination of projection operators. (Projection operators are outer products.
CSEP 590tv: Quantum Computing
Quantum Computing Joseph Stelmach.
Orthogonality and Least Squares
4. The Postulates of Quantum Mechanics 4A. Revisiting Representations
Dirac Notation and Spectral decomposition
Introduction to Quantum logic (2) Yong-woo Choi.
Quantum Information Processing
Quantum One: Lecture 7. The General Formalism of Quantum Mechanics.
CSEP 590tv: Quantum Computing Dave Bacon June 29, 2005 Today’s Menu Administrivia Complex Numbers Bra’s Ket’s and All That Quantum Circuits.
Presented by: Erik Cox, Shannon Hintzman, Mike Miller, Jacquie Otto, Adam Serdar, Lacie Zimmerman.
Quantum Computing MAS 725 Hartmut Klauck NTU
1 1.1 © 2012 Pearson Education, Inc. Linear Equations in Linear Algebra SYSTEMS OF LINEAR EQUATIONS.
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 14 (2009)
Debasis Sadhukhan M.Sc. Physics, IIT Bombay. 1. Basics of Quantum Computation. 2. Quantum Circuits 3. Quantum Fourier Transform and it’s applications.
Eigenvectors and Eigenvalues
IPQI-2010-Anu Venugopalan 1 Quantum Mechanics for Quantum Information & Computation Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Alice and Bob’s Excellent Adventure
Michael A. Nielsen University of Queensland Quantum Mechanics I: Basic Principles Goal of this and the next lecture: to introduce all the basic elements.
Quantum Computers Algorithms and applications. Simulating classical operations 2/41 Dušan Gajević.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 2117 Lecture.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Solving mutual exclusion by using entangled Qbits Mohammad Rastegari proff: Dr.Rahmani.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
A brief introduction to Quantum computer
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 20 (2009)
1 Quantum Computing Lecture Eleven. 2 Outline  Shrinking sizes of electronic devices  Modern physics & quantum world  Principles of quantum computing.
MODELING MATTER AT NANOSCALES 6.The theory of molecular orbitals for the description of nanosystems (part II) The density matrix.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Quantum Two 1. 2 Angular Momentum and Rotations 3.
Mathematical Tools of Quantum Mechanics
Basic Q.C. One moose, two moose Red moose, blue moose Live moose, dead moose.
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture (2011)
Density matrix and its application. Density matrix An alternative of state-vector (ket) representation for a certain set of state-vectors appearing with.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Quantum gates SALEEL AHAMMAD SALEEL. Introduction.
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Postulates of Quantum Mechanics
Introduction to Quantum Computing Lecture 1 of 2
Quantum One.
4. The Postulates of Quantum Mechanics 4A. Revisiting Representations
Quantum One.
Lecture on Linear Algebra
A Ridiculously Brief Overview
Quantum One.
Introduction to Quantum logic (2)
OSU Quantum Information Seminar
Linear Vector Space and Matrix Mechanics
Presentation transcript:

Quantum Computers The basics

Introduction 2/47 Dušan Gajević

Introduction Quantum computers use quantum-mechanical phenomena to represent and process data Quantum mechanics can be described with three basic postulates – The superposition principle - tells us what states are possible in a quantum system – The measurement principle - tells us how much information about the state we can access – Unitary evolution - tells us how quantum system is allowed to evolve from one state to another 3/47 Dušan Gajević

Atomic orbitals - an example of quantum mechanics Introduction Electrons, within an atom, exist in quantized energy levels (orbits) A hydrogen atom – only one electron Limiting the total energy…...limits the electron to k different levels This atom might be used to store a number between 0 and k-1 4/47 Dušan Gajević

The superposition principle 5/47 Dušan Gajević

The superposition principle states that if a quantum system can be in one of k states, it can also be placed in a linear superposition of these states with complex coefficients Ways to think about superposition – Electron cannot decide in which state it is – Electron is in more than one state simultaneously The superposition principle 6/47 Dušan Gajević

The superposition principle State of a system with k energy levels “pure” states amplitudes “ket psi” Bra-ket (Dirac) notation Reminder: 7/47 Dušan Gajević

The superposition principle A system with 3 energy levels – examples of valid states 8/47 Dušan Gajević

“Very interesting theory – it makes no sense at all” – Groucho Marx 9/47 Dušan Gajević

The measurement principle 10/47 Dušan Gajević

The measurement principle The measurement principle says that measurement on the k state system yields only one of at most k possible outcomes and alters the state to be exactly the outcome of the measurement 11/47 Dušan Gajević

The measurement principle It is said that quantum state collapses to a classical state as a result of the measurement 12/47 Dušan Gajević

The measurement principle If we try to measure this state... …the system will end up in this state… …and we will also get it as a result of the measurement The probability of a system collapsing to this state is given with 13/47 Dušan Gajević

The measurement principle This means: – We can tell the state we will read only with a certain probability – Repeating the measurement will always yield the same result we got this first time – Amplitudes are lost as soon as the measurement is made, so amplitudes cannot be measured 14/47 Dušan Gajević

The measurement principle Probability of a system collapsing to a state j is given with – One might ask, if amplitudes come down to probabilities when the state is measured, why use complex amplitudes in the first place? Answer to this will be given later, when we see how system is allowed to evolve from one state to another Does the equation appear more natural now? 15/47 Dušan Gajević

“God does not play dice” – Albert Einstein “Don’t tell God what to do” – Niels Bohr 16/47 Dušan Gajević

Qubit 17/47 Dušan Gajević

Isolating two individual levels in our hydrogen atom and the qubit (quantum bit) is born Qubit 18/47 Dušan Gajević

Qubit Qubit state The measurement collapses the qubit state to a classical bit 19/47 Dušan Gajević

Vector reprezentation 20/47 Dušan Gajević

Pure states of a qubit can be interpreted as orthonormal unit vectors in a 2 dimensional Hilbert space – Hilbert space – N dimensional complex vector space Vector representation Reminder: Another way to write a vector – as a column matrix 21/47 Dušan Gajević

Vector representation Column vectors (matrices) qubit statepure states a little bit of math Reminder: Adding matrices Reminder: Scalar multiplication 22/47 Dušan Gajević

Vector representation System with k energy levels represented as a vector in k dimensional Hilbert space system statepure states 23/47 Dušan Gajević

Entanglement 24/47 Dušan Gajević

Entanglement Let’s consider a system of two qubits – two hydrogen atoms, each with one electron and two "pure" states 25/47 Dušan Gajević

Entanglement By the superposition principle, the quantum state of these two atoms can be any linear combination of the four classical states – Vector representation Does this look familiar? 26/47 Dušan Gajević

Entanglement Let’s consider the separate states of two qubits, A and B – Interpreting qubits as vectors, their joint state can be calculated as their cross (tensor) product Reminder: Tensor product 27/47 Dušan Gajević

Entanglement – Cross product in Dirac notation is often written in a bit different manner The joint state of A and B in Dirac notation 28/47 Dušan Gajević

Entanglement It’s impossible! all four have to be non-zero at least one has to be zero Let’s try to decompose to separate states of two qubits 29/47 Dušan Gajević

Entanglement States like the one from the previous example are called entangled states and the displayed phenomenon is called the entanglement – When qubits are entangled, state of each qubit cannot be determined separately, they act as a single quantum system – What will happen if we try to measure only a single qubit of an entangled quantum system? 30/47 Dušan Gajević

Entanglement Let’s take a look at the same example once again amplitudesprobabilities 31/47 Dušan Gajević

Entanglement measuring the first qubit measuring the second qubit value of the first qubit value of the second qubit This remains true no matter how large the distance between qubits is! 32/47 Dušan Gajević

“Spooky action at a distance” – Albert Einstein 33/47 Dušan Gajević

Unitary evolution 34/47 Dušan Gajević

Unitary evolution means that transformation of the quantum system state does not change the state vector length – Geometrically, unitary transformation is a rigid body rotation of the Hilbert space Unitary evolution 35/47 Dušan Gajević

It comes down to mapping the old orthonormal basis states to new ones – These new states can be described as superpositions of the old ones Unitary evolution 36/47 Dušan Gajević

Unitary evolution Unitary transformation of a single qubit – Dirac notation – Matrix representation Replace the old basis states… …with new ones Multiply unitary matrix… …with the old state vector 37/47 Dušan Gajević

Unitary evolution Example of calculus using Dirac notation Qubit is in the state… …applying following (Hadamard) transformation… …results in the state 38/47 Dušan Gajević

Unitary evolution Example of calculus using matrix representation Qubit is in the state… …applying Hadamard transformation… Reminder: matrix multiplication …results in the state 39/47 Dušan Gajević

Unitary matrices Unitary matrices satisfy the condition Conjugate-transpose of U “U-dagger” Reminder: Conjugate-transpose matrix Reminder: Complex conjugate Inverse of U Reminder: Inverse matrix Identity matrix Reminder: 40/47 Dušan Gajević

Reversibility 41/47 Dušan Gajević

Reversibility Reversibility is an important property of unitary transformation as a function – knowing the output it is always possible to determine input – What makes an operation reversible? AND circuit NOT circuit INPUTOUTPUT ABA and B INPUTOUTPUT A not A output 1 0 A=1 B=1 input ? irreversible output 1 0 input A=0 A=1 reversible 42/47 Dušan Gajević

Reversibility – Reversible operation has to be one-to-one – different inputs have to give different outputs and vice-versa Consequently, reversible operations have the same number of inputs and outputs Are classical computers reversible? 43/47 Dušan Gajević

Reversibility – Similar to AND circuit applies to OR, NAND and NOR, the usual building blocks of classical computers Hence, in general, classical computers are not reversible 44/47 Dušan Gajević

Offtopic: Landauer’s principle Again, an irreversible operation – NAND circuit INPUTOUTPUT ABA nand B Whenever output of NAND is 1 – input cannot be determined We say information is “erased” every time output of NAND is 1 45/47 Dušan Gajević

Offtopic: Landauer’s principle Landauer’s principle says that energy must be dissipated when information is erased, in the amount – Even if all other energy loss mechanisms are eliminated irreversible operations still dissipate energy Reversible operations do not erase any information when they are applied Absolute temperature Boltzman's constant 46/47 Dušan Gajević

References University of California, Berkeley, Qubits and Quantum Measurement and Entanglement, lecture notes, Michael A. Nielsen, Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, Colin P. Williams, Explorations in Quantum Computing, Springer, London, Samuel L. Braunstein, Quantum Computation Tutorial, electronic document University of York, York, UK Bernhard Ömer, A Procedural Formalism for Quantum Computing, electronic document, Technical University of Vienna, Vienna, Austria, Artur Ekert, Patrick Hayden, Hitoshi Inamori, Basic Concepts in Quantum Computation, electronic document, Centre for Quantum Computation, University of Oxford, Oxford, UK, Wikipedia, the free encyclopedia, /47 Dušan Gajević