Quantum Computing
Quantum Computing
Quantum Computing
P. Arumugam ()
Department of Physics
[email protected]
Phone: 5712, 8979890366
Refer class notes for
introductory topics
2
Notations
3
Linear independence and Bases
A spanning set for a vector space is a set of vectors |1 , . . . , |
Such that any vector | in the vector space can be written as a linear
combination of vectors as | = |
1 0
Eg.: A spanning set for the vector space 2 is |1 = ; |2 =
0 1
1
Any vector | = in 2 can be written as | = 1 |1 + 2 |2
2
|1 and |2 SPAN the vector space 2
Generally, a vector space may have many different spanning sets
1 1 1 1
Eg.: |1 = ; |2 =
2 1 2 1
+
| = 1 2 |1 + 1 2 |2
2 2
A set of non-zero vectors |1 , , | are linearly dependent if there exists
a set of complex numbers 1 , , with 0 for at least one value of ,
such that 1 |1 + 2 |2 + + | = 0.
A set of vectors is linearly independent if it is NOT linearly dependent.
We call such a set a basis for .
4
Linear operators & matrix representation
A linear operator between vector spaces and is :
is linear in its inputs: | = (| ) .
(|) |
is defined on :
Identity operator: | | |
Zero operator: 0| 0
If we have : and : , | (|)
=
An complex matrix with entries is a linear operator :
matrices can be regarded as linear operators
det = 1
Tr = 0
Recap: Trace of a matrix is the sum of eigenvalues.
Each of the Pauli matrices has two eigenvalues, +1 and 1.
= , form a basis for the vector space of 2 2 Hermitian matrices.
Outer product: : (| | )| = | = |
| = | || = | | = |
| = |Completeness relation
11
Tensor product: examples
2 12 2
1
1 2 3
= = 13 = 3
2 3 2 22 4
2
3 23 6
Operators distribute over tensor product: =
=
=
12
More definitions
tr
Cyclic, tr = tr , and linear, tr + = tr + tr
tr = tr where is a complex number
tr = sum of eigenvalues of
Trace is invariant under the unitary similarity transformation
tr = tr = tr
Commutator: , = , = 2
If , = 0, commutes with , = 2
, = 2
Anti-commutator: , = +
, = 0 where
If {, } = 0, anti-commutes with
14
Postulate 2 & choice of
Postulate 2: The evolution of a closed quantum system is described by a
unitary transformation. That is, the state | of the system at time 1 is
related to the state | of the system at time 2 by a unitary operator
such that |(2 ) = (1 , 2 )|(1 )
Pauli matrices could be those unitary operators for qubit systems
0 1 1 0
Eg. |0 = = = |1
1 0 0 1
|1 = |0; quantum NOT gate
|0 = |0; |1 = |1 phase flip
16
A single cubit system
=
0 1
The eigenstates of this Hamiltonian are those of =
1 0
1 1 1 1
i.e. 0 + 1 and 0 1
2 2 2 2
1 1
Ground state is 0 1 with energy
2 2
1 , 2 exp (2 1 )/
17
Qubits: What can be measured?
A qubit can exist in a continuum of states between |0 and |1 until it is
observed
When a qubit is measured, it only ever gives 0 or 1 as the
measurement result probabilistically
Eg. a qubit can be in the state
1 1
+: 0 + 1
2 2
1 2
When measured, gives the result 0 fifty percent of the time, and
2
the result 1 fifty percent of the time.
Despite this strangeness, qubits are decidedly real
Many different physical systems can be used to realize qubits
two different polarizations of a photon
alignment of a nuclear spin in a uniform magnetic field
two states of an electron orbiting a single atom
18
Qubit: Atom model
The electron can exist in either the ground 0 or excited 1 states
1
+ 0 1
0
19
Bloch sphere
2 2
| = 0 + |1; + =1
| = cos 2 |0 + sin 2 |1
, and are real numbers
has no observable effects & ignored
| = cos |0 + sin |1
2 2
and define a point on the unit three-
dimensional sphere
Bloch sphere: useful means of visualizing
the state of a single qubit
Infinite number of points on BS?
Measurement of a qubit 0 or 1 only
Measurement changes the state of a qubit
A single measurement a single bit of information
Only if infinitely many identically prepared qubits were measured
would one be able to determine and
20
Quantum information
Infinite information can be stored in a cubit? Yes but not exactly.
How much information is represented by a qubit if we do not measure it?
This is a trick question
How can one quantify information if it cannot be measured?
22
Bell state or EPR pair
00 + 11
=
2
Upon measuring the first qubit, one obtains two possible results:
0 with probability 1/2, leaving the post-measurement state = 00
1 with probability 1/2, leaving the post-measurement state = 11
Measurement of the second qubit always gives the same result as the
measurement of the first qubit
The measurement outcomes are correlated
Einstein, Podolsky and Rosen, first pointed out such strange properties
EPRs insights were taken up and greatly improved by John Bell
The measurement correlations in the Bell state are stronger than could
ever exist between classical systems
Quantum mechanics allows information processing beyond what is
possible in the classical world
Bell state is the key ingredient in quantum teleportation and superdense
coding, and the prototype for many other interesting quantum states.
23
Quantum computation
Changes occurring to a quantum state can be described using the
language of quantum computation.
Quantum computer Quantum circuits with wires & quantum gates
We will discuss the following
Single qubit gates
Multiple qubit gates
Measurements in bases other than the computational basis
Quantum circuits
24
Single qubit gates
25
Visualization of the Hadamard gate
26
Single qubit gates
= ( + )/ 2
=
=
=
27
More single cubit gates
1 1 0
Phase gate =
2 0
exp 8
0 1 0
/8 gate = exp =
8
0 exp
0 exp 4
8
= 2
Recall | = 0 + 1 is a point (, ) on the unit (Bloch) sphere where
= cos and = cos
2 2
Exponentiated Pauli matrices give arise to rotational operators
cos sin
2 2
exp = cos sin =
2 2 2
sin cos
2 2
exp 2
; exp 2
28
Decompositions for a single cubit
An arbitrary unitary operator on a single qubit can be written in many
ways as a combination of rotations, together with global phase shifts on
the qubit.
decomposition: Theorem: If is unitary, there exist real numbers
, , and such that = exp()
29
General form of single qubit gates
There are infinitely many two by two unitary matrices, and thus infinitely
many single qubit gates.
An arbitrary 2x2 unitary matrix may be decomposed as
30
Classical 2 bit gates
31
Controlled NOT gate
The prototypical multi-qubit quantum logic gate is the controlled-NOT or
CNOT gate.
This gate has two input qubits: the control qubit and the target qubit
This can be regarded as a type of generalized-XOR gate
Eg. CNOT:
A controlled operation:
In this basis, the target and control have essentially interchanged roles!
33
Controlled operation
Goal: implement C using single qubit operations and the CNOT gate.
Strategy: = exp
A controlled operation:
Phase shift: exp
34
in multiple cubits:
A controlled in single cubit:
If we have + qubits, and is a qubit unitary operator
1 2 = 1 2 1 2
1 2 means the product of the qubits 1 , 2 , ,
Operator is applied to the last qubits if the first qubits are all equal
to one, and otherwise, nothing is done
35
Ex. 4.2.
Q: Let be a real number and a matrix such that 2 = 1. Show that
exp = cos + sin
A: Both sides satisfy the same differential equation and have the same
initial conditions, so they agree.
= exp , = exp =
= sin + cos , = cos sin =
0 = 0 =
0 = 0 =
Therefore .
36
Toffoli gate
NAND &
FANOUT gates
form a
UNIVERSAL gate
37
Fredkin gate (universal)
The bits a and b are
swapped if c = 1
38
Generalization: 2 () gate
39
Implementation of
In terms of Toffoli gate for e.g.
40
Control bit being 0
41
Another possible representation
42
Measurements in other bases
43