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: I. INTRODUCTION
Quantum Computing is a technology, which promises
to overcome the drawbacks of conventional CMOS
New methods for the exploitation of different physical
technology for high density and high performance resources, such as materials, forces, and energies, were

applications. Its potential to revolutionize today’s found as science and technology advanced. The
computing world is attracting more and more advancement of civilizations as a whole-results from
researchers towards this field. However, due to the this over time. The development of computers can be
involvement of quantum properties, many beginners seen as the result of years of technological progress.
find it difficult to follow the field. Therefore, in this starting with Charles Babbage's early theories and the
research note an effort has been made to introduce the eventual building of the first computer, Alan Turing's.
various aspects of quantum computing to researchers, groundbreaking work in artificial intelligence and
quantum engineers and scientists. The historical computing, and the deciphering of the German Enigma
background and basic concepts necessary to understand code. The procedure entails a series of transitions
quantum computation and information processing have between various physical realisations, such as integrated
been introduced in a lucid manner. Various physical circuits, chips, gears, valves, and transistors. Even
implementations and potential application areas of though computers these days are much faster and
quantum computation have also been discussed in this smaller than they used to be. They still have to
paper.
manipulate and decipher a binary bit that is being

CONTENTS encoded in order to produce a useful computational

➢ Introduction output. The properties of conventional logic gates are
➢ Evolution of Computing
➢ Limitation of Classification of Computers determined by classical rules, whereas matter is subject
➢ Birth of Art of Quantum Computing to the laws of quantum mechanics. Quantum technology
➢ Application of Quantum computing
➢ Quantum Parallelism in Computing must take the place of current technology if computers
➢ Concept Computers are to get smaller. This is because quantum technology
➢ Experimental Realization of Quantum
Computing can provide new computational types that are both
➢ Conclusion
quantitative and qualitative, as well as new algorithms
➢ Resources
that are based on the fundamentals of quantum
mechanics. The study of quantum computation is Four key principles of quantum mechanics
necessary because of the physical constraints placed on
classical computers and the fact that quantum computers Understanding quantum computing requires

can complete those particular tasks faster than a understanding these four key principles of quantum
mechanics:
classical computer. Quantum mechanics ideas are used
to enable the development of quantum computers.
• Superposition: Superposition is the state in
which a quantum particle or system can
What is quantum computing?
represent not just one possibility, but a
Quantum computing is an emergent field of cutting- combination of multiple possibilities.
edge computer science harnessing the unique
qualities of quantum mechanics to solve problems • Entanglement: Entanglement is the
beyond the ability of even the most powerful process in which multiple quantum particles
classical computers. become correlated more strongly than
regular probability allows.
The field of quantum computing contains a range
of disciplines, including quantum hardware and • Decoherence: Decoherence is the process
quantum algorithms. While still in development, in which quantum particles and systems can
quantum technology will soon be able to solve decay, collapse or change, converting into
complex problems that supercomputers can’t solve, single states measurable by classical
or can’t solve fast enough. physics.

By taking advantage of quantum physics, fully

• Interference: Interference is the
realized quantum computers would be able to
phenomenon in which entangled quantum
process massively complicated problems at orders
states can interact and produce more and
of magnitude faster than modern machines. For a
less likely probabilities.
quantum computer, challenges that might take a
classical computer thousands of years to complete Qubits
might be reduced to a matter of minutes.
What are qubits?
The study of subatomic particles, also known as Generally, qubits are created by manipulating and
quantum mechanics, reveals unique and measuring quantum particles (the smallest known
fundamental natural principles. Quantum building blocks of the physical universe), such as
computers harness these fundamental phenomena photons, electrons, trapped ions and atoms. Qubits
to compute probabilistically and quantum can also engineer systems that behave like a
mechanically. quantum particle, as in superconducting circuits.
To manipulate such particles, qubits must be kept • Photons: Photons are individual light
extremely cold to minimize noise and prevent them particles used to send quantum information
from providing inaccurate results or errors resulting across long distances through optical fiber
from unintended decoherence. cables and are currently being used in
quantum communication and quantum
There are many different types of qubits used in cryptography.
quantum computing today, with some better suited
for different types of tasks. • Neutral atoms: Commonly occurring
neutral atoms charged with lasers are well
suited for scaling and performing
operations.

When processing a complex problem, such as

factoring large numbers, classical bits become
bound up by holding large quantities of
information. Quantum bits behave differently.
A few of the more common types of qubits in use
Because qubits can hold a superposition, a quantum
are as follows:
computer that uses qubits can approach the problem

• Superconducting qubits: Made from in ways different from classical computers.

superconducting materials operating at

