Quantum Computing:

fiction becoming reality

Talk at 10X Engineering
by
Muhammad Ahsan
Department of Mechatronics and Control Engineering
University of Engineering and Technology Lahore
 Quantum Computing in fiction??

Star Wars Teleporter Fiction based on Quantum Teleportation

 Quantum Computing is Real

Experimental teleportation with diamond China experimental teleportation of photons with

spins at Henson Lab, TU Delft’s (2014) Micius Satellite between Delingha and Nanshan
https://qutech.nl/lab/hanson-lab/ 1120 Km apart (2020)
research-highlights/hanson-lab-teleportation/ https://doi.org/10.1038/s41586-020-2401-y
 Quantum Speedup
• D-Wave 1440-qubit Quantum Annealer solves instances of Monte Carlo
Path Integral Problem (https://www.nature.com/articles/s41467-021-20901-5)
• 1000 times faster than the NVIDIA Tesla V100 GPU
• 108 times faster than the i7-8650U CPU (single thread)

• Google 53-qubit Sycamore quantum processor generates a specific type of

quantum random number (https://www.nature.com/articles/s41586-019-1666-5)
• In less than 4 minutes, whereas the world most powerful supercomputer
Summit would take 10,000 years
Basic Philosophy of Quantum Computing

“What computers can or cannot do is determined by the

laws of physics alone, rather than pure mathematics”
David Deutsch
University of Oxford
(Pioneer of quantum
computing)

How powerful is our computer will depend on

our ability to manipulate physics for computation
 Why Quantum Computing a Big Deal
Speedup in hard optimization problem
Advancing Machine Learning Algorithms
Rapid Breakthroughs in Drug Design
Finding Killer strategies in War-fare

Highly efficient solution of world’s most complicated problems

Quantum
Cracking current encryption
Cryptography
Theoretically Secure
Polynomial time O(n3) Integer factorization (Hack-Proof) Communication
Who is interested in Quantum Computing?
c e are
rc h a ft w
Se
a Sp So
et
er n
Int

nt
m e
e rn e
ov rc
. G me
re U.S o m
dwa e-C
r
Ha

PAKISTAN??
 Agenda
• Basics of Quantum Computing

• Quantum Algorithms

• Experimental Progress

• Quantum Computing for Pakistan Defense

 Quantum Bit (1)
Equation of classical LC oscillator :
+ Charge (Q), Current oscillates at single natural frequency

Schrodinger equation
- Equation of quantum LC oscillator:
Charge (Q), Current can oscillate at SET of NATURAL FREQUENCIES

1 3 5
, , , ...
2 √ 𝐿𝐶 2 √ 𝐿𝐶 2 √ 𝐿𝐶
Discrete Energy Levels: E0 E1 E2 , .. .
𝛥𝐸 𝛥𝐸 𝛥𝐸
Classical case: Single solution Q(t) VS Quantum case: Multiple solutions Q(t)
 Quantum Bit (2)
1 3 5
, , , ...
2 √ 𝐿𝐶 2 √ 𝐿𝐶 2 √ 𝐿𝐶
+
Discrete E0 E1 E2 , .. .
Energy Levels 𝛥𝐸 𝛥𝐸 𝛥𝐸
-
Oscillator Oscillator
Initial energy new energy
level level

Is satisfied by +
→ Complex Oscillator new energy level
→ numbers
will be
as well as Pulse
Pulse
energy:
energy:

Oscillator is in the Quantum Superposition of Energy Levels E0 and E1

 Quantum Bit (3)
1 3 5
, , , ...
2 √ 𝐿𝐶 2 √ 𝐿𝐶 2 √ 𝐿𝐶
+
Discrete E0 E1 E2 , .. .
Energy Levels 𝛥 𝐸1 𝛥𝐸 2 𝛥 𝐸𝑛
-
Non-Linear
Inductor () ¿0⟩ ¿ 1⟩ Discard Higher energy levels
Physical realization of for computation
a Superconductor
Qubit (Operating Temp ~ m K)
Qubit Computational Basis

General Qubit State: ¿ 𝜑 ⟩ =𝛼 ¿ 0 ⟩ +𝛽 ¿ 1 ⟩

 Introduction to Quantum Bit
Quantum Bit Classical Bit Val: 0 +y = |0>
Unit Vector ANYWHERE on the Circle (actually Sphere) Classical Bit Val: 1

¿𝜑 ⟩ =𝛼 ¿0 ⟩ +𝛽 ¿1 ⟩ 𝛼
[ ]
or ¿ 𝜑 ⟩ = 𝛽 , 2 + |2 = 1
-x +x =-|0>
|0>, |1> → classical binary states =-|1>

-y = |1>
→ α and β are complex
¿𝜑 ⟩ =𝑎 ¿0 ⟩ +ei θ b∨1 ⟩
→ Three degrees of freedom a, b, θ
Quantum Bit (Qubit) has both magnitude (a, b) of |0> and |1> and phase (θ)
¿𝜑 ⟩ 2
¿𝜑 ⟩ 1
Phase of Qubit enables constructive and destructive interference
¿𝜑 ⟩ 1= 𝐴 ¿0 ⟩ +𝐵 ¿1 ⟩ ¿ 𝜑 ⟩ 1+¿ 𝜑 ⟩ 2=¿ 𝟎 ⟩ ¿𝜑 ⟩ 1−∨𝜑 ⟩ 2=¿𝟏 ⟩
¿𝜑 ⟩ 2=𝐶 ¿ 0 ⟩ − 𝐷 ¿1 ⟩
 Introduction to Quantum Bit
Quantum Bit Classical Bit Val: 0 +y = |0>
Unit Vector ANYWHERE on the Circle (actually Sphere) Classical Bit Val: 1

¿𝜑 ⟩ =𝛼 ¿0 ⟩ +𝛽 ¿1 ⟩ 𝛼
[ ]
or ¿ 𝜑 ⟩ = 𝛽 , 2 + |2 = 1
-x +x =-|0>
|0>, |1> → classical binary states =-|1>

Quantum Mechanics allows α and β to be complex -y = |1>

Three degrees of freedom a, b, θ ¿𝜑 ⟩ =𝑎 ¿0 ⟩ +ei θ b∨1 ⟩
Quantum Bit (Qubit) has both magnitude (a, b) and phase (θ)
Quantum Gate
𝑑 Rotate on Bloch sphere using
Solve 𝑖h ¿ for ¿ 𝜑 (𝑡) ⟩
𝑑𝑡 Unitary transformation U = e-ihH Simple
𝑈 𝑈 † =𝐼
¿
Matrix-Vector

[]
𝛼 Multiplication!
𝑈 ¿ 𝜑 ⟩=𝑈 ( 𝛼 ¿ 0 ⟩ + 𝛽 ¿1 ⟩ )=𝑈
𝛽
Introduction to Single-Qubit Quantum
Gates
Bit-Flip (NOT) gate X VS Classical NOT gate
0 1

𝑋=
[ 0
1
1
0 ] 𝑋 ( 𝛼 ¿ 0 ⟩ + 𝛽 ¿1 ⟩ ) =𝛼 ¿ 1 ⟩ + 𝛽 ¿ 0 ⟩ 1 0

Phase (flip) gate Z

Z
Phase
𝑍 ( 𝛼 ¿ 0 ⟩ +𝛽 ¿ 1 ⟩ )=𝛼 ¿ 0 ⟩ − 𝛽 ¿ 1 ⟩

No equivalent classical gate !

Hadamard gate H
1 1 1 𝐻 ¿ 0 ⟩ =1/ √ 2 ( ¿ 0 ⟩ +¿ 1 ⟩ )
𝐻=
[ ]
√ 2 1 −1 𝐻 ¿ 1 ⟩=1/ √ 2 ( ¿ 0 ⟩ − ¿ 1 ⟩ )
Superposition
 Multi-Qubit Quantum System
Single-qubit 2-dimensional vector(s)
Can represent 2n n-bits
¿ 𝜑 ⟩1 =
[ ]
𝛼1
𝛽1
¿ 𝜑 ⟩ 2=
[ ]
𝛼2
𝛽2
2-bits
long numbers
in superposition!
¿ 𝛼1 ¿ 0 ⟩ +𝛽1 ¿ 1 ⟩ ¿ 𝛼2 ¿ 0 ⟩ + 𝛽 2 ¿ 1 ⟩

[ ]
Two-qubits 𝛼1 𝛼 2
¿ 𝜑 ⟩ 12 = ¿𝜑 ⟩ 1 ⊗ ¿𝜑 ⟩ 2 =
[ ] [ ]
𝛼1
𝛽1
⊗
𝛼2
𝛽2
𝛼 𝛽
= 1 2
𝛽1 𝛼 2 4 dimensional vector e.g. for n = 300 qubits
2300 > number of atoms
𝛽 1 𝛽2
In the universe!
. . . . .

Tensor Product n-bits

[ ]
𝛼 1 𝛼 2 ... 𝛼𝑛
n-qubits 𝛼 1 𝛼 2 ... 𝛽 𝑛
)
¿ 𝜑 ⟩ 123. .. 𝑛 = ¿ 𝜑 ⟩1 ⊗ ¿ 𝜑 ⟩2 ⊗ ... ⊗ ¿𝜑 ⟩𝑛 = .
.
2n dimensional vector
.
𝛽 1 𝛽2 ... 𝛽𝑛
 Multi-Qubit Gates : Entanglement (1)
Two-Qubits Gate: Controlled NOT (CNOT) Another Example:
2
∀ 𝑎𝑖 ∈ ℂ 1 1
❑
¿ 𝜑 ⟩ 𝑋𝑌 =𝑎1 ¿ 00 ⟩ +𝑎2 ¿ 01 ⟩ +𝑎3 ¿ 10 ⟩ +𝑎4 ¿ 11 ⟩ ¿ 𝜑 ⟩𝑋 = ( ¿ 0 ⟩ + ¿1 ⟩ ) ¿ 𝜑 ⟩𝑌= ( ¿ 0 ⟩ − ¿ 1⟩ )
√2 √2

[ ]
1 0 0 0 1
¿𝑋⟩ ¿𝑋⟩ 0 1 0 0
¿ 𝜑 ⟩ 𝑋𝑌 = ¿ 𝜑 ⟩ 𝑋 ⊗ ¿ 𝜑 ⟩ 𝑌 =
2
( ¿ 00 ⟩ − ¿ 01 ⟩ + ¿ 10 ⟩ − ¿ 11 ⟩ )
𝐶𝑁𝑂𝑇 =
0 0 0 1
¿𝑌 ⟩ ¿ 𝑋 ⊕𝑌 ⟩ 0 0 1 0 CNOT   ¿ 𝜑 ⟩ 𝑋𝑌 =
1
2
( ¿ 00 ⟩ − ¿ 01 ⟩ − ¿10 ⟩ + ¿ 11 ⟩ )

1 1
¿ ( ¿ 0 ⟩ − ¿1 ⟩ ) ⊗ ( ¿ 0 ⟩ − ¿1 ⟩ )
❑ √2 √2
𝑎2 ,𝑎4 =0 ⇒ 𝐶𝑁𝑂𝑇 ¿ 𝜑 ⟩ 𝑋𝑌 =𝑎1 ¿ 00 ⟩ +𝑎3 ¿ 11 ⟩

Cannot decompose into

Phase of Controlled-qubit X has flipped
Due to qubit Y !
Entanglement Phase-Kick Back Effect
 Multi-Qubit Gates : Entanglement (2)
Three-Qubits Gate: TOFFOLI ¿𝑥⟩ ¿𝑥⟩
∀ 𝑎𝑖 ∈ ℂ2 ¿𝑦⟩ ¿𝑦⟩
+
¿ 1⟩ ¿𝑥  NAND   𝑦 ⟩

¿𝑥⟩ ¿𝑥⟩
Using Toffoli gates, we can simulate any
¿𝑦⟩ ¿𝑦⟩ classical boolean logic circuit
¿𝑧 ⟩ ¿( 𝑥∧𝑦 ) ⊕ 𝑧 ⟩

TOFFOLI + Classical computation Subset

of Quantum Computation
 Quick Introduction to Quantum
Computing (2)
• Quantum State Space: n-qubit system “simultaneously” spans all 2n bit-strings patterns
¿0⟩
𝑛
𝑥=2 − 1
H
¿𝜑 ⟩ = ∑ 𝑎 x∨𝑥 ⟩ =𝑎0 ¿000...0 ⟩ +𝑎1 ¿ 000...1 ⟩ +...+𝑎2 −1 ¿111. ..1 ⟩ ¿ .0 ⟩ H
𝑛 Equal superposition state:
.
𝑛
with equal ai
𝑥=0 . .
n-bit string . .
¿0⟩ H
Designing Quantum Algorithm is all about clever manipulation of amplitudes: ai s
|0>
• Quantum Measurement M or
w.p. 2

¿ 𝜑 ⟩ =𝛼 ¿ 0 ⟩ +𝛽 ¿1 ⟩ M OR .
w.p. 2

𝑛
¿ 𝜑 ⟩ =𝑎 0 ¿ 000...0 ⟩ + 𝑎1 ¿ 000...1 ⟩ +...+𝑎 𝑘 ¿ 011. ..1 ⟩ +...+𝑎 2 𝑛
−1
¿ 111...1 ⟩
|1>
n-qubit Measurement:
𝑛 𝑛
¿ 𝜑 ⟩ =¿ 11 1…1 ⟩    w . p .  ¿ 𝑎2 𝑛− 1∨¿ ¿
𝑛 2
¿ 𝜑 ⟩ =¿ 000 … 1 ⟩    w . p .  ¿𝑎1 ∨¿ ¿
2
¿ 𝜑 ⟩ =¿ 000. ..0 ⟩    w . p .  ¿𝑎0 ∨¿ ¿
2

Quantum Algorithm should Measure such that |ai|2 of correct solution string is close to 1
 What we have learned so far
• Quantum Superposition:
• Allows qubit in state |0> and |1> simultaneously (e.g. |0> + |1>)

• Quantum Entanglement:
• State of one qubit depends on the state of the other ( e.g. |00> + |11>)

• Quantum Measurement:
• Reading qubit(s) state collapses superposition (or entanglement) (e.g.
Measuring (|0>+|1>) → 0 or 1 w.p. 0.5 each)
 Agenda
• Basics of Quantum Computing

• Quantum Algorithms

• Experimental Progress

• Quantum Computing for Pakistan Defense

 Quantum Algorithms(1)

𝑠 • 𝑥=𝑠0 𝑥0 ⊕ 𝑠1 𝑥 1 ⊕... ⊕ 𝑠𝑛− 1 𝑥𝑛 −1

A function fs(x) outputs inner product of n-bit input x and string s as
s is unknown. The goal is to find s by calling fs(x)
Quantum : Need only 1 query/call to the function fs(x) Classical: Need upto n queries/calls to the function fs(x)
fs(x)
Example: ¿ 0 ⟩ H H M ¿ 1⟩
¿0⟩ H H M ¿0⟩ s
Assume
¿0⟩ H H M ¿ 1⟩
fs(x)
with ¿ 1⟩ H H ¿ 1⟩

¿
4 1
s = (1,0,1)
¿𝜑 ⟩4 =¿ ( ¿ 000 ⟩ − ¿001 ⟩ +¿010
1
⟩ − ¿011 ⟩ −
¿ 𝜑 ⟩ =¿ 0004¿𝜑⟩ =
⟩ ¿ 0 ⟩ 4
¿ Phase Kick-Back
√ 3⟩ )( ¿ 0 ⟩ − ¿1 ⟩ )
            ¿100 ⟩ +¿101 ⟩ − ¿110 ⟩ +¿111
 Quantum Grover’s Search Algorithm(1)
Problem: Find solution to an unstructured search problem (e.g. NP-complete problems)
Search space containing N candidate solutions

Quantum (Grover’s) Algorithm: O() Worst Case

Classical algorithms: O()
Complexity
Equal superposition of Helping qubit Grover Iteration
Example: 4-candidate solutions |x> state ¿0⟩ H M

¿ 𝜑 ⟩=
1
( ¿ 00 ⟩ + ¿ 01 ⟩ + ¿ 10 ⟩ + ¿ 11 ⟩ )( ¿ 0 ⟩ − ¿ 1 ⟩ ) ¿0⟩ H f(x) M
√8
¿ 1⟩ H H ¿ 1⟩
𝑓 (𝑥)=
{
¿ 𝑥 ⟩     if    ¿ 𝑥 ⟩ ∉Solution   
− ¿ 𝑥 ⟩   if   ¿ 𝑥 ⟩ ∈Solution   Phase-kick back
in solution state
⟨ 𝑎 ⟩ =1/ 4 ( 𝑎1 +𝑎 2 +𝑎 3+ 𝑎 4 )

[ ][ ]
1 −1 1 1 1 𝑎1 =
¿ 𝜑 ⟩= ( ¿ 00 ⟩ + ¿ 01 ⟩ − ¿ 10 ⟩ + ¿ 11 ⟩ ) ( ¿ 0 ⟩ − ¿1 ⟩ ) 1 1 −1 1 1 𝑎2
√8
2 1 1 −1 1 𝑎3
1 1 1 1 −1 𝑎4
¿ 𝜑 ⟩= ( ¿ 10 ⟩ ) ( ¿ 1 ⟩ )
√8
Solution obtained using only 1 Grover Iteration Inversion about the mean
 Quantum Grover’s Search Algorithm(2)
1. Create equal Superposition of N states (e.g. N = 16)

2. Let the phase of unknown solution in flipped (e.g. soln= 8)

3. Apply inversion about the mean operation

√ √
𝑁 −1
1 𝑁− 𝑀 𝑀
¿𝜑 ⟩ = ∑ ¿ 𝑥 ⟩ = ¿𝛼 ⟩ + ¿ 𝛽⟩ Grover Iteration
√ 𝑁 𝑥= 0 𝑁 𝑁 # of correct solutions = M

Superposition of Incorrect Solutions Correct Solutions ¿ 𝛽⟩

Grover ¿𝝋 ⟩
¿ 𝜑 ⟩ =cos ( 𝜃 /2 ) ¿𝛼 ⟩ +sin ( 𝜃/2 ) ¿ 𝛽 ⟩ Steps 2,3 rotate by angle .
# Rotations required to get = will be = 𝜃 /2≃ sin ( 𝜃 /2 )= √ 𝑀 / 𝑁
For small M << N 𝜃 ¿𝜑⟩
# Rotations required to get = will be =
Time Complexity : O() 𝜃 /2 ¿𝛼 ⟩
 Grover Search ~ Quantum Tunneling
Time (T) to reach global minima Energy to surmount the barrier

Classical: T exp() : Height of Barrier

∆ w: Width of Barrier
Quantum: T exp(1/2 w)
Cost Function

if w << 1/2 then T = O(2) = O()

For hard optimization problems, let ~ N (# possible solutions)

w
Example: Quadratic Unconstraint Binary Optimization problem
Maximize xT Q x s.t. x
Landscape QT = Q is defined by the problem

AI Labs at Google,
Machine Learning NASA Intel
Jobs Scheduling Computer aided Design
Support Vector Machine Classifier
 Integer Factorization(Exponential
Speedup)
Problem: Given N, a product of two very large unknown prime number x, y. Find x, y
Solution: Choose a s.t.
Classical: Finding eigenvalues of N x N matrix takes O(N3) → O(2n^3) Exponential in n
For n-bit integer N Best-known Classical Algorithm for Integer Factorization: Sub-Exponential in n
GCD (a, N) = 1, a < N
M

|Input qubits>
N = (ar/2-1) (ar/2+1)
Quantum Inverse

Period (r)
Modular Quantum M
Period r is hidden in Exponentiation Fourier M
Eigenvalues of U(x) = ax mod N Transform
M
U(x) = ax mod N
n

M
Quantum Modular Exponentiation:
in

Quantum Integer Factorization Algorithm

ial

Complexity: O(log N)3 = O(n3)

om

Exponential Speedup over Best Known Classical Algorithm !

Quantum Fourier Transform:
lyn

Complexity: O(log N)2 = O(n2)

Po

Open threat to widely used RSA based public-key cryptosystems e.g. Internet!
 Quantum Teleportation
Qubit state cannot be copied to another qubit (No-Cloning Theorem)

Problem: How to build ‘wires’ to transmit quantum state (signal) ??

Solution: Teleportation

If MA = 1: Apply Z on C 1
|A>=𝛼 ¿ 0 ⟩ +𝛽 ¿ 1 ⟩ H MA ¿ 𝐴𝐵𝐶 ⟩ =
√2
( 𝛼 ¿ 0 ⟩ + 𝛽 ¿ 1 ⟩ )( ¿ 00 ⟩ + ¿ 11 ⟩ )
If MB = 1: Apply X on C
|B> MB
¿ 𝐴𝐵𝐶 ⟩ =
1
( 𝛼 ¿ 000 ⟩ + 𝛽 ¿ 110 ⟩ +𝛼 ¿ 011 ⟩ + 𝛽 ¿ 101 ⟩ )
√ 2
Apply on |C>
|C> X Z 𝛼 ¿0 ⟩ +𝛽 ¿ 1 ⟩ 1
¿𝐴𝐵𝐶⟩= (¿0 ⟩(𝛼 ¿0⟩+𝛽¿1⟩)+¿¿01⟩(𝛼 ¿1⟩+ 𝛽¿0⟩)+¿¿10⟩(𝛼 ¿0⟩− 𝛽¿1⟩)+¿¿11⟩(𝛼 ¿1⟩− 𝛽¿0⟩) XZ
|BC>=
1
√2
( ¿ 00 ⟩ + ¿11 ⟩ ) Einstein-Podolsky-Rosen
(EPR Pair) √2 Both X, Z
Teleportation: Re-creating Quantum State at the Destination |AB> |C>¿ 𝛼 ¿ 0 ⟩ +𝛽 ¿ 1 ⟩
Destroying Quantum State at the Origin
 Quantum Communication
Cannot make clones of qubit state Measuring qubit state changes the state of qubit

Theoretically Secure Key Distribution for cryptography

¿0⟩ H
1
( ¿ 0 ⟩ + ¿1 ⟩ ) =¿ Two Types of Encoding basis States
√2

¿ 1⟩ H
1
( ¿ 0 ⟩ − ¿1 ⟩ ) = ¿ − ⟩
{¿ 0 ⟩ , ¿ 1 ⟩} ¿
√2 H H
0 1 0 1
Measurement Basis Measurement Basis
{, } { or }
Two ways to encode classical
0: = = = or
prob. 0.5 each
bit into qubit
1: = =
0: = → or , = If encoding basis is kept secret,
1: = prob. 0.5 each = then Measuring Changes
 Quantum Key Distribution(1)
Classical Channel
Sender: Receiver
Eve
Alice Bob
Classical Channel

Alice bit 1 1 1 0 0 1 0 1 1
Alice Basis

Eve Basis

Bob Basis

Bob’s bit 0 10 0 0 0 1 0 1 10

Hacked bits
Secret Key: 0 1 0 1 1
 Quantum Key Distribution(2)
How can Alice and bob detect the presence of Eve (Eavesdropper)??
Insight: Eve introduces error into Bob’s measurement
Prob. (Alice key bit = Bob’s key bit) = Prob. (Eve chose correct basis) +
Prob. (Eve chose incorrect basis) Prob. (Bob’s still gets correct key bit)
=½ + ½ ½ = ¾
Prob.Prob.
(Perfect match
(Perfect between
match AliceAlice
between and and 1 keyn bit)
Bob’sBob’s ¾=
key =bits)

Prob. (eavesdropper is detected) = Prob. (bit hacked) = Prob. (one or more mismatch in Alice and Bob’s n key bits) = 1 -

To detect eavesdropper with Prob. > 0.95, 1 - > 0.95

Advantage: By increasing the length of Key, eavesdropper can be detected with arbitrarily high probability

Experimentally QKD has been

Theoretically achieved
Secure over a distance of 20,000 Km
Communication
 Experimental Progress in
Quantum Key Distribution
Circuit
Description of advances in Distance between Distance of secure circuit error-rate
Year quantum communication
entangled qubits communication (E) /Quantum bit
technology error- rate (QBER)

2015 Entanglement demonstration on Less than Km N/A 4% (QBER)

board a nano-satellite 
Quantum key distribution (QKD) in
2016 free space 53 Km N/A 3.3-9.5% (QBER)
2016 Entanglement with satellite > 1200 Km N/A 10% (E)
Ground to satellite QKD and satellite  
2017 > 1200 Km N/A
to ground quantum teleportation 20% and 1.1% (E)

Satellite relayed Intercontinental  

2018 N/A >7,600 Km
quantum network 1-2.4% (QBER)

2018 Quantum communication from N/A > 20,000Km  

global navigation satellite system 44% (E)
2020 Entanglement based QKD 1,120 Km 1,120 Km Unknown
2021 Integrated satellite and ground QKD N/A 4,600 Km Unknown
 Agenda
• Basics of Quantum Computing

• Quantum Algorithms

• Experimental Progress

• Quantum Computing for Pakistan Defense

 Quantum Hardware (Trapped-Ion,
Photons)
Quantum
(Qubits) Video credit: Jason Amini
Gates
¿𝑥⟩ U 𝑈∨𝑥 ⟩ Ballistic
Photon Shuttling
Detectors
¿𝑥⟩ {|0>,
Beam Channel
M ¿ 1⟩ Photons Splitter
|1>}
¿0⟩ Optical
¿𝑥⟩ ¿𝑥⟩ Switch
Stable Energy Ions (qubits)
Levels
¿𝑦⟩ ¿𝑥 ⊕ 𝑦 ⟩ Entangled
Pair
¿𝑥⟩ ¿𝑥⟩ (EPR pair)

¿𝑦⟩ ¿𝑦⟩ Electrodes

¿𝑧 ⟩ ¿𝑥 ⊕ 𝑦 ⊕ 𝑧 ⟩ Laser (gate)
Quantum Computer Control Hardware

x
V1
V4
V2
V5
V3 V6

V
Digital to Ballistic Shuttling of ions
Microelectromechanical
(MEMS) Mirror Analogue
Converter
Laser Pulses

Laser Control
System
Individual addressing of ion
Quantum Gates

FPGA
 Experimental Progress in Quantum
Computing
D-Wave Customers:
Size of
quantum
processor Company
# qubits

127 IBM
Superposition??

80 Rigetti
Fully Quantum
D-Wave Quantum

?
53 Google Computer Entanglement??
IonQ 2007 28-qubits
20 VS
2011 128-qubits
12 Honeywell General Purpose
2013 512-qubits Quantum
11 Baidu
2015 >1000-qubits Computing??
Quantum Superposition, Entanglement Only Quantum Tunneling
 Experimental Challenges in Quantum
Computing
• Practically, quantum device component (qubits, gates) are very noisy
and unreliable than classical computers (Both Bit-flip and Phase-flip errors)

Mean Time to Failure:

Failure Prob.
Classical:
p = 10-3
~ 107 – 108 hours
1 in 1,000 Quantum
Quantum:
Gate fails
~Seconds – Minutes

Need Error-Correction (Redundancy) to protect quantum Information

 Example: Fault Tolerant 3-qubit (Toffoli) Gate
Unprotected Quantum Gate Fault Tolerant Quantum Gate
¿𝑥⟩ ¿𝑥⟩
¿ 𝑥 ⟩𝐿 Encoding Error Correction
¿𝑦⟩ ¿𝑦⟩ ¿ 𝑦 ⟩𝐿 Encoding Error Correction
¿𝑧 ⟩ ¿(𝑥 . 𝑦 )⊕ 𝑧 ⟩ ¿ 𝑧 ⟩𝐿 Encoding Error Correction

e.g. Steane [[7,1,3]] code

Qubit State
-1

Entangled
--
Special

Recovery
-1 -1
-1 -1
-- -1 -1
-- -1 -1
¿𝑥⟩ --
-1 -1 -1

Qubit State
Entangled
Special

Checks
--

Parity
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
4-cat
dec.

dec.

dec.

dec.

dec.

dec
--
--

Large Number of Additional Qubits, Gates to reduce effective Noise Level from O(p) -> O(p2)
 Quantum practically superior than
Classical
How many physical qubits?
Classical Computers: 2048-bit number impossible to be factorized in realistic time scale
Current world record of Integer factorization: 768-bit integer factorized in 2005

Practically we need
3 million qubits quantum computer to factorize
2,048-bits number in 5 months
-Ahsan et al., 2015
 Worldwide attention to my PhD research
• Designing a Million-Qubit Quantum Computer Using a Resource Performance
Simulator
• Cited in IBM patent US11314908B2
• Cited (X-category) in Google patent WO2022/051030 A3
• Cited in the book ‘Quantum Computing Progress and Prospects’ published by National
Academies of Sciences, Engineering and Medicine USA. ISBN 978-0-309-47969-1

• Open source SQrIpT toolbox

• Submitted to IARPA, USA (Quantum Computer Science project 2013-2015)
• PhD students Iran universities (Research)
• Reported as fasted qubit partitioning tool in the comparison
(https://iopscience.iop.org/article/10.1088/1402-4896/abd57c)
• Photonic Inc. Burnaby, BC Canada (Research and Development)
 Agenda
• Basics of Quantum Computing

• Quantum Algorithms

• Experimental Progress

• Quantum Computing for Pakistan Defense

 Military Application of Quantum
Computing
Breaking RSA based encryption Secure Communication
(Hacking the enemy) (Hack-Proof Networking)
Quantum Communication

Quantum Sensing, Imaging Quantum Navigation

(Gravity Sensors to detect (Navigation in the GPS
Underground Bunkers) Denied Environment)
Quantum Physics

Optimization of military Warfare-Planning and

travel path Sequence of operations
Quantum Search Algorithms U.S and China spending millions of
dollars on Quantum Computing
 Pakistan Defense
Battle-field is like a chess-board (to some degree)
military resources → chess pieces (rook, knight, queen etc.)

To win the game of Chess, you need to move pieces

1. Outsmart
2. Outpace
the opponent
Historically, Pakistan has fewer pieces than its opponent
Compensate by finding killer moves faster than the opponent

Quantum Search: O() time-steps to find killer move

(vs O(N) for classical search)

Quantum Speed-up can be crucial to win the battle

THANK YOU

Q&A
 A little bit of quantum mechanics
In Quantum Mechanics, the measurable physical state (e.g. position, momentum) of a system

1. are discrete and quantized (Eigenvalues/vectors of Hermitian matrix H)

2. are described by a wave function which tells:

“What is the probability that system state in a given eigenvalue of H?”

¿ 𝜑 ⟩ =[ 𝑝 1 𝑝 2 . . . 𝑝𝑛 ] Prop. to Probability Distribution (p21 + p22 + … + p2n = 1)

e1 e2 . . . en Eigenvalues of H
𝑑
𝑖h ¿ ¿ 𝜑 ⟩ =[ 𝑝 1
1 1 1
𝑝𝑛 ]
1
𝑑𝑡 𝑝2 . . .
Satisfies Schrodinger equation
¿ 𝜑 ⟩ =[ 𝑝 ]
2 2 2 2
𝑝 . . . 𝑝
Schrodinger’s equation 1 2 𝑛

1 2
Linear Superposition: 𝛼 ¿ 𝜑 ⟩ + 𝛽 ¿ 𝜑 ⟩ Also satisfies Schrodinger equation

Superposition allows quantum system states in two different states simultaneously!