Towards Quantum Intelligence

Prof. Amlan Chakrabarti

ACM Distinguished Speaker, Sr. Member ACM & IEEE

A.K.Choudhury School of Information Technology

University of Calcutta
email: acakcs@caluniv.ac.in

Global AI Congress, 13th November 2019: IEM Kolkata

Quantum Intelligence
Prof. (Dr.) Amlan Chakrabarti
ACM Distinguished Speaker, Sr. Member IEEE & ACM
Dean, Faculty of Engineering and Technology,
A.K. Choudhury School of I.T.
University of Calcutta

Global AI Congress, 13th November 2019: IEM Kolkata

 About ACM
 ACM, the Association for Computing Machinery (www.acm.org), is the premier
global community of computing professionals and students with nearly 100,000
members in more than 170 countries interacting with more than 2 million
computing professionals worldwide.

 OUR MISSION: We help computing professionals to be their best and most

creative. We connect them to their peers, to what the latest developments, and
inspire them to advance the profession and make a positive impact on society.

 OUR VISION: We see a world where computing helps solve tomorrow’s problems
– where we use our knowledge and skills to advance the computing profession
and make a positive social impact throughout the world.
The Distinguished Speakers Program
is made possible by

For additional information, please visit

http://dsp.acm.org/
Realizations are getting smaller (and faster) and reaching a point where
“classical” physics is not longer a sufficient model for the laws of physics

5
 Moore’s Law - Need for the change !!!

Moore’s Law: the amount of information storable on a given amount of silicon has
roughly doubled every 18 months. At ~ 10nm. scale quantum effects will upset the
classical progression of Moore’s law..
6
 What is a Quantum Computer?
● A quantum Computer is a machine that performs
calculations based on the laws of quantum mechanics
which is a behaviour of particles at subatomic level .
● A quanta (an electromagnetic wave or a particle) exhibits
dual nature to behave as wave and as well as particle
simultaneously.
○ De-Broglie’s principle of duality
● Quantum computers follow principles of quantum physics
○ Superposition
○ Entanglement
7
8
Why Is This Helpful?

• Multiple computations simultaneously

• Computing power is exponential
Exponential SpeedUp over Classical
Computer !!!

10
Quantum Computing Can Perform Better

11
 Key Research Domains

● Quantum Technology

● Quantum Algorithms

● Quantum Modelling and Simulation

● Quantum Communication and Cryptography

12
 Quantum Phenomenon
Superposition and Entanglement
● Superposition
○ Superposition is the ability of a quantum system to be in multiple states
at the same time.

● Entanglement
○ Multiple particles are associated in such a way that measurement of one
quantum state of one particle is determined by the measurement of the
state of another particle.
13
 Quantum Bits - Qubits

● Qubits - a minimal unit of quantum physical system

● Classical counterpart of a qubit - bit can have only two boolean observable
values 0 and 1.
● Except the two sharp observables 0 and 1, a qubit can have other
observables which have mixed probabilities of 0 and 1.
● Qubits in reality
○ Electron spin (up or down)
○ Photon polarization (horizontal or vertical)
○ Spin of an atomic nucleus
○ Current in a superconducting loop
○ Presence or absence of a particle

14
 Quantum Gates

● SWAP GATE

● Controlled NOT (CNOT) GATE

● TOFFOLI GATE

● CONTROLLED SWAP / FREDKIN GATE

● HADAMARD GATE
15
 Quantum Algorithms

Algorithms based on QAA (Quantum Amplitude Amplification)

- Grover’s Search

Algorithms based on QFT (Quantum Fourier Transform) -

Shor’s

Algorithms based on Quantum Walk - BWT traversal

Quantum Cryptography - Quantum Encryption

16
 Quantum Amplitude Amplification

● Amplification of amplitude using probabilistic technique

● Primarily used in Grover search algorithm to find out a

data item from unsorted database in polynomial time
within O(√N) iterations

● Hadamard transform are applied on all qubits followed by

performing ORACLE diffusion operator iteratively.

17
Grover’s Search Algorithm

18
 Grover’s Search Algorithm

Classical computer Quantum computer

Oracle 1+2+3+... Oracle No+No+Yes+No+...
1 No