extremely low temperatures, these qubits
II. EVOLUTION OF COMPUTING:- Quantum
are favored for their speed in performing
concept of quantum mechanically-based computing
computations and fine-tuned control.
devices was initially investigated in the 1970s and early

• Trapped ion qubits: Trapped ion particles 1980s by computer scientists and physicists Charles H.
can also be used as qubits and are noted for Bennet, Paul A. Benioff, David Deutsch, and Richard P.
long coherence times and high-fidelity Feynman. The idea first surfaced when scientists were
measurements. debating the fundamental boundaries of computation. It
is possible for scientists to conduct experiments in
• Quantum dots: Quantum dots are small quantum physics within a quantum mechanical
semiconductors that capture a single computer thanks to the system they designed. On a
electron and use it as a qubit, offering classical computer, solving manybody quantum
promising potential for scalability and
mechanical problems takes exponentially more time. On
compatibility with existing semiconductor
the other hand, the quantum computer can complete all
technology.
calculations in polynomial time. In 1994. Peter Shor
devised a technique to use quantum computing to solve security hinges on unverified mathematical
factorization, a notorious problem in number theory. presumptions, like how hard it is to factor big integers.
The ability to factor large numbers quickly and with
IV. BIRTH OF ART OF QUANTUM
computational times orders of magnitude smaller than
COMPUTING:-
those of conventional computers was demonstrated by
In 1982, Richard P. Feynman postulated that a quantum
organising a set of mathematical operations specifically
physical system consisting of N particles and their
created for a quantum computer. [1.2.3] The
quantum probabilities could not be simulated by a
development of quantum computing has captured the
standard computer without experiencing an exponential
interest of researchers worldwide.
decrease in simulation efficiency. Nonetheless, a
polynomial slowdown can be used to simulate them in
III. LIMITATIONS OF CLASSICAL
COMPUTERS:- classical physics. The primary cause is that the user can

The "Public Key" systems, a clever mathematical describe the size of a particle system without

discovery from the 1970s, offered a solution to the key experiencing an exponential decrease in simulation

distribution issue. Users can send messages in these efficiency. Nonetheless, a polynomial slowdown can be

kinds of scenarios without agreeing on a secret key. The used to simulate them in classical physics. The primary

idea of a two-key safe is utilised, where a public key is cause is that, in quantum computing, the particle

used to lock it and a private key is used to unlock it. In system's description size is exponential in N. whereas in

real life, these two keys correspond to large integer classical physics, it is linear in N. By doing this, the

numbers. The private key can be used to easily obtain slowdown that occurs when simulating quantum

the public key, but not the other way around. The reason systems may be avoided. Feynman also discussed how

for this procedure is that certain mathematical the interference phenomena is the reason behind the

operations are easier to execute in one way than the difficulty in using a probabilistic computer to simulate a

other. For instance, factorising two numbers can be quantum physical system. Therefore, all of these

completed much more quickly than multiplying them by elements contributed to the development of quantum

two. If the time required to execute an algorithm computing. which made it possible to use quantum

remains relatively constant when applied to large computers and get around all of the drawbacks of

numbers, then the algorithm is considered fast. For classical computers.

instance, it takes significantly longer to multiply two

V. APPLICATION AREA QUANTUM COMPUTING:-
thirty-digit numbers using the trial division method than
it does to multiply two three-digit numbers. Because of
this, the trial division method isn't always a quick
algorithm. Public key cryptosystems are seen to be able
to get around the basic distribution issue. But the
 quantum states, aiding in drug discovery and the
development of new materials by predicting their
properties more accurately.

Financial Modeling:- Quantum computing can be used

for complex financial modeling and risk analysis,
optimizing portfolios, and developing advanced
algorithms for trading strategies.

Supply Chain and Logistics:- Quantum computing can

Quantum computing has the potential to revolutionize optimize supply chain and logistics operations by
various fields by solving certain problems. solving complex routing and scheduling problems,
exponentially faster than classical computers. Some key leading to more efficient. resource allocation.
application areas of quantum computing include:
Climate Modeling:- Quantum computers can simulate
Cryptography:- Quantum computers could break complex climate models more accurately, aiding in
widely-used cryptographic systems like RSA and ECC climate research and the development of strategies to
by efficiently factoring large numbers. Conversely. mitigate the impact of climate change.
quantum key distribution (QKD) promises ultra-secure
communication channels. Artificial Intelligence:- Quantum computing can
Optimization Problems:- Quantum. computers can enhance certain aspects of artificial intelligence,
efficiently handle optimization problems, such as including speeding up training processes for machine
logistics optimization. portfolio optimization, and learning models and solving complex optimization
scheduling, by exploring multiple possibilities problems inherent in Al algorithms.
simultaneously.
Simulating Physical Systems:- Quantum computers can
Machine Learning:- Quantum computing can enhance simulate physical systems at the quantum level,
machine learning algorithms, particularly for tasks like allowing for a deeper understanding of quantum
pattem recognition, optimization problems, and mechanics and materials science.
complex data analysis.
Database Search:- Quantum algorithms, such as
Drug Discovery and Material Science:- Quantum Grover's algorithm, can perform database searches
computers can simulate molecular interactions and
faster than classical algorithms, potentially impacting VII. CONCEPTS COMPUTERS:-

