Qubit and Quantum Gates

Similar documents
where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

Topological quantum computation. John Preskill, Caltech Biedenharn Lecture 4 15 September 2005

John Preskill, Caltech KITP 7 June 2003

arxiv: v2 [quant-ph] 15 Aug 2008

Graph States EPIT Mehdi Mhalla (Calgary, Canada) Simon Perdrix (Grenoble, France)

arxiv: v1 [quant-ph] 2 Apr 2007

Spin Networks and Anyonic Topological Quantum Computing. L. H. Kauffman, UIC.

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)

Learning Objectives of Module 2 (Algebra and Calculus) Notes:

1.3 SCALARS AND VECTORS

Automatic Synthesis of New Behaviors from a Library of Available Behaviors

Engr354: Digital Logic Circuits

Polarimetric Target Detector by the use of the Polarisation Fork

LIP. Laboratoire de l Informatique du Parallélisme. Ecole Normale Supérieure de Lyon

Topological Quantum Compiling

A Hierarchical Approach to Computer-Aided Design of Quantum Circuits

Hexagonal Arrays for Fault-Tolerant Matrix Multiplication

Dense Coding, Teleportation, No Cloning

Electromagnetism Notes, NYU Spring 2018

Lecture 1 - Introduction and Basic Facts about PDEs

Symmetrical Components 1

PoS(LL2016)035. Cutkosky Rules from Outer Space. Dirk Kreimer Humboldt Univ.

Behavior Composition in the Presence of Failure

5. Every rational number have either terminating or repeating (recurring) decimal representation.

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

University of BRISTOL. Department of Physics. Final year project

PH12b 2010 Solutions HW#3

Squeezing Transformation of Three-Mode Entangled State

Operations Algorithms on Quantum Computer

Spin Networks and Anyonic Topological Quantum Computing L. H. Kauffman, UIC.

arxiv: v4 [cond-mat.stat-mech] 18 May 2017

Génération aléatoire uniforme pour les réseaux d automates

GRAND PLAN. Visualizing Quaternions. I: Fundamentals of Quaternions. Andrew J. Hanson. II: Visualizing Quaternion Geometry. III: Quaternion Frames

Energy Bands Energy Bands and Band Gap. Phys463.nb Phenomenon

A Transformation Based Algorithm for Reversible Logic Synthesis

Entanglement Purification

Dong-Myung Lee, Jeong-Gon Lee, and Ming-Gen Cui. 1. introduction

Lecture Notes No. 10

The University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS

Figure 1. The left-handed and right-handed trefoils

Logic Synthesis and Verification

Digital quantum simulation of fermionic models with a superconducting circuit

Quantum Mechanics Qualifying Exam - August 2016 Notes and Instructions

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Synthesis, testing and tolerance in reversible logic

Dynamic Template Matching with Mixed-polarity Toffoli Gates

mmr The quantity a2x(a; Ah) is a monotonic increasing function of a and attains its 4irp

Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata

Worksheet #2 Math 285 Name: 1. Solve the following systems of linear equations. The prove that the solutions forms a subspace of

On the Origin of Charge-Asymmetric Matter. I. Geometry of the Dirac Field

Sufficient condition on noise correlations for scalable quantum computing

f (x)dx = f(b) f(a). a b f (x)dx is the limit of sums

arxiv: v1 [math.ca] 21 Aug 2018

DETC2016/MESA INFORMATION FUSION IN POLAR COORDINATES

arxiv:hep-ph/ v2 17 Jun 1999

Hybrid Systems Modeling, Analysis and Control

A Non-parametric Approach in Testing Higher Order Interactions

MATRIX INVERSE ON CONNEX PARALLEL ARCHITECTURE

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS

Co-ordinated s-convex Function in the First Sense with Some Hadamard-Type Inequalities

ANALYSIS AND MODELLING OF RAINFALL EVENTS

Memory Minimization for Tensor Contractions using Integer Linear Programming.

Fierz transformations

arxiv: v1 [math.ct] 8 Sep 2009

Research Collection. Quantum error correction (QEC) Student Paper. ETH Library. Author(s): Baumann, Rainer. Publication Date: 2003

Something found at a salad bar

Linear Algebra Introduction

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Exercise 3 Logic Control

VECTOR ALGEBRA. Syllabus :

A Family of Logical Fault Models for Reversible Circuits

THREE DIMENSIONAL GEOMETRY

Aike ikx Bike ikx. = 2k. solving for. A = k iκ

A Hierarchical Approach to Computer-Aided Design of Quantum Circuits

EFFICIENT SYMBOLIC COMPUTATION FOR WORD-LEVEL ABSTRACTION FROM COMBINATIONAL CIRCUITS FOR VERIFICATION OVER FINITE FIELDS

Tutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.

Does the electromotive force (always) represent work?

arxiv:math-ph/ v1 6 Jun 2003

arxiv: v1 [hep-ph] 11 Sep 2018

Arbitrary superpositions of quantum operators by single-photon interference

Measurement-Only Topological Quantum Computation

Lecture 6: Coding theory

Propositional models. Historical models of computation. Application: binary addition. Boolean functions. Implementation using switches.

ONE of the great engineering challenge of this century is

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

Spacetime and the Quantum World Questions Fall 2010

