Study on Quantum Computing

Hariom, Bhoopendra, Manvendra Singh, Divyanshi Gupta

Department of MCA, Greater Noida Institute of technology (Under Dr.A.P.J Abdul Kalam Technical University), India

(hariomsharma19813@gmail.com, bvishwkarm461@gmail.com, smanvendra292@gmail.com, guptadivyanshi53@gmail.com)

Abstract- Imagine a computer that can solve problems in seconds that

would take classical machines millennia. This is the promise of
quantum computing, a burgeoning field leveraging the bizarre laws of
quantum mechanics. By harnessing superposition, where qubits can be 0
and 1 simultaneously, and entanglement, where qubits share an
unbreakable bond, quantum computers perform computations with
unparalleled speed and efficiency. This technology has the potential to
revolutionize diverse fields. Imagine designing drugs tailored to your
unique biology, predicting material properties with atomic precision, or
securing the future of digital communication with quantum-resistant
encryption. While challenges remain, such as building stable hardware
and developing efficient algorithms, quantum computing is rapidly
evolving. It holds the key to unlocking a new era of scientific discovery
and technological innovation, forever changing our world. Keywords:
Quantum computing, superposition, entanglement, qubit, revolutionize,
drug discovery, materials science, cryptography, future.

Keywords:- Quantum computing, superposition, entanglement, qubit,

revolutionize, drug discovery, materials science, cryptography, future.
 computers was demonstrated by organising a set of
 Introduction:- mathematical operations specifically created for a
quantum computer. [1,2,3] The development of
New methods for the exploitation of different physical quantum computing has captured the interest of
resources, such as materials, forces, and energies, were researchers worldwide.
found as science and technology advanced. The
advancement of civilizations as a whole-results from
this over time. The development of computers can be 2. Limitations of Classical
seen as the result of years of technological progress,
starting with Charles Babbage's early theories and the Computers:-
eventual building of the first computer, Alan Turing's
groundbreaking work in artificial intelligence and
The "Public Key" systems, a clever mathematical
computing, and the deciphering of the German Enigma
discovery from the 1970s, offered a solution to the key
code. The procedure entails a series of transitions
distribution issue. Users can send messages in these
between various physical realisations, such as
kinds of scenarios without agreeing on a secret key.
integrated circuits, chips, gears, valves, and transistors.
The idea of a two-key safe is utilised, where a public
Even though computers these days are much faster and
key is used to lock it and a private key is used to
smaller than they used to be, They still have to
unlock it. In real life, these two keys correspond to
manipulate and decipher a binary bit that is being
large integer numbers. The private key can be used to
encoded in order to produce a useful computational
easily obtain the public key, but not the other way
output. The properties of conventional logic gates are
around. The reason for this procedure is that certain
determined by classical rules, whereas matter is
mathematical operations are easier to execute in one
subject to the laws of quantum mechanics. Quantum
way than the other. For instance, factorising two
technology must take the place of current technology if
numbers can be completed much more quickly than
computers are to get smaller. This is because quantum
multiplying them by two. If the time required to
technology can provide new computational types that
execute an algorithm remains relatively constant when
are both quantitative and qualitative, as well as new
applied to large numbers, then the algorithm is
algorithms that are based on the fundamentals of
considered fast. For instance, it takes significantly
quantum mechanics. The study of quantum
longer to multiply two thirty-digit numbers using the
computation is necessary because of the physical
trial division method than it does to multiply two
constraints placed on classical computers and the fact
three-digit numbers. Because of this, the trial division
that quantum computers can complete those particular
method isn't always a quick algorithm. Public key
tasks faster than a classical computer. Quantum
cryptosystems are seen to be able to get around the
mechanics ideas are used to enable the development of
basic distribution issue. But the security hinges on
quantum computers.
unverified mathematical presumptions, like how hard
it is to factor big integers.

1. Evolution of Quantum 3. Birth of Art of Quantum