data retrieval and searching. of Quantum In contrast to classical computers, the

fundamental unit of information in a quantum computer
Secure Communication:- Quantum key distribution is quaternary rather than binary. It is known as a "qubit"
(QKD) ensures secure communication by leveraging the (short for quantum bit) and is analogous to the term "bit"
principles of quantum mechanics to detect in classical computers. The qubit's properties stem from
eavesdropping attempts. its adherence to quantum mechanics laws. We can put a
qubit not only in the logical state 0 or 1. but also in both
VI. QUANTUM PARALLELISM IN
COMPUTING:- 0 and 1, with a numerical coefficient representing the
probability of each state. Because quantum mechanics
Parallelism in A task is divided into simple operations
only works at the atomic level and classical mechanics
that are performed one at a time in a serial fashion when
governs real life situations, the concept appears
using a traditional computer. There have been failed
suspicious. The qubit can be visualised physically as the
attempts to run two computers at the same time in order
spin of a one- electron system (s=1/2); the two states
to address different aspects of a problem at the same
+1/2 and - 1/2 are the eigenstates of an external
time. The main reason for this is that the logic in
magnetic field with spin 12. As a result, the qubit can
microprocessors is intrinsically serial; even when a
have two values, 0 or 1, which correspond to the two
traditional computer appears to be performing multiple
eigenstates of a single electron's spin. It is also possible
tasks at once, it is actually only quickly cycling through
that it is the superposition of these two states with
each step one at a time. This explains why even the most
complex coefficients. This is the property that
powerful supercomputers have limitations when it
distinguishes qubits from traditional bits used in
comes to solving large, complex problems. The
computers. [5]
microprocessors in these computers are not slow. They
are, rather, inefficient for these tasks. To deal with the
VIII. EXPERIMENTAL REALIZATION OF
problem of simultaneity, a computer should be built QUANTUM COMPUTING:-

with parallelism. Quantum computers are examples of The simplified architectural model of quantum
such computers. According to the principle of linear computers makes them faster, cheaper, and smaller.
superposition, a quantum system in a quantum state is a However, its conceptual complexities. make
superposition of many classical and classical-like states. experimental realisation extremely difficult and, for a
If this superposition can be protected from all other time, unrealistic. Nonetheless, there have been
external interferences, then a quantum computer can numerous attempts in this direction, with some
produce results based on all of its different classical promising outcomes. Perhaps quantum computers will
states. This is known as quantum parallelism. soon replace traditional computers. Quantum
Computers Based on Heteropolymers Teich designed
and built the first heteropolymer-based quantum from nature's quantum reality. The new paradigm of
computer in 1988, which was later improved by Lloyd quanturn computing will accelerate Al development and
in 1993. This heteropolymer-based quantum computer assist us in developing tomorrow's innovations. Leading
employs a linear array of atoms as memory cells. Al firms are making quantum computing developments
Information is stored on a cell by pumping the by developing quantum processors and novel quantum
corresponding atom into an excited state. Laser pulses algorithms.
of appropriately tuned frequencies are used to transmit
X. REFERENCES:-
the instruction to the heteropolymer. The shape and.
duration of the pulse determine the nature of the Bouwmeester, D., A. Ekert, A. Zeilinger
computation performed on selected atoms.[4] (eds.) The Physics of Quantum
Information, Springer, Berlin (2001).
IX.CONCLUSION:- Brown, J., The Quest for the Quantum
Although quantum computation is a well-established Computer, Simon and Schuster
topic of interest, opportunities for future growth are still McMahon, D., Quantum Mechanics
being pursued. The research in quantum algorithms, Demystified, McGraw Hill, New York
logic gate operations, error correction. understanding (2005).
dynamics and decoherence control, atomic-scale ONLINE RESOURCES
technology, and practical applications is ongoing. Quantum Information Course notes by David
Complex number properties (analytic functions, Bacon
http://www.cs.washington.edu/education/courses/
conformal mappings) can be used to discover new
cse599d/06wi/
algorithms. The theoretical tools required to solve
many-body quantum entanglement are not well
developed. Its improved characterization enables better
implementation of quantum logic gates as well as the
correction of correlated errors. The system and the
observer are made up of 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