Prototyping Presentation
Prototyping Presentation
Prototyping Presentation
quantum
computing and its
applications
ABSTRACT:
Quantum computing is a modern way of computing that is based on the
science of quantum mechanics and its unbelievable phenomena. It is a
beautiful combination of physics, mathematics, computer science and
information theory. It provides high computational power, less energy
consumption and exponential speed over classical computers by controlling
the behavior of small physical objects i.e. microscopic particles like atoms,
electrons, photons, etc. Here, we present an introduction to the fundamental
concepts and some ideas of quantum computing. This paper starts with the
origin of traditional computing and discusses all the improvements and
transformations that have been done due to their limitations until now. Then it
moves on to the basic working of quantum computing and the quantum
properties it follows like superposition, entanglement and interference. To
understand the full potentials and challenges of a practical quantum computer
that can be launched commercially, the paper covers the architecture,
hardware, software, design, types and algorithms that are specifically required
by the quantum computers.
It uncovers the capability of quantum computers that can impact
our lives in various viewpoints like cyber security, traffic
optimization, medicines, artificial intelligence and many more. At
last, we concluded all the importance, advantages and
disadvantages of quantum computers. Small-scale quantum
computers are being developed recently. This development is
heading towards a great future due to their high potential
capabilities and advancements in ongoing research. Before
focusing on the significances of a general-purpose quantum
computer and exploring the power of the new arising technology,
it is better to review the origin, potentials, and limitations of the
existing traditional computing. This information helps us in
understanding the possible challenges in developing exotic and
competitive technology. It will also give us an insight into the
ongoing progress in this field.
Why we need quantum computers?
2. computing power
1.Cryptography
2.Optimization Problems
3.Artificial Intelligence
4. Quantum Simulation
Future scope of quantum computer:
Quantum games’ are predicted in the future that will give unexpected situations and
results that a player can experience because quantum computers will take all the
possible operations and throws them into the game randomly due to its quantum
properties like superpositioning and entanglement of qubits. It will be a never-ending
experience.
‘Quantum computing in Cloud’ has the potential to overtake business initiatives like in
other emerging technologies such as cryptography and artificial Intelligence. Since
the classical simulation of fifty qubits is equal to the memory of one Petabyte that
doubles with every single qubit added [35], the memory required should also be large
enough to provide an environment for application development and testing for
multiple developers to simulate quantum computers using suitable shared resources.
Quantum computing in Cloud’ has the potential to overtake business
initiatives like in other emerging technologies such as cryptography and
artificial Intelligence. Since the classical simulation of fifty qubits is equal
to the memory of one Petabyte that doubles with every single qubit
added [35], the memory required should also be large enough to provide
an environment for application development and testing for multiple
developers to simulate quantum computers using suitable shared
resources.
AI and machine learning problems could be solved in a practical
amount of time that can be reduced from hundreds of thousands of
years to seconds. Several quantum algorithms have been developed
such as Grover’s algorithm for searching.More quantum algorithms are
coming soon.
References:
1.
2.
Theis, T. N., & Wong, H. S. P. (2017). The end of moore’s law: A new
beginning for information technology. Computing in Science &
Engineering, 19(2), 41-50
3.