Study and Comparative Analysis of Quantum Computing Techniques

Chaitanya Vilas Gawande, Ritesh Prabhakarrao Eklare, Prof. Lekhraj Vilhekar

Student, Information Technology, Student, Information Technology, Lecturer, Information Technology,
Government Polytechnic Gondia, Government Polytechnic Gondia, Government Polytechnic Gondia,
441601, Maharastra, India 441601, Maharastra, India 441601, Maharastra, India
[email protected] [email protected] [email protected]

ABSTRACT: civilizations as a whole-results from this over

Quantum Computing is a technology, which
time. The development of computers can be
promises to overcome the drawbacks of
conventional CMOS technology for high seen as the result of years of technological
density and high performance applications. Its progress. starting with Charles Babbage's early
potential to revolutionize today’s computing
world is attracting more and more researchers theories and the eventual building of the first
towards this field. However, due to the computer, Alan Turing's. groundbreaking work
involvement of quantum properties, many
beginners find it difficult to follow the field. in artificial intelligence and computing, and the
Therefore, in this research note an effort has deciphering of the German Enigma code. The
been made to introduce the various aspects of
quantum computing to researchers, quantum procedure entails a series of transitions between
engineers and scientists. The historical various physical realisations, such as integrated
background and basic concepts necessary to
circuits, chips, gears, valves, and transistors.
understand quantum computation and
information processing have been introduced Even though computers these days are much
in a lucid manner. Various physical
faster and smaller than they used to be. They
implementations and potential application
areas of quantum computation have also been still have to manipulate and decipher a binary
discussed in this paper. bit that is being encoded in order to produce a
CONTENTS useful computational output. The properties of
conventional logic gates are determined by
➢ Introduction
➢ Evolution of Computing classical rules, whereas matter is subject to the
➢ Limitation of Classification of laws of quantum mechanics. Quantum
Computers
➢ Birth of Art of Quantum Computing technology must take the place of current
➢ Application of Quantum computing technology if computers are to get smaller. This
➢ Quantum Parallelism in Computing
is because quantum technology can provide
I. INTRODUCTION new computational types that are both

New methods for the exploitation of different quantitative and qualitative, as well as new

physical resources, such as materials, forces, algorithms that are based on the fundamentals

and energies, were found as science and of quantum mechanics. The study of quantum

technology advanced. The advancement of computation is necessary because of the

1Page
physical constraints placed on classical Quantum computers harness these
computers and the fact that quantum computers fundamental phenomena to compute
can complete those particular tasks faster than a probabilistically and quantum
classical computer. Quantum mechanics ideas mechanically.
are used to enable the development of quantum
Four key principles of quantum mechanics
computers.

Understanding quantum computing

What is quantum computing?
requires understanding these four key
Quantum computing is an emergent field of principles of quantum mechanics:
cutting-edge computer science harnessing
the unique qualities of quantum mechanics • Superposition: Superposition is the
to solve problems beyond the ability of state in which a quantum particle or
even the most powerful classical system can represent not just one
computers. possibility, but a combination of
multiple possibilities.
The field of quantum computing contains a
range of disciplines, including quantum • Entanglement: Entanglement is the
hardware and quantum algorithms. While process in which multiple quantum
still in development, quantum technology particles become correlated more
will soon be able to solve complex strongly than regular probability
problems that supercomputers can’t solve, allows.
or can’t solve fast enough.
• Decoherence: Decoherence is the
By taking advantage of quantum physics,
process in which quantum particles
fully realized quantum computers would be
and systems can decay, collapse or
able to process massively complicated
change, converting into single states
problems at orders of magnitude faster than
measurable by classical physics.
modern machines. For a quantum
computer, challenges that might take a • Interference: Interference is the
classical computer thousands of years to phenomenon in which entangled
complete might be reduced to a matter of quantum states can interact and
minutes. produce more and less likely
probabilities.
The study of subatomic particles, also
known as quantum mechanics, reveals Qubits
unique and fundamental natural principles. 2Page
What are qubits? performing computations and fine-
Generally, qubits are created by tuned control.
manipulating and measuring quantum
particles (the smallest known building • Trapped ion qubits: Trapped ion
blocks of the physical universe), such as particles can also be used as qubits
photons, electrons, trapped ions and atoms. and are noted for long coherence
Qubits can also engineer systems that times and high-fidelity
behave like a quantum particle, as in measurements.
superconducting circuits.
• Quantum dots: Quantum dots are
To manipulate such particles, qubits must
small semiconductors that capture a
be kept extremely cold to minimize noise
single electron and use it as a qubit,
and prevent them from providing
offering promising potential for
inaccurate results or errors resulting from
scalability and compatibility with
unintended decoherence.
existing semiconductor technology.

There are many different types of qubits

• Photons: Photons are individual
used in quantum computing today, with
light particles used to send quantum
some better suited for different types of
information across long distances
tasks.
through optical fiber cables and are
currently being used in quantum
communication and quantum
cryptography.

• Neutral atoms: Commonly

