Download as pdf or txt
Download as pdf or txt
You are on page 1of 4

buieding blocks that

carry
out elementary computation: called gates

ir-falgorithmT-ES-ingle-qebi.tn
gates

Classical example : NOT I -
Do -
f

quantum example s : as
quantum theory is unitary ,
quantum gates are re
presented by
unitary matrices : ÜU = 11 recall
)
""

:(
""
Dirac notation : U
u"
= " 00/0×01 + Von / 0×11
Uno

( G ))
+4^011×01 11×11
[× 10×11 11×01 um
*
= +
-
=

Dirac notation

↳ 5×10 > =

( ! f) µ) (G) 113 6×117=40×11+11×01)


114--10×1,4 INGE
+ 10>
.

• : = =
.

bit flip I NOT -

gate ,
e.
g.
M) -
☒ -
h> rotation around ×
-

axis
T
by
-

a. =
|! !) =
10×01-11×11

↳ tz / +> =
(JG ) ¥ / ! ) ¥ (1) .
= = 1- ) ,
TH -
>= (10×01-11×11) ¥110 > - -
H)

phase flip rotation around


=
¥ Ho> + H ) It>
=

z -

axis by it

sry
=
|? = i. a. Tz bit & phase flip
oh , Ty & Tz are the so -
called Pauli matrices and a?
-11=1 ! !) (does
nothing)
together with
identity 11 they forma basis of 2×2 matrices

(→ any 1-
qubit rotation can be written as a linear combination of them)
-
Hadamard gate :
one of the most
important gates for quantum circuits

H
:# | ) ) ) für =
( 10×01 +10×111-11×01 -

11×11)

↳ HIO> =
Iz | ! ! ) | ! ) -
:
¥ (f) = It >
,
HH > =
¥ /10×01+10×1/ +11×01-11×111.11 # (107-11)--1 > = -
)

create Superposition ! also Hlts los HH H


-
.

,
>
> used to
change between ✗ & 2- basis

similarly ,
as 5=1^0 ! ) adds 90° to the phase y S : .
HS Hi> St > =/ i>
-
.

,
-

S H
-

is
applied to charge from Z to Y basis
pamrtitegaantamstatesaibz.ae
Eddi

use
( %) (! ) ( %!}:)
tensor products to describe multiple states : la> ☒ lbs =

! =

example :
system A is in state 11 >a and
system B is in state 10>
ß

the total lbipartite) state is 110>* ß : =


11h .
☒ 107s
=
(9) (b) ☒ =

( §)
↳ remark : states of this form are called uncorrdated ,
but there are also b.partita states that cannot

be written as 14h .
a- / y >ß .
Those states are corrdated and sometimes even

entangled ( very Strong


→ correlation) .
e.
g.
14%, =

¥ ( 100>Aßt 111
) =

II ( Tg)
a so
-
called Bell state ,
used for teleportation cryptography
.
,
Bell tests etc
,
.

Inwendigatesm
Classical
example XOR
§ -1×0121 ✗ ⑦ irreversible ( given the output cannot
• -

y

:
we

recover the
input )
BUT :
as
quantum theory is
unitary ,
we
only consider
unitary and therefore reversible gates
quantum example
°o°
• :

Ö
( NOT= 100×0014 101×0111-110×11 / +1111/101
O 1 0 =

0 0 1 0

(g) ( Jg )
↳ (
NOT .
100 >✗ : CNOT .
= = 100 > ✗ CNOT 110 > =
111 >✗ y
y y , ✗y

output

HE
input
. circuit :
1×3 -• Ix >
0
01
0 0 0

01 ly >
-6 / ✗ ⑦ ys

± reversible XOR
11 1 0

we can show that e


very function f can be described by a reversible circuit

quantum circuits can


perform all .
functions that can be cakulated classic
allg
?⃝
?⃝
EEIEnngeementm-lfapo.ie
state IYSAß on
systems A. B cannot be written as ly >

☒ IE ) ,
it is
entangled

Bellstat.es/-herearefoarso-calledBellstatesthataremaximally entangled and build

an orthonormal basis :

14007=1*(10031-1113) ,
14% : =
(101>+110 ))
H
"

> :-.
¥ (100>-111 >) ,
14
"
> : =

( 101s -

Ho )
write 14% > (11 o! .gr ;) / 4° >
in
general we can ☒
=

gregfignnf
BMstatesmpiy-EI-fpyijsn.rs
↳ lj > •

initial state
(Ha Hrs) / ij > / Zfij >
lij

> Aß

100> (1007+1107)/52 '


( 100> + " 1) HI =/ yo .

>

101s
€>
( 101>+111 > ) / ☒
¥ "
( 101 > +1103%2=14
"
>

110 > ( 100>-110>) /VI ( too > -1×1*2=14^0 >

111 > ( 101>-111>) / V2 (1013-110)/1-714 ""

>

eppositediiedioDfni.Bellmeasurement-E-c.j-eysjLY.in

Classical outcomes i.j correspond to


011 -
basis
a meas of the state 14 ij >
⑦ ☒
.

- -
Teleportation
e -- L n

wants to send her lunhnown ) state


µ : Alice 107s :
✗ 107s +
ßH > to Bob
-
• -

s .

She can only send him two classical bits


though They.
both share the

maxim
allg entangled state 140° >

=

¥ ( 100>Aßt 111>Aß ) .

init-dstaeofthet-dsysteni
¥
>
.IO
s
☒ 14 >AB
"
=
(✗ 1000>saß t ✗ 1011 > saß +
ß 1100> SAß ß 1111 > SAB )
+

=
2¥ ( 1007s, t 1117s#) ☒ ( ✗ 107ps +
ßH >B) ( >
101 +
sn
.
+1107sA) ☒( ✗ 11GtßIO >☐ )

+
( 1007s, -111 > g.) ☒ ( ✗ 10>B- ßH >B) + (1013A -

Hossa ) ☒ ( HSß✗ -

ßIO>ß ) ]
=
G- [ 14007s ,
☒ 1$ > ß + 14
"
>sn ☒ .
(5×1073)
14 Isa (Tz to >B) ]
"

lol > ☐ )
"
+ ☒ + 14 > SA

⇐ Tz

Protocol :

c. 1 Alice performs
!!!
.
a me as .

on S& A in the Bell basis


Alice
.

. . . . .
. .
2. She sends her classical
Bob
iä" ""
Outputs i.

appeiesn.in " "


j
to Bob
.
.

qubit and gets to > !


Alice 's measurement Bob 's state 2 Alice sends 3. Bob final state
1. → .

apple.es → Bob 's


ij
1400 ) 10>ß 00 11 Ich > is

1401) 5×110>B 01 Qr "


14^07 Jz / &>ß 10 Tz u

14 " S 5×52-10/3,3 11 Tz ↳
"

Note that Alice 's ,


state collapsed during the measurement ,
so she does not

have the initial state expected


1µs anymore
This is due to the no
Koning
-

theorem state to Bob


,
as she cannot
copy her state ,
but just send her

when desto ging her own .

You might also like