Chapter 2. Basic Principles of Quantum mechanics

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

Some Introductory Notes on Quantum Computing

Quantum computing! quantum gates! Fisica dell Energia!

Short Course in Quantum Information Lecture 2

CS257 Discrete Quantum Computation

Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871

QLang: Qubit Language

Quantum Entanglement and the Bell Matrix

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

Factoring on a Quantum Computer

. Here we are using the standard inner-product over C k to define orthogonality. Recall that the inner-product of two vectors φ = i α i.

Lecture 3: Hilbert spaces, tensor products

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

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

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation

Lecture 2: Introduction to Quantum Mechanics

Chapter 10. Quantum algorithms

6. Quantum error correcting codes

Quantum Gates, Circuits & Teleportation

Single qubit + CNOT gates

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

2. Introduction to quantum mechanics

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

Chapter 11 Evolution by Permutation

1 Measurements, Tensor Products, and Entanglement

Introduction to Quantum Computing

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

Linear Algebra and Dirac Notation, Pt. 1

Lecture 1: Introduction to Quantum Computing

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

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

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

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

Principles of Quantum Mechanics Pt. 2

M.L. Dalla Chiara, R. Giuntini, R. Leporini, G. Sergioli. Qudit Spaces and a Many-valued Approach to Quantum Comp

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

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

PHY305: Notes on Entanglement and the Density Matrix

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

QUANTUM COMPUTER SIMULATION

1 Readings. 2 Unitary Operators. C/CS/Phys C191 Unitaries and Quantum Gates 9/22/09 Fall 2009 Lecture 8

DEVELOPING A QUANTUM CIRCUIT SIMULATOR API

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

C/CS/Phys 191 Quantum Gates and Universality 9/22/05 Fall 2005 Lecture 8. a b b d. w. Therefore, U preserves norms and angles (up to sign).

Lecture 1: Introduction to Quantum Computing

Quantum Information & Quantum Computation

Quantum Computing Lecture 2. Review of Linear Algebra

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

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

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Introduction into Quantum Computations Alexei Ashikhmin Bell Labs

1 Fundamental physical postulates. C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12

Quantum Computing: Foundations to Frontier Fall Lecture 3

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

Quantum Entanglement and Error Correction

Lecture 4: Postulates of quantum mechanics

Lecture 11 September 30, 2015

1. Basic rules of quantum mechanics

Basic Quantum Mechanics Prof. Ajoy Ghatak Department of Physics Indian Institute of Technology, Delhi

Quantum Computation. Alessandra Di Pierro Computational models (Circuits, QTM) Algorithms (QFT, Quantum search)

Lecture 3: Constructing a Quantum Model

Introduction to Quantum Computing for Folks

Quantum Complexity Theory and Adiabatic Computation

The Postulates of Quantum Mechanics

SUPERDENSE CODING AND QUANTUM TELEPORTATION

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

Quantum Mechanics II: Examples

Lecture 2: From Classical to Quantum Model of Computation

State. Bell State Exercises

Qubits vs. bits: a naive account A bit: admits two values 0 and 1, admits arbitrary transformations. is freely readable,

arxiv: v4 [cs.dm] 19 Nov 2018

Lecture 13B: Supplementary Notes on Advanced Topics. 1 Inner Products and Outer Products for Single Particle States

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

Quantum Mechanics- I Prof. Dr. S. Lakshmi Bala Department of Physics Indian Institute of Technology, Madras

Quantum Computers. Todd A. Brun Communication Sciences Institute USC

Shor s Prime Factorization Algorithm

Quantum Physics II (8.05) Fall 2002 Assignment 3

DECAY OF SINGLET CONVERSION PROBABILITY IN ONE DIMENSIONAL QUANTUM NETWORKS

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

IBM quantum experience: Experimental implementations, scope, and limitations

Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions

Quantum Information & Quantum Computing

1 Measurement and expectation values

Decomposition of Quantum Gates

6.896 Quantum Complexity Theory September 18, Lecture 5

Gates for Adiabatic Quantum Computing

Unitary Dynamics and Quantum Circuits

6.896 Quantum Complexity Theory September 9, Lecture 2

D.5 Quantum error correction

Ph 219b/CS 219b. Exercises Due: Wednesday 21 November 2018 H = 1 ( ) 1 1. in quantum circuit notation, we denote the Hadamard gate as

A Quantum Associative Memory Based on Grover s Algorithm

ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL

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

Basics on quantum information

arxiv: v3 [cs.dm] 13 Feb 2018

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

Introduction to Quantum Computing

Is Quantum Search Practical?

AN INTRODUCTION TO QUANTUM COMPUTING

Chapter 2. Mathematical formalism of quantum mechanics. 2.1 Linear algebra in Dirac s notation

Transcription:

Chapter 2. Basic Principles of Quantum mechanics In this chapter we introduce basic principles of the quantum mechanics. Quantum computers are based on the principles of the quantum mechanics. In the classical computation we are familiar with bits and we use Boolean algebra. Please read the following analysis: In physics there are some models describe physical events in the macroscopic universe and microscopic universe. For instance, working principle of an engine based on laws of thermodynamics. If this sentence make sense then you realized the second law! Research and development in the physics, leads to the production to the high-technological devices, computers, scientific instruments, electronics technology, communication technology, as well as scientific papers and patents. I hope at the end of this course your point of view to technological developments will improve and you realize existence of a bridge between theory and practice. Quantum computation is based on SUPERPOSITION and COMPOSITION of the state. In the classical computation we cannot obtain superposition of two binary number (bit) 1 and 0. In quantum computation it is possible to obtain mixture of two quantum bit (qubits): i.e spin up and spin down electron. The representations of bit and qubit are: The representation is known as DIRAC notation which is called a KET vector. In the classical system we can not express a bit as decomposition of the bits. The ket vectors also represented by: The quantum theory is the "theory of everything". Note that one can complete all of the calculations of the quantum computation by using simple matrix and vector algebra! In this lecture we will discuss: Four postulates of QM States: Dirac notation (Bra-Ket notation), Pauli Spin Matrices Transformation of the states: Pauli Gates Measurement Composite systems & Entanglement States: Dirac notation (Bra-Ket notation), Pauli Spin Matrices A quantum mechanical system completely described by a state vector. A state vector include all information about the quantum system. In classical computation all computations based on a bit in the base 2 number system. In quantum computation theory the computation based on state (qubits). As you see that this open a new way to the computation theory! A stationary state corresponds to a quantum state with a single definite energy. A superposition state is mixture of stationary states. (For more details come to class) Consider two level quantum system (for example spin up and down state of the electron). Wave function of the system may be written as the superposition of the spins:

The wave should be normalized. Then BRA of the wave function can be written as Normalization yields: Note that are orthogonal vectors, then The expression reads as follows. The state is with probability and with a probability. Transformation of the states: Pauli Gates Time evolution of a quantum system in the Hilbert space is described by a unitary transformation, generally by using unitary matrices. Unitary matrix is defined as follows: If transpose conjugate of a matrix U is equal to the inverse of matrix then the matrix is known as unitary matrix. Note that transpose conjugate of U can be abbreviated as U + and satisfy the relation U + U=I (unit matrix). Examples: The matrices are unitary and first 3 matrices are known as Pauli Matrices. Transformation of the state can be realized as change of the physical situation of the quantum particle from one state to other. Pauli Matrices are mathematical representations of the transformation of spin state of the particles. Technically the spin of the particles can be changed by applying magnetic field. Consider a particle of zero (down) spin. By applying magnetic field we can change the direction of the spin to. This transformation mathematically represented as: Explicitly Generally, transformation of the state with a unitary matrix can be expressed as i.e: Means, the quantum particle has a spin up and down with probability a and b respectively. The state of the particle can be changed by applying an external field. New spin state of the particle is again up and down, but in this case the probabilities are b and a respectively. One of the important transformation can be done by the matrix:, is known as Hadamard Matrix. This transformation is:

Before going further, let us practically construct some simple quantum gates namely PAULI GATES. As it is mentioned before this gates physically realized by using material (ions, for instance) whose spins controlled by magnetic field. Similar devices also constructed by using semi transparent mirrors and polarization properties of the photos. The devices also constructed by using an appropriate crystal and again polarization properties of the photons. Pauli X-Gate X Pauli Y-Gate Y Pauli Z-Gate Z Exercise: Show that XY=iZ, YZ=iX, ZX=iY and X 2 =Y 2 =Z 2 =I. One can also construct a gate using the transformation matrix:. This gate is known as Walsh-Hadamard gate that is one ofthe important gate of the quantum computers. Walsh Hadamard H-Gate

H Measurement Measurement of a qubit is another postulates of a quantum mechanics and play an important role in the quantum computation. Consiter a state. We want to measure a or/and b in order to determine output of the calculation. Unfortunately quantum mechanics does not allow determination of a and b. However, quantum we can obtain an indirect information about the state. The measurement always disturb the system then only one of the output can be determined with a probalities: As an example for the given state the probabilities. The postulate can be stated as follows: Quantum measurements can be described by measuring transformation of the state by the operator, mathematically Consider operators.probability of measurement of the output is and the state vector Then the probability of measuring the state are. Composite systems & Entanglement Mathematical Supplement As in the digital computation system, using simple quantum logic gates we can design more complicated circuits. For multi uncoupled qubits (state), the state of the composite system is given by tensor product or direct product of the matrix representation. Consider tensor product of two qubit system: These two qubit states can be represented by matrices: Then tensor product of two matrices are given by:

The quantum computation requires this multiplication. Sometimes we might want to compute effect of a gate conditionally. The mathematical operation composing gates conditionally is the direct sum of the corresponding unitary matrices. Direct sum of two matrices can be described as: We will turn our attention to the composition of multi qubit systems in the next chapter. For a useful quantum computation device we have to construct multi-qubit quantum states. "The state space of a composite physical system is the tensor product of the state spaces of the component physical systems." Suppose that there are two states then tensor product produce multiple state (superposition of the states) such that For quantum systems tensor product captures the essence of superposition. Properties of tensor product will be introduced in the class!! Quantum entanglement Let us ask a question: how can we determine individual 1-qubit state of a 2-qubit quantum register: We recall the last postulate (composition) and define the states:, the tensor product If we ask the same question for the decomposition:, interestingly we can see that no individual 1-qubit state exist to form this decomposition. At first sight we can think that quantum mechanics does not allow this decomposition! If we decide to measure the first qubit then either will be measured with the probabilities respectively. In the computational basis if we measure qubit then without touching or measuring other qubit it is quantum state can be determined as. This shows that there is a mysterious connection between states!measurements of one qubit on the side effect another qubit. This shows that aforementioned entangled state can also be written as:. This effect seems to be in total contradiction with Einstain's theory of speed of light! Finally we define the entanglement state: If a multi qubit state can not be factored into individually one qubit state then the state is called entangled state. Entanglement is an important phenomenon in multi-qubit quantum memory registers and many quantum algorithms.