Continuous Quantum Systems

Chapter 3. Vector Spaces. 3.1 Images and Image Arithmetic

Math 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)

Lecture Summaries for Multivariable Integral Calculus M52B

Random subgroups of a free group

Arrow s Impossibility Theorem

Gauss Quadrature Rule of Integration

TENSOR FORM OF SPECIAL RELATIVITY

Chapter 3. Vector Spaces

arxiv: v1 [quant-ph] 19 Dec 2017

A Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version

Generalized Kronecker Product and Its Application

Chern Simons D = 3, N = 6 superfield theory

DEFINITION The inner product of two functions f 1 and f 2 on an interval [a, b] is the number. ( f 1, f 2 ) b DEFINITION 11.1.

Transcription:

Quit nd Quntum Gtes Shool on Quntum omputing @Ygmi Dy, Lesson 9:-:, Mrh, 5 Eisuke Ae Deprtment of Applied Physis nd Physio-Informtis, nd REST-JST, Keio University

From lssil to quntum Informtion is physil - Rolf Lnduer QUANTUM informtion or quntum INFORMATION? It depends on your kground physis or informtion siene Ultimtely, you need oth At the eginning, it would e etter to keep one perspetive physis here

Referenes Quntum omputtion nd Quntum Informtion nd referenes therein, M. A. Nielsen nd I. L. hung, mridge University Press Dy, Lesson - Dy, Lesson Physil Review A 65, 3, N. D. Mermin Dy, Lesson L. M. K. Vndersypen, Ph. D Thesis ville t riv: qunt-ph/593 Dy, Lesson

Outline Rules of the gme Quntum it Stte spe Quntum gte Unitry evolution NOT, Y,, Hdmrd H Mesurement Multiple-quit Tensor produt NOT, SWAP, ontrolled-, Toffoli

Quntum it For physiists, quntum it quit is synonym for quntum mehnil two-level system g e Superposition

Quntum it Vetor nottion for omputtionl sis sttes POSTULATE ψ α β α α β α, β : Proility mplitude Stte spe Hilert spe β : Proilities sum to

Unitry evolution POSTULATE The evolution of quit system is desried y unitry trnsformtion suh s ψ t U ψ t Hermitin onjugte: A A T * Hermitin self-djoint: A A Unitry: UU I d * * d * *

Unitry evolution ih d ψ onnetion with the Shrödinger eqution dt H ψ H: Hmiltonin of the quit system Hermitin ih t t ψ t exp ψ t U ψ t h Exponentil opertor unitry Any unitry opertor U n e relized in the form U expih where H is some Hermitin opertor For now, tul physil systems tht relize neessry Hmiltonins re NOT our interest

Quntum gte ψ t U ψ t Input U Output ψ t ψ t Suessive implementtion Time L ψ ψ U U U 3 U n U ψ U U ψ Time U LU U n ψ

Quntum gte Input ψ α β Output U U ψ U α β We hve infinite inputs, ut it suffies to onsider only the omputtionl sis sttes U U Superposition priniple U α U β U U ψ U U

NOT gte lssil NOT Input output Quntum NOT The only non-trivil one-it gte in the lssil se or Mtrix representtion

Mtrix representtion The first olumn represents the finl stte of The seond olumn represents the finl stte of

Puli-, Y, gtes i i Y i Y i Y Y i iy i Y i Y Y Y ], [ ], [ ], [ I Y }, { }, { }, { Y Y Hermitin ommuttion reltions

Hdmrd gte, H,,, H H H H H HH Y HYH HH H I Hermitin iruit identities

Mesurement gte POSTULATE ψ α β Quntum it lssil it Mthemtil desription Generl mesurement Projetive mesurement POVM with proility α, or with proility β

Multiple-quit How do we desrie multiple-quit sttes? omputtionl sis sttes for two-quit sttes my e written s,,, We require them to e orthogonl, so they my e written s Speultion A multiple-quit stte is the tensor produt of the omponent quit systems POSTULATE

Tensor produt omputtionl sis set for -quit sttes Mtrix representtion

Multiple-quit gtes 3 U U 3 L n M M n n : n -dimensionl vetor U : n y n unitry mtrix

Independent gtes H H Y H H Y YH H H YH H YH U 8 y 8 unitry mtrix 4 4 4 4 3 4 4 3 4 3 3 4 3 3 3 3 4 3 4 3 4 3 B B B B B A

ontrolled-u gtes ontrol it if Trget it U U U if U n e n ritrry single-quit gte U works only when U is just forml expression

NOT gte if if,,, Frequently used

NOT gte,,, Never mistke

SWAP gte SWAP 3 4 To implement SWAP, we need to. Enode informtion on into nd quit. Erse informtion on from st quit 3. Enode informtion on into st quit 4. Erse informtion on from nd quit

ontrolled- gte ontrolled- is nonlol

Toffoli Toffoli Toffoli is often referred to s ontrolled-ontrolled-not -NOT

Quiz Prove the following iruit identity Also prove the followings H I HH Use the following expressions for quntum gtes H,

Answer 3 3 sde implementtion sde ersure

Answer H HH onstrutive nd destrutive interferenes

Answer H H HH onstrutive nd destrutive interferenes