Module 3
Principles of Quantum Information & Quantum Computing
1) What are differences between classical computing and quantum computing?
Classical Computer Quantum Computer
Classical computers are based on classical Quantum computers are based on quantum
physics. physics.
Bit based information storage using Quantum bit (qubit) based information
voltage/ charge storage using electron spin
Bits having a value of either 0 or 1 can Qubits have a value of 0, 1 or sometimes
have a single value at any instant linear combination of both
The number of possible states is 2 which is The number of possible states is infinite.
either 0 or 1.
Output is Deterministic Output is Probabilistic
Logic gates process the information Quantum logic gates process the
sequentially information parallel
The possible solutions are Defined and The possible solutions are probabilistic and
limited multiple
Operations are according to Boolean The operations use linear algebra and are
algebra represented within unitary matrices
Circuits implemented in macroscopic Circuits implemented in microscopic
technologies technologies
2) Explain the Concept of bit and qubit and the properties of qubits.
In classical computers, bit is a fundamental unit of information. At any instant of time,
the bit can take the value 0 or 1.
Quantum bits, is called as Qubit and it is the fundamental unit of quantum information.
Qubits are similar to bits having two measurable states called 0 and 1.
The qubit can be in either state (0 or 1) as well as in the superposed state of both 0
and 1 states simultaneously
Superposition, Entanglement, and Tunneling are all special properties that define a
qubit.
Qubits can be expressed with mathematical notation called as Dirac or “bra–ket”
notation as ∣0⟩ and ∣1⟩.
A qubit, |ψ⟩, which is a superposition of both |0⟩ and |1⟩, can be written as
|ψ⟩ = α |0⟩ + β |1⟩ -----(1)
Where α and β are probabilities of finding that state in each of 0 or 1 state (also
called as amplitude of the states)
Here, |α|2 + |β|2 = 1
Qubits are described probabilistically.
Due to the quantum nature of qubits, information cannot be copied from one qubit
to another in the same way as classical bits and is known as "no cloning principle".
3) Explain the Representation of qubit by Bloch sphere.
The state of a qubit can be visualized by using an imaginary sphere known as the Bloch
Sphere.
The Bloch sphere is a sphere of unit radius. A point on its surface represents the state of
the qubit .The north pole and the south pole of the Bloch sphere are defined as the basis
states |0⟩ and |1⟩, respectively.
,
General representation of a qubit is
Since there are infinite points on the sphere, a qubit in principle has more capacity to
store information compared to a classical bit.
4) Explain Orthogonality and Orthonormality with an example of each.
Two quantum states |⟩ and |ψ⟩ are said to be orthogonal if their inner product is zero.
i.e
Example, Consider two quantum states |0⟩ and |1⟩
Hence |0⟩ and |1⟩ are orthogonal.
Two quantum states |⟩ and |ψ⟩ are said to be orthonormal if they are:
Normalised states
Orthogonal to each other
Hence |0⟩ and |1⟩ are orthogonal.
hence the states |0⟩ and |1⟩ are normalised states.
Thus we can say that the quantum states |0⟩ and |1⟩ are orthonormal.
5. State Pauli matrices the Apply Pauli matrices on the state 1 and 0.
There are four Pauli Matrices,
1 0
σ0=I = [ ]
0 1
0 1
σ1 =σx= X = [ ]
1 0
σ2 =σy= Y = [0𝑖 −𝑖 0
]
σ3 =σz= Z= [10 −1 0
]
(1 × 1) + (0 × 0)
σ0|0⟩=[10 01] [1]=[(0 × 1) + (1 × 0)] = [10]=|0⟩
0
0 0 (1 × 0) + (0 × 1)
σ0|1⟩=[10 ] [ ]=[
1 1 (0 × 0) + (1 × 1)
0
] =[ ]=|1⟩
1
(0 × 1) + (1 × 0)
σx|0⟩=[01 10] [10] = [(1 × 1) + (0 × 0)]=[01]= |1⟩
(0 × 0) + (1 × 1) 1
σx|1⟩=[0 1 0
][ ] = [ ]=[ ]=|0⟩
(1 × 0) + (0 × 1) 0
1 0 1
−𝑖 1 (0 × 1) + (−𝑖 × 0)
σy|0⟩=[0𝑖 ] [ ]=[
0 0 (𝑖 × 1) + (0 × 0)
0
] = [ ]= i|1⟩
𝑖
(0 × 0) + (−𝑖 × 1)
σy|1⟩=[0𝑖 −𝑖 0
][ ] = [
(𝑖 × 0) + (0 × 1)
−𝑖
] = [ ] = -i|0⟩
0 1 0
0 1 (1 × 1) + (0 × 0)
σz|0⟩=[10 ][ ] = [
1
] = [ ] = = |0⟩
−1 0 (0 × 1) + (−1 × 0) 0
0 0 (1 × 0) + (0 × 1)
σz|1⟩=[10 ][ ] = [ ] [ 0 ] = -|1⟩
−1 1 (0 × 0) + (−1 × 1) −1
6)STUDY ALL THE GATES