Data is represented using qubits.
The data in qubit is determined by quantum
superposition phenomenon and can be either 0
or 1 or both at a time.
The operations are done after initializing qubits
to initial state that represents the problem and
manipulations are done on quantum logic gates.
The sequence of manipulations done on logic
gates are known as “Quantum Algorithm”.
The data in the qubit is determined using
Quantum computers use atoms to perform
The computation is based on principles of quantum
In 1981, Feynman proposed an idea on creating
machines based on laws of quantum mechanics.
In1985, David Deutsch developed the quantum turing
machine, showing that quantum circuits are
In 1994, Peter Shor came up with a quantum
algorithm to factor very large numbers in polynomial
In 1997, Lov Grover develops a quantum search
algorithm with O(√N) complexity
Till 1982, Quantum mechanics and Computing are two
different fields of study.
Accurate and speedy computation machine
Part of life because logical work can also be done
Makes work easy and faster
Any complex computation or logical work like laboratory work
Many kinds of numerical problems cannot be solved
using conventional computers.
Example: Factorization of a number
The computer time required to factor an integer
containing N digits is believed to increase
exponentially with N.
processor can perform multiple
computations on its own simultaneously
Qubits may be assigned with either 0 or 1 or
both at a particular time stamp.
The Quantum logic gate is reversible which
means no of I/Ps = no of O/Ps.
The algorithms are well written such that it
suits with the application.
2011, D-Wave launched a fullycommercial, 128-qubit quantum
Computing could provide a radical
change in the way computation is performed.
advantages of Quantum Computing lie in
the aspects of Quantum Mechanics that are
peculiar to it, most notably entanglement.
Computers will be significantly larger
than Quantum Computers for the foreseeable