2 Oracle
No Superposition over all N possible inputs.

3 Oracle
Yes
Using Grover’s algorithm, a quantum computer
can find the answer in N queries!
...
The best a classical computer
can do on average is N/2 queries.
 Quantum Fourier Transform

● Fourier transform decomposes a function of time into the frequencies that

make it up

● QFT means by using a simple decomposition the discrete Fourier transform

on amplitudes can be implemented as a quantum circuit consisting of only
Hadamard gates and controlled phase shift gates

● Shor introduced QFT for integer factorisation to make the factorisation

process computationally feasible in deterministic time.

20
Shor’s Algorithm

21
 Quantum Walk

● A random walk is the simulation of the random movement of a particle

around a graph

● Time dependence of random walk

○ Discrete time random walk
○ Continuous time random walk

● Quantum walk – Quantum analogue of classical random walk

○ Discrete time quantum walk - Triangle Finding Problem
○ Continuous time quantum walk - Traversal of Binary Welded Tree

22
BWT Traversal

23
 Quantum Cryptography

● Provides for secure key exchange over physically unprotected channels w. a

guarantee of detection of any eavesdropping of the key.

● Doesn’t protect against denial-of-service attacks.

● Physically impossible to compromise security (except @ endpoints) barring

overthrow of physics!

● Probably secure under known laws

Experimentally verified to work perfectly over >48 km distances (so far)
(Hughes ‘99) via fiber-optic networks.

24
Quantum Cryptography (cont…)

25
 Physical Machine Descriptions (PMDs)

● Technology for a given quantum implementation

● Quantum gate implementation is achieved by means of supported quantum
operations
● Variability among the PMDs
primitive quantum operations
related cost
● Commonly known PMDs
Quantum dot (QD)
Superconducting (SC)
Ion trap (IT)
Neutral atom (NA)
Linear photonics (LP)
Nonlinear photonics (NP)

26
 Quantum Modelling and Simulation
● Task: Simulate an n-qubit quantum computer.
● Maximally stupid approach:
○ Store a 2n-element vector
○ Multiply it by a full 2n×2n matrix for each gate operation
● Some obvious optimizations:
○ Never store whole matrix (compute dynamically)
○ Store only nonzero elements of state vector
○ Especially helpful when qubits are highly correlated
○ Do only constant work per nonzero vector element
○ Scatter amplitude from each state to 1 or 2 successors
○ Drop small-probability-mass sets of states
○ Linearity of QM implies no chaotic growth of errors

27
 QLib
The idea of QLib is very similar to the circuit libraries in traditional VLSI design

Qlib contains synthesis scripts to effectively generate quantum modules for

different size or specifications

QLib accepts the circuit parameters from the user depending on the nature of the
quantum block

QLib modules are widely used in quantum algorithms

28
 Quantum Compilers
● Converts an arbitrary unitary matrix into a cascade of gates with some error
threshold

● Quantum compilers are used based on two different algorithms

● Solovay-Kitaev Algorithm (SKA)

● Yields much smaller sequences

● Skipping Table Algorithm (STA)

● Synthesis time is very low

29
 QCL

● QCL (Quantum Computation Language) is a high level, architecture

independent programming language for quantum computers
■ (Omer, http://tph.tuwien.ac.at/~oemer/qcl.html)
● Its syntax is similar to C programming language
● Both classical and quantum code can be combined in the same program

30
FTQLS

31
 QASM

The file format for Qlib is QASM

An example circuit

32
Research work at School of I.T., CU
● The present research activities in the area of quantum computing are as
follows :
○ Quantum Machine Learning
○ Designing of new quantum circuits for quantum algorithms
○ New circuit optimization techniques
■ Template based
■ Heuristic based
○ Development of CAD tools for quantum circuit design, optimization and simulations
○ Quantum Cryptography Multi-valued logic and quantum computing

● International Collaborations
○ Department of Computer Engineering, Princeton University, USA
○ Dept. of Computer Science & Engineering and Department of Physics, New York
State University at Buffalo, USA
○ Iwate Prefecture University, Japan
○ University of Bremen, Germany
○ University Linz, Austria
○ Nanyang Technological University, Singapore 33
34