Gokul Sai R:-1GA17EC041 Harshitha H R: - 1GA17EC049 Gowrav S: - 1GA17EC042 Amogh R: - 1GA17EC013 Bhoomika S S:-1GA17EC019

Presented by :
Gokul Sai R :- 1GA17EC041

Harshitha H R :- 1GA17EC049
Gowrav S :- 1GA17EC042
Amogh R :- 1GA17EC013
Bhoomika S S :-1GA17EC019
WHAT IS QUANTUM COMPUTING?
• Quantum computers could spur the development of

new breakthroughs in science, medications to save
lives, machine learning methods to diagnose
illnesses sooner, materials to make more efficient
devices and structures, financial strategies to live
well in retirement, and algorithms to quickly direct
resources such as ambulances.
• But what exactly is quantum computing, and what
does it take to achieve these quantum
breakthroughs? Here’s what you need to know.
QUANTUM ENTANGLEMENT
• Quantum entanglement is a physical phenomenon that
occurs when pairs or groups of particles are generated,
interact, or share spatial proximity in ways such that the
quantum state of each particle cannot be described
independently of the state of the others, even when the
particles are separated by a large distance.
• Measurements of physical properties such as position,
momentum, spin, and polarization, performed on
entangled particles are found to be perfectly correlated.
For example, if a pair of particles is generated in such a
way that their total spin is known to be zero, and one
particle is found to have clockwise spin on a certain axis,
the spin of the other particle, measured on the same axis,
will be found to be counterclockwise, as is to be expected
due to their entanglement.
This phenomenon violated einstein’s time dialation phenomenon as for the
information to pass from one quantum bit to another(entangled particle)
instantaneously the information must travel faster than light which is next to
imposible considering the present technology and so einstein simply stated this
phenomenon as “SPOOKY ACTION AT A DISTANCE”
Now using a quantum processor we can entangle two q-bits using a
‘ WALSH–HADAMARD GATE’
and a ‘CONTROLLED NOT GATE’ in short a c-not gate.
NO-CLONING THEOREM
• In physics, the no-cloning theorem states that it is impossible to create an identical copy of
an arbitrary unknown quantum state. This no-go theorem of quantum mechanics wa s
articulated by James Park in proving the impossibility of a simple perfect non-disturbing
measurement scheme,[1] in 1970 and rediscovered by Wootters and Zurek[2] and by Dieks[3] in
1982. It has profound implications in quantum computing
• This is because the very act of measurement of the Q-bit itself changes the characteristics
of that Q-bit as we are measuring whether it being spin up or spin down which in boolean
being logic high (1) or logic low (0)because we are employing electromagnetic field to
determine the magnetic spin of the particle this field applied interfere with the Q-bit thereby
changing the quantum information
• In order to overcome this quantum entanglement is employed where the transfer of data
happens through entangled particles while retrieving the data both entangled bits are
measured simultaneously since entangled particle are always set to have opposite spin to
each other the error caused due to measurement can be eliminated and the data can be
retrived easily
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.
Mathematically, it refers to a property of solutions to the Schrödinger equation; since the
Schrödinger equation is linear, any linear combination of solutions will also be a solution.
• Consider a simple example of a simple musical note from different instruments consider
each instrument gives out one particular information(tone or rythm) the combined effect of
all the notes will be the superposition of sounds of all the musical instrument gives a
musical tone similarly the quantum bit will have polarisation of both vertical and
horizontal before measurement after measurement the result will either collapse to either
vertical polarisation or horizontal with each 50% probability
APPLICATION OF QUANTUM COMPUTING
1} Quantum chemistry :
• One of the first and most promising
applications of quantum computing will be in
the area of chemistry. Even for simple
molecules like caffeine, the number of
quantum state in the molecule can be
astoundingly large – ooo large that all the
conventional computing memory and
processing power that could ever be built
could not model it.
• There are a few different ways quantum systems use
quantum properties to compute. Let’s investigate one
type of algorithm designed for current quantum
hardware, which uses quantum computing to find the
“best” solution among many possible solutions.
• This algorithm can be used to simulate a molecule by
determining the lowest energy state among various
molecular bond lengths. For each possible bond
length, parts of the energy state are represented on a
quantum processor. Then, aspects of the quantum state
are measured and related back to an energy in the
molecule, for the given electronic configuration.
• Repeating this process for different inter-atomic
spacings eventually leads to the bond length with the
lowest energy state, which represents the equilibrium
molecular configuration.
2} Shor’s algorithm Quantum computing:
• Shor's algorithm is a quantum computer algorithm for integer factorization.[1]
Informally, it solves the following problem: Given an integer {\displaystyle N}, find its
prime factors. It was invented in 1994 by the American mathematician Peter Shor
• If a quantum computer with a sufficient number of qubits could operate without
succumbing to quantum noise and other quantum-decoherence phenomena, then Shor's
algorithm could be used to break public-key cryptography schemes, such as the widely-
used RSA scheme. RSA is based on the assumption that factoring large integers is
computationally intractable. As far as is known, this assumption is valid for classical
(non-quantum) computers; no classical algorithm is known that can factor integers in
polynomial time. However, Shor's algorithm shows that factoring integers is efficient on
an ideal quantum computer, so it may be feasible to defeat RSA by constructing a large
quantum computer. It was also a powerful motivator for the design and construction of
quantum computers, and for the study of new quantum-computer algorithms. It has also
facilitated research on new cryptosystems that are secure from quantum computers,
collectively called post-quantum cryptography.
• So Guys when u swipe your debit/credit card this is what is sent from an
ATM to the bank servers
189216843265128426882
789617892005321865248
2174925731982349836

Gokul Sai R:-1GA17EC041 Harshitha H R: - 1GA17EC049 Gowrav S: - 1GA17EC042 Amogh R: - 1GA17EC013 Bhoomika S S:-1GA17EC019

Uploaded by

Copyright:

Available Formats

Gokul Sai R:-1GA17EC041 Harshitha H R: - 1GA17EC049 Gowrav S: - 1GA17EC042 Amogh R: - 1GA17EC013 Bhoomika S S:-1GA17EC019

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

Gokul Sai R:-1GA17EC041 Harshitha H R: - 1GA17EC049 Gowrav S: - 1GA17EC042 Amogh R: - 1GA17EC013 Bhoomika S S:-1GA17EC019

Uploaded by

Copyright:

Available Formats

Presented by :

Gokul Sai R :- 1GA17EC041

• Quantum computers could spur the development of

• Quantum superposition is a fundamental principle of quantum mechanics. It states that,

You might also like