PRESENTED BY :- Rachit Das (20BCTE74)

GUIDED BY :- Suvendu Chandan Nayak & Chandan Patra

 INDE
X
 History
 Defination
 Why Quantum computing??
 Introduction of Qubits
 Quantum algorithms
 Application
 Advantages and Disadvantages
 Conclusion
History
Year Scientist Research
1982 Feynman Idea of creating
machines based on the
laws of quantum
mechanics instead of the
laws of classical physics.

1985 David Deutsch Developed the quantum

turing machine,
showing that quantum
circuits are universal.

1994 Peter Shor A quantum algorithm to

factor very large
numbers in polynomial
time.
1997 Lov Grover Develops a quantum
search algorithm with
O(√N) complexity
 Quantum computing is the area of study focused on developing computer technology based on
the principles of quantum theory, which explains the nature and behaviour of energy and matter
on the quantum(atomic and subatomic) level.
 Quantum Computer:
 A quantum computer is a computation device that makes direct use of quantum-mechanical
phenomena, such as superposition and entanglement, to perform operations on data.
 We will hit natural limits on the size of transistors
 Max out on the number of transistors per chip
 Reach the minimum size for transistors
 Reach the limit of speed for devices

 Eventually, all computing will be done using some sort of alternative structure
 DNA
 Cellular Automation
 Quantum
 In quantum computing, a qubit or quantum bit is a unit of quantum information.
 Qubits represent atoms, ions, photons or electrons and their respective control devices that
are working together to act as computer memory and a processor.
 A qubit is a two-state quantum-mechanical system.
 Vertical polarization
 Horizontal polarization
 Similar to qubit, a qutrit, qudit is also used for other level quantum system.
 The two states in which a qubit may be measured are known as basis states.
 They are represented by Dirac notation.
 States are conventionally written as |0> and |1>:
 An excited state representing |1> and a ground state representing |0>.
 |ѱ>=α|0> + β|1>,

 When we measure this qubit in the standard basis, the probability of outcome for |0> is |α|2
and outcome for |1> is |β|2.
 |α|2 + |β|2 = 1
Excited
State

Nucleus
Ground
State
Electro
State n State
|0> |1>
Bits: Qubits:
 The device computes by  The device computes by
manipulating those bits with the manipulating those bits with the
help of logical gates. help of quantum logic gates.
 A classical computer has a memory  A qubits can hold a one,a zero or
made up of bits, where each bit crucially a superpositoion of
holds either a one or a zero. these.
 A single qubit can be forced into a superposition of the two states denoted by the
addition of the state vectors:
 A qubit in superposition is in both of the states | 1 > and | 0 > at the same time.
 D E F I N IT I O N
 Two things can overlap each other without interfering with each other.In classical
computers,electrons cannot occupy the same space at the same time.
 Entanglement is the ability of quantum systems to exhibit correlation between
states within a superposition.
 Imagine two qubits,each in the state |0>+|1>(a superposition of 0 and 1).We can
entangle the two qubits such that the measurement of one qubit is always
correlated to the measurement of other qubit.
 When a pair of electrons are generated, interact, or share spatial proximity, their spin
states can get entangled, which is what scientists call the quantum entanglement of
electrons.
 A quantum algorithm is an algorithm which runs on a realistic model of quantum
computation.
 Quantum algorithm is a step-by-step procedure.

 ALGORITHM

I. Jozsa algorithm
II. Simon’s algorithm
III. Shor’s algorithm
 Jozsa algorithm:
 This algorithm solves a black-box problem which probably requires exponentially many
queries for any deterministic classical computer, but can be done with exactly 1 query by
quantum computer.
 Simon’s algorithm:
 This algorithm solves a black-box problem exponentially faster the any classical
algorithm, including bounded-error probabilistic algorithms.
 Shor’s algorithm:
 This algorithm solves the discrete logarithm problem and integer factorization
problem in polynomial time, whereas the best known classical algorithms take super-
polynomial time.
 P y t h o n - packages like QuTip allows working with quantum systems.
 QISKIT – Qiskit was IBM’s gift to the quantum programming world in 2017.
 CIRQ - Developed by the team at Google Quantum AI .
 Q# - Q# first appeared in 2017 and is a domain-specific programming language used
for expressing quantum algorithms.
 Quantum computer can be used in cryptography.
 Modelling and indexing of very large databases.
 It can be used to solving complex mathematical problems.
 Military searches of quantum computer.
 Route and traffic optimization.
 Teleportation
Advantages and Disadvantage of Quantum
computing
Advantages Disadvantages
Increase in computing power Building and maintaining quantum computers is
expensive, which may prevent widespread
deployment.

Advance in security Repeated runs may be necessary to obtain the

desired result.

Drug and chemical research. Despite significant progress in error correction

techniques, errors still occur frequently in
quantum computations.
 It discusses the inevitability of quantum computers, how they originated, and
what is different about them from classical computers
 Quantum computes are coming, and they will require a new way of looking at
computing
 If large-scale quantum computers can be built, they will be able to solve certain
problems much faster than any classical computer using the best currently known
algorithms(for example integer factorization using shor’s algorithm or the
simulation of quantum many-body systems).
 Desktop quantum computers expected by many within 10 years.