0% found this document useful (0 votes)
38 views

Quantum Mechanics 812

This document provides an overview of quantum computing concepts in 3 paragraphs: 1) It introduces the basic principles of quantum mechanics like quantum superposition which allows a qubit to exist in a state of 0 and 1 simultaneously. This is represented by ket vectors like |ψ⟩ = α|0⟩ + β|1⟩ where α and β are probability amplitudes. 2) It describes how quantum gates like the Hadamard gate and CNOT gate manipulate qubits to create quantum circuits. These gates perform unitary transformations on the qubit states. 3) It highlights some key differences between quantum and classical circuits like the lack of wires or ability to directly copy qubits. Quantum circuits

Uploaded by

mansoor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views

Quantum Mechanics 812

This document provides an overview of quantum computing concepts in 3 paragraphs: 1) It introduces the basic principles of quantum mechanics like quantum superposition which allows a qubit to exist in a state of 0 and 1 simultaneously. This is represented by ket vectors like |ψ⟩ = α|0⟩ + β|1⟩ where α and β are probability amplitudes. 2) It describes how quantum gates like the Hadamard gate and CNOT gate manipulate qubits to create quantum circuits. These gates perform unitary transformations on the qubit states. 3) It highlights some key differences between quantum and classical circuits like the lack of wires or ability to directly copy qubits. Quantum circuits

Uploaded by

mansoor
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Quantum Mechanics 812

!
!
# $ !
# $ !
%

# & %

# & ! '
# (

*
'

+ + *

"
- .

& /
+ +
+
1 0
-

&
0
,) 2)

,
!" # $

5 3 ! 6

7 8
& 7 8
7 8

+ +
!
9
. !

!" # $

& '

& 3
& *

- 3

4
! $

- !
1 !
-
$

; * !
&

%
&$$ '
#

# & * 3
# $
# < =
# &
# > )
#

# 3!
#

# &
# 1 ? 7 8
#

:
()

@
= * - '
< % !

* + ,
# /; 3&
+ >
# $ & + A > 0
/BB BC)
DE F
# & +< < >
> 7 8
# +< < > >
7 8

2
- ,
# * *+
# 5 *+ '
# =' / * *
# $ * /
# &H5 E * /
7 * 8
# 9 '
# *
# ; 7 * 8

..

# . ! 66

#
# + + !
# ! 66

#
7 + + + +
8

G
&

# ' *!
# *
* !
*
#
+
#
6
# 5

/+ ! !

# . ' 7 *8/ . ",


# ; '
# *+
'
# * :JK
# "JK
# ; ,JK

I
QUANTUM COMPUTING

0 4
;
* !
; /
*
/

01*

< / 0 1
*&*/
2
$ $
3
ψ =α 0 +β 1

L
01* 4 601*
!

5 $ $ ψ =α 0 +β 1
5
# / J

# / ) α β
MA 0 1
|α|" |β|"
α + β =1
2 2

# ! M

Hilbert space is a big place!


- Carlton Caves
$ '
# J
JJ+ J + J+
# ! / $ $

ψ = α 00 + β 01 + γ 10 + δ 11
"! 4
,! I
J! J"4
"J ! J4I :G2
,J ! JG, G4 I"4

E MMM

J
/

00 + 11
ψ = ; ! J
2 ! J
<
= - B

ψ ≠α ⊗β / !

78*
78*
79 8

& 78* & α 0 +β 1 9 α 1 +β 0

& NOT & '


J 0 1
X=
J 1 0

α β
X =
β α
'

Any unitary matrix U will produce a quantum gate!

1 0
Z= α 0 +β 1 : α 0 −β 1
0 −1

1 1 1
/ H=
2 1 −1

0 +1 0 −1
α 0 +β 1 - α +β
2 2

* ;'
<78*
&72
& &
&
& &72 <
< < <N

& < & AND < &< &<N


J J J JJ JJ
J J J J
J J J
J

1 = =

"
>
Differences with classical
Example: swap circuit circuits
• No loops *

& <
• No wires joined together

• No “copy a qubit”
qubit”
< &
7
! 8

$
A @

! !
+
!

,
00 + 11
* $ β00 =
2

# & < = -
# * !
= -
# & ! ψ <
# * !
#

00 + 11
- ! ,) β00 =
2

# & ! ψ = -
* !
# /
JJ+ J + J+
# & <
# < = -

# & 6 + ψ M

4
00 + 11
β00 =
* $ 2

& ψ

&
β 00
< X M2 Z M1 ψ
ψ0 ψ1 ψ2 ψ3 ψ4

ψ =α 0 +β 1

00 + 11
β00 =
* $ 2

ψ
ψ =α 0 +β 1
β00
X M2 Z M1 ψ
ψ0 ψ1 ψ2 ψ3 ψ4

ψ 0 = ψ β 00 =
1
α 0 ( 00 + 11 ) + β 1 ( 00 + 11 )
2
1
= α 000 + α 011 + β 100 + β 111
2

:
* $ & &

< <N
ψ
&< &<N
JJ JJ
β00
J J
X M2 Z M1 ψ
J
ψ0 ψ1 ψ2 ψ3 ψ4 J

1
ψ0 = α 000 + α 011 + β 100 + β 111
2
1
ψ1 = α 000 + α 011 + β 110 + β 101
2

1
ψ1 = α 000 + α 011 + β 110 + β 101
2
* $ -

0 0 +1
ψ
2
β00 1 0 −1
X M2 Z M1 ψ 2
ψ0 ψ1 ψ2 ψ3 ψ4

00 (α 0 + β 1 ) + 01 (α 1 + β 0 )
1
ψ2 =
2
+ 10 (α 0 − β 1 ) + 11 (α 1 − β 0 )

2
α 0 +β 1 9 α 1 +β 0

* $
α 0 +β 1 : α 0 −β 1
ψ

β00
X M2 Z M1 ψ
ψ0 ψ1 ψ2 ψ3 ψ4

00 → (α 0 + β 1 ) 01 → (α 0 + β 1 ) [X ]
10 → ( α 0 − β 1 ) [Ζ] 11 → (α 1 − β 0 ) [ XZ ]

You might also like