occurring neutral atoms charged
with lasers are well suited for
A few of the more common types of qubits scaling and performing operations.
in use are as follows:
When processing a complex problem, such
• Superconducting qubits: Made as factoring large numbers, classical bits
from superconducting materials become bound up by holding large
operating at extremely low quantities of information. Quantum bits
temperatures, these qubits are behave differently. Because qubits can hold
favored for their speed in a superposition, a quantum computer that

3Page
uses qubits can approach the problem in offered a solution to the key distribution issue.
ways different from classical computers. Users can send messages in these kinds of
scenarios without agreeing on a secret key. The
idea of a two-key safe is utilised, where a
II. EVOLUTION OF COMPUTING:-
public key is used to lock it and a private key is
Quantum concept of quantum mechanically-
used to unlock it. In real life, these two keys
based computing devices was initially
correspond to large integer numbers. The
investigated in the 1970s and early 1980s by
private key can be used to easily obtain the
computer scientists and physicists Charles H.
public key, but not the other way around. The
Bennet, Paul A. Benioff, David Deutsch, and
reason for this procedure is that certain
Richard P. Feynman. The idea first surfaced
mathematical operations are easier to execute
when scientists were debating the fundamental
in one way than the other. For instance,
boundaries of computation. It is possible for
factorising two numbers can be completed
scientists to conduct experiments in quantum
much more quickly than multiplying them by
physics within a quantum mechanical computer
two. If the time required to execute an
thanks to the system they designed. On a
algorithm remains relatively constant when
classical computer, solving manybody quantum
applied to large numbers, then the algorithm is
mechanical problems takes exponentially more
considered fast. For instance, it takes
time. On the other hand, the quantum computer
significantly longer to multiply two thirty-digit
can complete all calculations in polynomial
numbers using the trial division method than it
time. In 1994. Peter Shor devised a technique
does to multiply two three-digit numbers.
to use quantum computing to solve
Because of this, the trial division method isn't
factorization, a notorious problem in number
always a quick algorithm. Public key
theory. The ability to factor large numbers
cryptosystems are seen to be able to get around
quickly and with computational times orders of
the basic distribution issue. But the security
magnitude smaller than those of conventional
hinges on unverified mathematical
computers was demonstrated by organising a
presumptions, like how hard it is to factor big
set of mathematical operations specifically
integers.
created for a quantum computer. [1.2.3] The
development of quantum computing has IV. BIRTH OF ART OF
QUANTUM COMPUTING:-
captured the interest of researchers worldwide.
In 1982, Richard P. Feynman postulated that a
III. LIMITATIONS OF CLASSICAL quantum physical system consisting of N
COMPUTERS:- The "Public Key" systems, a particles and their quantum probabilities could
clever mathematical discovery from the 1970s, not be simulated by a standard computer 4Page
without experiencing an exponential decrease
in simulation efficiency. Nonetheless, a
polynomial slowdown can be used to simulate
them in classical physics. The primary cause is
that the user can describe the size of a particle
system without experiencing an exponential
decrease in simulation efficiency. Nonetheless,
a polynomial slowdown can be used to
simulate them in classical physics. The primary
cause is that, in quantum computing, the
particle system's description size is exponential Quantum computing has the potential to
in N. whereas in classical physics, it is linear in revolutionize various fields by solving certain
N. By doing this, the slowdown that occurs problems. exponentially faster than classical
when simulating quantum systems may be computers. Some key application areas of
avoided. Feynman also discussed how the quantum computing include:
interference phenomena is the reason behind
the difficulty in using a probabilistic computer Cryptography:- Quantum computers could
to simulate a quantum physical system. break widely-used cryptographic systems like
Therefore, all of these elements contributed to RSA and ECC by efficiently factoring large
the development of quantum computing. which numbers. Conversely. quantum key distribution
made it possible to use quantum computers and (QKD) promises ultra-secure communication
get around all of the drawbacks of classical channels.
computers. Optimization Problems:- Quantum. computers
can efficiently handle optimization problems,
V. APPLICATION AREA QUANTUM
COMPUTING:- such as logistics optimization. portfolio
optimization, and scheduling, by exploring
multiple possibilities simultaneously.

Machine Learning:- Quantum computing can

enhance machine learning algorithms,
particularly for tasks like pattem recognition,
optimization problems, and complex data
analysis.