Computing:- Computing:-
concept of quantum mechanically-based computing
In 1982, Richard P. Feynman postulated that a
devices was initially investigated in the 1970s and
quantum physical system consisting of N particles and
early 1980s by computer scientists and physicists
their quantum probabilities could not be simulated by a
Charles H. Bennet, Paul A. Benioff, David Deutsch,
standard computer without experiencing an
and Richard P. Feynman. The idea first surfaced when
exponential decrease in simulation efficiency.
scientists were debating the fundamental boundaries of
Nonetheless, a polynomial slowdown can be used to
computation. It is possible for scientists to conduct
simulate them in classical physics. The primary cause
experiments in quantum physics within a quantum
is that the user can describe the size of a particle
mechanical computer thanks to the system they
system without experiencing an exponential decrease
designed. On a classical computer, solving many-body
in simulation efficiency. Nonetheless, a polynomial
quantum mechanical problems takes exponentially
slowdown can be used to simulate them in classical
more time. On the other hand, the quantum computer
physics. The primary cause is that, in quantum
can complete all calculations in polynomial time. In
computing, the particle system's description size is
1994, Peter Shor devised a technique to use quantum
exponential in N, whereas in classical physics, it is
computing to solve factorization, a notorious problem
linear in N. By doing this, the slowdown that occurs
in number theory. The ability to factor large numbers
when simulating quantum systems may be avoided.
quickly and with computational times orders of
Feynman also discussed how the interference
magnitude smaller than those of conventional
phenomena is the reason behind the difficulty in using
a probabilistic computer to simulate a quantum
physical system. Therefore, all of these elements
contributed to the development of quantum computing,
which made it possible to use quantum computers and
get around all of the drawbacks of classical computers.
4. Application Area of
quantum Computing:-
Quantum computing has the potential to revolutionize
various fields by solving certain problems
exponentially faster than classical computers. Some
key application areas of quantum computing include:
Cryptography:-
Quantum computers could break widely-used
cryptographic systems like RSA and ECC by
efficiently factoring large numbers. Conversely,
quantum key distribution (QKD) promises ultra-secure
communication channels.
Optimization Problems:-
Quantum computers can efficiently handle
optimization problems, 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 pattern
recognition, optimization problems, and complex data
analysis.
Drug Discovery and Material Science:-
Quantum computers can simulate molecular
interactions and 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 optimize supply chain and
logistics operations by solving complex routing and
scheduling problems, leading to more efficient
resource allocation.
Climate Modeling:-
Quantum computers can simulate complex climate
models more accurately, aiding in climate research and
the development of strategies to mitigate the impact of
climate change.
Artificial Intelligence:-
Quantum computing can enhance certain aspects of
artificial intelligence, including speeding up training
processes for machine learning models and solving
complex optimization problems inherent in AI
algorithms.
Simulating Physical Systems:-
Quantum computers can simulate physical systems at
the quantum level, allowing for a deeper understanding
of quantum mechanics and materials science.
Database Search:-
Quantum algorithms, such as Grover's algorithm, can
perform database searches faster than classical
algorithms, potentially impacting data retrieval and
searching.
Secure Communication:-
Quantum key distribution (QKD) ensures secure
communication by leveraging the principles of
quantum mechanics to detect eavesdropping attempts.
5. Quantum Parallelism in
Computing:-
A task is divided into simple operations that are
performed one at a time in a serial fashion when using
a traditional computer. There have been failed attempts
to run two computers at the same time in order to
address different aspects of a problem at the same
time. The main reason for this is that the logic in
microprocessors is intrinsically serial; even when a
traditional computer appears to be performing multiple
tasks at once, it is actually only quickly cycling
through each step one at a time. This explains why
even the most powerful supercomputers have
limitations when it comes to solving large, complex
problems. The microprocessors in these computers are
not slow; They are, rather, inefficient for these tasks.
To deal with the problem of simultaneity, a computer
should be built with parallelism. Quantum computers
are examples of such computers. According to the
principle of linear superposition, a quantum system in
a quantum state is a superposition of many classical
and classical-like states. If this superposition can be
protected from all other external interferences, then a
quantum computer can produce results based on all of
its different classical states. This is known as quantum
parallelism.
6. Concepts of Quantum
Computers:-
In contrast to classical computers, the fundamental
unit of information in a quantum computer is
quaternary rather than binary. It is known as a "qubit"
(short for quantum bit) and is analogous to the term
"bit" in classical computers. The qubit's properties
stem from its adherence to quantum mechanics laws.
We can put a qubit not only in the logical state 0 or 1,
but also in both 0 and 1, with a numerical coefficient
representing the probability of each state.
Because quantum mechanics only works at the atomic
level and classical mechanics governs real- life
situations, the concept appears suspicious. The qubit
can be visualised physically as the spin of a one-
electron system (s=1/2); the two states +1/2 and - 1/2
are the eigenstates of an external magnetic field with
spin 12. As a result, the qubit can have two values, 0 or
1, which correspond to the two eigenstates of a single
electron's spin. It is also possible that it is the
superposition of these two states with complex
coefficients. This is the property that distinguishes
qubits from traditional bits used in computers.[5]
7. Experimental Realization of
Quantum Computing:-
The simplified architectural model of quantum
computers makes them faster, cheaper, and smaller.
However, its conceptual complexities make
experimental realisation extremely difficult and, for a
time, unrealistic. Nonetheless, there have been
numerous attempts in this direction, with some
promising outcomes. Perhaps quantum computers will
soon replace traditional computers. Quantum
Computers Based on Heteropolymers Teich designed
and built the first heteropolymer-based quantum
computer in 1988, which was later improved by Lloyd
in 1993. This heteropolymer-based quantum computer
employs a linear array of atoms as memory cells.
Information is stored on a cell by pumping the
corresponding atom into an excited state. Laser pulses
of appropriately tuned frequencies are used to transmit
the instruction to the heteropolymer. The shape and
duration of the pulse determine the nature of the
computation performed on selected atoms.[4]
8. Conclusion:-
Although quantum computation is a well-established
topic of interest, opportunities for future growth are
still being pursued. The research in quantum
algorithms, logic gate operations, error correction,
understanding dynamics and decoherence control,
atomic-scale technology, and practical applications is
ongoing. Complex number properties (analytic
functions, conformal mappings) can be used to
discover new 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 from nature's quantum
reality. The new paradigm of quantum computing will
accelerate AI development and assist us in developing
tomorrow's innovations. Leading AI firms are making
quantum computing developments by developing
quantum processors and novel quantum algorithms.
REFERENCES:-
1. Nielsen, M. E., Nielsen, M. A. & Chuang, I.
L. Quantum Computation and Quantum
Information. (Cambridge University Press,
2000).
2. Kloeffel, C. & Loss, D. Prospects for Spin-
Based Quantum Computing in Quantum
Dots. Annu. Rev. Condens. Matter Phys. 4,
51–81 (2013).
3. Prashant. A Study on the basics of Quantum
Computing. arXiv:quant-ph/0511061.
4. Mendonca, J. T. Theory of Photon
Acceleration. (CRC Press, 2000).
5. Duncan, T. Physics: A Textbook for
Advanced Level Students. (Coronet Books,
1982)