Quantum Computers: A Seminar Presentation On

A Seminar Presentation on
Quantum
computers
Submitted By:- Bhanu Joshi
8th sem (A1) JIET-COE Submitted to: Mr. Madhav Khatri
introduction
Quantum computing is a beautiful combination of quantum physics, computer science,
and information theory. Quantum computing is the use of quantum-mechanical
phenomena such as superposition and entanglement to perform computation.
Computers that perform quantum computation are known as a quantum computers.
Quantum computers are believed to be able to solve certain computational problems,
such as integer factorization (which underlies RSA encryption), significantly faster than
classical computers. In 1982, Nobel Prize–winning physicist Richard Feynman
conceived of an ultrapowerful calculator that relies on microscopic particles to operate.
He called his idea a “quantum” computer, referring to the laws that govern nature at a
subatomic level.
Moore’s law
Moore's law is the observation
that the number of transistors in a
dense integrated circuit doubles
about every two years. The
observation is named after
Gordon Moore, the co-founder of
Fairchild Semiconductor and was
the CEO of Intel, whose 1965
paper described a doubling every
year in the number of components
per integrated circuit] and
projected this rate of growth would
continue for at least another
decade
Classical computers
Classical computing is another name for binary computing. In this traditional approach
to computing, information is stored in bits that are represented logically by either a 0
(off) or a 1 (on).
Why classical computers are used mostly?

● Accurate and speedy computation machine.
● Humans use it because humans thinks logically.
● Easy to use and understand
● Used in complex tasks and logical computation.
● Used in data handling.
● …...many more.
Problems in classical computation
Richard Feynman and Yuri Manin later suggested that a quantum computer had
the potential to simulate things that a classical computer could not.
The factoring problem, the instances are the integers n, and solutions are prime
numbers p that describe nontrivial prime factors of n.
"Given a list of cities and the distances between each pair of cities, find the shortest
possible route that visits each city exactly once and returns to the origin city."
It is an NP-hard problem in combinatorial optimization, important in operations
research and theoretical computer science.
Origin of quantum computers
Quantum computing began in the early
1980s, when physicist Paul Benioff
proposed a quantum mechanical model of
the Turing machine.
In 1994, Peter Shor developed a quantum

algorithm for factoring integers that had the
potential to decrypt RSA-encrypted
communications. Despite ongoing
experimental progress since the late 1990s,
most researchers believe that "fault-tolerant
quantum computing is still a rather distant
dream".
Quantum computers basic
Quantum mechanics (also known as quantum physics, quantum theory, the wave
mechanical model, or matrix mechanics), including quantum field theory, is a
fundamental theory in physics describing the properties of nature on an atomic scale.
Quantum computers, which are expected to perform certain computational tasks

exponentially faster than classical computers are totally depended and have all the
properties of quantum mechanics and Instead of using classical bits, quantum
computers use qubits, which can be in superpositions of states.
Qubit
Quantum bit, or "qubit", which is somewhat
analogous to the bit in classical computation.
Qubits can be in a 1 or 0 quantum state, or they
can be in a superposition of the 1 and 0 states.
However, when qubits are measured the result is
always either a 0 or a 1; the probabilities of these
two outcomes depend on the quantum state that
they were in immediately prior to the measurement.
Computation is performed by manipulating qubits
with quantum logic gates, which are somewhat
analogous to classical logic gates.
Quantum Information
Quantum information is physical

information that is held in the
state of a quantum system.
Thought the amount of

information that can be retrieved
in a single qubit is equal to one
bit, the difference lies in the
processing of information.
Quantum superposition
Quantum Superposition is a
fundamental principle of
quantum mechanics. It states that,
much like waves in
classical physics, any two (or
more) quantum states can be
added together ("superposed")
and the result will be another valid
quantum state; and conversely,
that every quantum state can be
represented as a sum of two or
more other distinct states.
Subatomic particle(electron) as qubit Photon as qubit
Quantum Entanglement
In Quantum Mechanics, it
sometimes occurs that a
measurement of one particle will
affect the state of another particle,
even though classically there is no
direct interaction.
When this happens, the state of the

two particles is said to be entangled.
Quantum Teleportation
Quantum Teleportation is a technique
used to transfer information on a
quantum level,usually from one
particle to another.
Its distinguishing features is that it can

transmit the information present in a
quantum superposition, useful for
quantum communication and
computation.
Application
Encryption Current
encryption methods work by
factoring numbers. Very easy
to do for small numbers.
Current encryption numbers
use over 400 digits in size.
Today's computers would take
about a billion years to factor
these numbers. A quantum
computer with a similar
performance as modern
computers would need
seconds.
Application
Quantum networking One possible use
of quantum computers is that of
networking, both intranet and internet.
Quantum teleportation using light beams
may be able to carry a great deal more
information, enough perhaps to support
practical computing. But the issue in this
is, creating large enough beams of light in
both locations, sending and receiving, to
send all of the data within a reasonable
amount of time.
Teleportation.
Artificial Intelligence.
Quantum Computers in Real
1. IBM (http://www.research.ibm.com/quan... )
2. University of Bristol (
Quantum in the Cloud Documentation}
3. Center for Quantum Computing and
Communication Technology University of
New South Wales (http://www.cqc2t.org/)
4. University of Science and Technology (China)
China hits milestone in developing quantum c
omputer
.
5. Google’s quantum computer.
There are 11 Quantum computers…..

conclusion
Quantum Computing could provide a radical change in the way computation is
performed.
The advantages of Quantum Computing lie in the aspects of Quantum Mechanics that
are peculiar to it, most notably entanglement.
Classical Computers will be significantly larger than Quantum Computers for the
foreseeable future.
References
Online Reference:-
● https://fortune.com/2019/02/22/quantum-computers-future/
● https://en.wikipedia.org/wiki/Quantum_computing
● https://www.wired.com/story/wired-guide-to-quantum-computing
● https://whatis.techtarget.com/definition/classical-computing
Book reference:
● quantum computing a gentle introduction

Thank you
Have a great day understanding quantum

computers! :)

Quantum Computers: A Seminar Presentation On

Uploaded by

Copyright:

Available Formats

Quantum Computers: A Seminar Presentation On

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Quantum Computers: A Seminar Presentation On

Uploaded by

Copyright:

Available Formats

A Seminar Presentation on

Why classical computers are used mostly?

In 1994, Peter Shor developed a quantum

Quantum computers, which are expected to perform certain computational tasks

Quantum information is physical

Thought the amount of

When this happens, the state of the

Its distinguishing features is that it can

There are 11 Quantum computers…..

● quantum computing a gentle introduction

Have a great day understanding quantum

You might also like