5Page
Drug Discovery and Material Science:- quantum level, allowing for a deeper
Quantum computers can simulate molecular understanding of quantum mechanics and
interactions and quantum states, aiding in drug materials science.
discovery and the development of new
materials by predicting their properties more Database Search:- Quantum algorithms, such as
accurately. Grover's algorithm, can perform database
searches faster than classical algorithms,
Financial Modeling:- Quantum computing can potentially impacting data retrieval and
be used for complex financial modeling and searching.
risk analysis, optimizing portfolios, and
developing advanced algorithms for trading Secure Communication:- Quantum key
strategies. distribution (QKD) ensures secure
communication by leveraging the principles of
Supply Chain and Logistics:- Quantum quantum mechanics to detect eavesdropping
computing can optimize supply chain and attempts.
logistics operations by solving complex routing
VI. QUANTUM PARALLELISM
and scheduling problems, leading to more
IN COMPUTING:-
efficient. resource allocation.
Parallelism in A task is divided into simple
operations that are performed one at a time in a
Climate Modeling:- Quantum computers can
serial fashion when using a traditional
simulate complex climate models more
computer. There have been failed attempts to
accurately, aiding in climate research and the
run two computers at the same time in order to
development of strategies to mitigate the
address different aspects of a problem at the
impact of climate change.
same time. The main reason for this is that the
logic in microprocessors is intrinsically serial;
Artificial Intelligence:- Quantum computing
even when a traditional computer appears to be
can enhance certain aspects of artificial
performing multiple tasks at once, it is actually
intelligence, including speeding up training
only quickly cycling through each step one at a
processes for machine learning models and
time. This explains why even the most
solving complex optimization problems
powerful supercomputers have limitations
inherent in Al algorithms.
when it comes to solving large, complex
problems. The microprocessors in these
Simulating Physical Systems:- Quantum
computers are not slow. They are, rather,
computers can simulate physical systems at the
inefficient for these tasks. To deal with the 6Page
problem of simultaneity, a computer should be is the property that distinguishes qubits from
built with parallelism. Quantum computers are traditional bits used in computers. [5]
examples of such computers. According to the
VIII. EXPERIMENTAL REALIZATION OF
principle of linear superposition, a quantum QUANTUM COMPUTING:-
system in a quantum state is a superposition of
The simplified architectural model of quantum
many classical and classical-like states. If this
computers makes them faster, cheaper, and
superposition can be protected from all other
smaller. However, its conceptual complexities.
external interferences, then a quantum
make experimental realisation extremely
computer can produce results based on all of its
difficult and, for a time, unrealistic.
different classical states. This is known as
Nonetheless, there have been numerous
quantum parallelism.
attempts in this direction, with some promising

VII. CONCEPTS COMPUTERS:- outcomes. Perhaps quantum computers will

soon replace traditional computers. Quantum
of Quantum In contrast to classical computers,
Computers Based on Heteropolymers Teich
the fundamental unit of information in a
designed and built the first heteropolymer-
quantum computer is quaternary rather than
based quantum computer in 1988, which was
binary. It is known as a "qubit" (short for
later improved by Lloyd in 1993. This
quantum bit) and is analogous to the term "bit"
heteropolymer-based quantum computer
in classical computers. The qubit's properties
employs a linear array of atoms as memory
stem from its adherence to quantum mechanics
cells. Information is stored on a cell by
laws. We can put a qubit not only in the logical
pumping the corresponding atom into an
state 0 or 1. but also in both 0 and 1, with a
excited state. Laser pulses of appropriately
numerical coefficient representing the
tuned frequencies are used to transmit the
probability of each state. Because quantum
instruction to the heteropolymer. The shape
mechanics only works at the atomic level and
and. duration of the pulse determine the nature
classical mechanics governs real life situations,
of the computation performed on selected
the concept appears suspicious. The qubit can
atoms.[4]
be visualised physically as the spin of a one-
electron system (s=1/2); the two states +1/2 and
IX.CONCLUSION:-
- 1/2 are the eigenstates of an external magnetic
Although quantum computation is a well-
field with spin 12. As a result, the qubit can
established topic of interest, opportunities for
have two values, 0 or 1, which correspond to
future growth are still being pursued. The
the two eigenstates of a single electron's spin. It
research in quantum algorithms, logic gate
is also possible that it is the superposition of
these two states with complex coefficients. This
operations, error correction. understanding 7Page
dynamics and decoherence control, atomic- Brown, J., The Quest for the
scale technology, and practical applications is Quantum Computer, Simon and
ongoing. Complex number properties (analytic Schuster
functions, conformal mappings) can be used to McMahon, D., Quantum Mechanics
discover new algorithms. The theoretical tools Demystified, McGraw Hill, New
required to solve many-body quantum York
entanglement are not well developed. Its (2005).
improved characterization enables better ONLINE RESOURCES

implementation of quantum logic gates as well Quantum Information Course notes by

as the correction of correlated errors. The David Bacon
http://www.cs.washington.edu/education/
system and the observer are made up of courses/ cse599d/06wi/
quantum building blocks, but neither the
decoherence nor the measurement are fully
understood. The transition from the classical to
the quantum regime is a fascinating subject to
investigate. If there is something beyond
quantum theory, it will be discovered in the
race to create quantum devices. While
attempting to overcome decoherence, new
limitations of quantum theory may be
discovered. The race to miniaturise electronic
circuits is not too far removed from nature's
quantum reality. The new paradigm of quanturn
computing will accelerate Al development and
assist us in developing tomorrow's innovations.
Leading Al firms are making quantum
computing developments by developing
quantum processors and novel quantum
algorithms.

X. REFERENCES:-

Bouwmeester, D., A. Ekert, A.

Zeilinger (eds.) The Physics of
Quantum
Information, Springer, Berlin (2001).
8Page