Professional Documents
Culture Documents
Quantum Computers: Mohammed Rayaan (16Ss1A0429)
Quantum Computers: Mohammed Rayaan (16Ss1A0429)
Sulthanpur(v),pulkal(M),Sangareddy-502293,Telangana
QUANTUM COMPUTERS
Sulthanpur(v),pulkal(M),Sangareddy-502293 Telangana
CERTIFICATE
This is to certify that the technical seminar on is a
bonafied work carried out by in partial
fulfillment of the requirements for the degree of BACHELOR OF
TECHNOLOGY IN ELECTRONICS AND COMMUNICATION
ENGINEERING by the Jawaharlal Nehru Technological University,Hyderabad
during the academic year 2019-2020
Head Of Department
i
ACKNOWLEDGEMENT
By
MD.RAYAAN (16SS1A0429)
ii
ABSTRACT
iii
TABLE OF CONTENTS
Certificate i
1Acknowledgement ii
Abstract iii
Chapter -1 Introduction 1
4.2 Superposition 8
4.5 Uncertainity 9
4.6 Entanglement 10
6.2 Applications 17
6.4 Conclusion 21
References 22
CHAPTER 1
INTRODUCTION
Quantum computer is a device that can arbitrarily manipulate the quantum state of
apart of itself. The fled of quantum computation is largely a body of the theoretical
promises for some impressively fast algorithms which could be executed on quantum
computers. However, since the first significant algorithm was proposed in 1994
experimental progress has been rapid with several schemes yielding two and three
quantum-bit manipulations.
1
that quantum superposition might allow quantum evolution to perform many
classical computations in parallel.
A qubit can exist not only in the states corresponding to the logical
values O or 1 as in the case of a classical bit, but also in a superposition state.
2
simultaneously. "Multi-qubyte systems have a power beyond anything possible
with classical computers." (Quantum Computers & Moore's Law, p. l).
3
CHAPTER 2
LITERATURE REVIEW
In 1982 Richard Feynman theorized that classic computation could be
dramatically improved by quantum effects, building on this, David Deutsch
developed the basis for quantum computing between 1984 and 1985. The next
major breakthrough came in 1994 when Peter Shor described a method to factor
large numbers in quantum poly-time (which breaks RSA encryption). This
became known as Shor's algorithm. At around the same time the quantum
complexity classes were developed and the quantum Turing machine was
described.
4
CHAPTER 3
THEORY OF QUANTUM MECHANICS
In 1909, a few years after demonstrating the photoelectric effect, Einstein
used his photon hypothesis to obtain a simple derivation of Planck's black body
distribution. Planck himself had not gone as far as Einstein: he had indeed
assumed that the transfer of energy between matter (the oscillators in the walls of
the cavity) and radiation was quantized (i.e. the energy transferred to/from an
oscillator occurred in "grains" less than h times the frequency of the
oscillator).But Planck had assumed the energy in the electromagnetic field, in the
cavity, was continuously distributed, as in classical theory. By contrast, it was
Einstein's hypothesis that the energy in the field itself was quantized: that for
certain purposes, the field behaved like an ideal gas, not of molecules, but of
photons, each with energy h times frequency, with the number of photons being
proportional to the intensity. The clue to this was Einstein's observation that the
high frequency part of Planck' s distribution for black body radiation(described by
Wien's law) could be derived by assuming a gas of photons and applying
statistical mechanics to it. This was in contrast to the low frequency part
(described by the Rayleigh-Jeans law) which could be successfully obtained using
classical electromagnetic theory, i.e. assuming waves. So you had both particles
and waves playing a part. Funhermore, Einstein looked at fluctuations of the
energy about its average value, and observed that the formula obtained had two
forms, one which you would get if light was made up of waves and the other if it
was made up of particles. Hence we have wave-particle duality.
5
whole number of waves around the nucleus. This gave an explanation of Bohr's
angular momentum quantum condition (see above).The new quantum theory was
developed between June 1925 and June1926. Werner Heisenberg, 1901 - 1976,
using a totally different and more simple atomic model (one that did not use
orbits) worked out a code to connect quantum numbers and spectra. He also
discovered that quantum mechanics does not follow the commutative law of
multiplication i.e. pq qp. When Max Born, 1882 — 1970 saw this he suggested
that Heisenberg use matrices. This became matrix mechanics, eventually all the
spectral lines and quantum numbers were deduced for hydrogen. The first
complete version of quantum mechanics was born. It's interesting to note that it
was not observation, or visualization that was used to deduce to theory - but pure
mathematics. Later we will see matrices cropping up in quantum computing.
6
type of measurement operations you are using to look at the system as to whether
it behaves like a particle or a wave. He then put together various aspects of the
work by Heisenberg, Schrodinger, and Born and concluded that the properties of a
system (such as position and momentum) are undefined having only potential
values with certain probabilities of being measured. This became known as the
Copenhagen interpretation of quantum mechanics. Einstein did not like the
Copenhagen interpretation and, for a good deal of time, Einstein kept trying to
refute it by thought experiment, but Bohr always had an answer. But in 1935
Einstein raised an issue that was to later have profound implications for quantum
computation and lead to the phenomenon we now call entanglement, a concept
we'll look at in a few pages.
7
CHAPTER 4
The main parts of quantum mechanics those are important for quantum
computing are:
4.2 Superposition
8
axis. When we pass a horizontally traveling electron through an inhomogeneous
magnetic field, in say, the vertical direction, the electron either goes up or down.
If we then repeat this with the up electron it goes up, with the down electron it
goes down. We say the up electron after the first measurement is in the state and
the down electron is in state . But, if we take the up electron and pass it through a
horizontal field it comes out on one side50% of the time and on the other side
50% of the time. If we represent these two states as and can say that the up spin
electron was in a superposition of the two states and such that, when we make a
measurement with the field horizontal we project the electron into one or the other
of the two states, with equal probabilities 1/2 given by the square of the
amplitudes.
4.5 Uncertainty
9
going. It has been postulated (and currently accepted) that particles in fact do not
have defined values for unknown properties until they are measured. This is like
saying that something does not exist until it is looked at.
4.6 Entanglement
10
single state vector to represent the entire system. Say the state is to be a vector in
Cn, this would be C2 for a spin system.
11
CHAPTER 5
12
There is no intermediate state between them, i.e. the value of the bit
cannot be in a superposition.
The symbolic notation is part of the Dirac notation . In terms of the above
it essentially means the same thing as O and 1, just like a classical bit. Generally,
a qubit's state during the computational phase is represented by a linear
combination of states otherwise called a superposition state.
Here are the probability amplitudes. They can be used to calculate the
probabilities of the system jumping into jOi or jli following a measurement or
readout operation. There may be, say a 25% chance is measured and a 75%
chance a 1 is measured. The percentages must add to 100%. In terms of their
representation qubits must satisfy: This the same things as saying the probabilities
add to 100%.Once the qubit is measured it will remain in that state if the same
measurement is repeated provided the system remains closed between
measurements. The probability that the qubit's state, when in a superposition, will
collapse to states is are actually vectors, they are called the computational basis
states that form an orthonormal basis for the vector spaceC2.Due to the nature of
quantum physics, the destruction of information in a gate will cause heat to be
evolved which can
13
CHAPTER 6
ADVANTAGE
The main advantage of quantum computing is it can execute any task
very faster when compared to the classical computer, generally the atoms changes
very faster in case of the traditional computing whereas in quantum computing it
changes even more faster. But all the tasks can’t be done better by quantum
computing when compared to traditional computer.
DISADVANTAGE
The research for this problem is still continuing the effort applied to
identify a solution for this problem has no positive progress.
14
6.2 APPLICATIONS
One of the areas that I have been researching is what applications can
best make use of the power of quantum computing. Although this is a work in
progress, I am providing a preliminary assessment for my readers based upon
discussions with various experts and other research I have done so far. The list
below is shown in a priority order based upon the combination of three factors
that I have reviewed: Progress-to-Date, Difficulty, and Payoff. One thing to note
is that the successful implementations for most, if not all, of these application
areas will probably be based upon a hybrid platform that combines classical and
quantum computing in a cloud environment to achieve the best of both worlds. So
here’s the list.
Machine Learning
Machine learning is a hot area right now because we are now seeing
significant deployments at the consumer level of many different platforms. We
are now seeing aspects of this every day in voice, image and handwriting
recognition, to name just a few examples. But it is also a difficult and
computationally expensive task, particularly if you want to achieve good
accuracy. Because of the potential payoff, there is a lot of research ongoing
based upon sampling of Boltzmann distributions.
Computational Chemistry
There are many problems in materials science that can achieve a huge
payoff if we just find the right catalyst or process to develop a new material, or an
existing material more efficiently. There is already a significant effort in using
classical computers to simulate chemical interactions, but in many cases the
problems become intractable for solving classically. So the original idea
presented by Richard Feynman is why not use a quantum computer to simulate the
quantum mechanical processes that occur. Here are just a few examples of
significant problems that could see large payoffs if we can solve them.
15
Replace the Haber process to produce ammonia for use in
fertilizers
16
to figure out the optimum prices of all the dozens car options to maximize
customer satisfaction and profit. Although, classical computing is used heavily to
do these tasks, some of them may be too complicated for a classical computing
solution whereas a quantum approach may be able to do it.
Drug Design
Cyber Security
Cyber security is becoming a larger issue every day as threats around the
world are increasing their capabilities and we become more vulnerable as we
increase our dependence upon digital systems, learn more about cybersecurity in
2019 over at sites such as upskilled and others. Various techniques to combat
cyber security threats can be developed using some of the quantum machine
learning approaches mentioned above to recognize the threats earlier and mitigate
the damage that they may do.
Codebreaking
You may wonder why I have put codebreaking so far down the list, given
all the attention given to Shor’s algorithm and its ability to factor large numbers
and break RSA encryption. The reason is that I believe that this will just be a
temporary application until the world converts to a class of “post-quantum”
cryptographic techniques that will not be vulnerable to breaking by a quantum
computer. There is an increasing amount of research in post-quantum
cryptography that you can review here and here. So although, we probably will
17
have quantum computers able to factor very large numbers 10 years from now, it
is not clear if we will have a use for it at that time.
18
6.3 FUTURE SCOPE
The major reason for the success of quantum computers over super
computers is the flawless security provided by the quantum computers. Many
governments have already installed quantum computers for military and medical
security.
PROCESSING
19
This flexibility can be explained by the concept of superposition of
various energy states. Qubits also increase the processing speed of the computers
and display results at the rate of nanoseconds (average). Sometimes it is also
possible to obtain the results at an even faster rate i.e. at picoseconds. The laws of
Quantum physics, which govern the microscopic world, allow bits of mater to be
in two states simultaneously. All modern-day computing relies on the ultrafast
manipulation of billions of bits of information. Quantum Computing combines
these two concepts, allowing the computers to put bits of information into their 0
and 1 state simultaneously. (Superposition), thus making the quantum
computation powerful and fast.
20
6.4 CONCLUSION
Quantum computers easily solve applications that can't be done with help
of today's computers. This will be one of the biggest steps in science and will
undoubtedly revolutionize the practical computing world.
21
REFERENCES
www.ibm.com/blogs/research/2018/10/quantum.
www.sciencedaily.com/releases/2018/10/
www.wired.co.uk/article/quantum-computing-explained
www.dwavesys.com
www.technologyreview.com/s/612844/what-is.
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42