A STUDY ON THE BASICS OF QUANTUM

COMPUTING
Megavarshini N
Student of M.Sc Software systems
Sri Krishna Arts and Science College
Coimbatore
megavarshini24mss024@skasc.ac.in

Nakulan R
Student of M.Sc Software systems
Sri Krishna Arts and Science College
Coimbatore
nakulanr24mss031@skasc.ac.in

ABSTRACT:
This paper explores the realm of quantum computing,
examining its basic concepts, principles, and applications. We
compare quantum computing with ordinary computing,
highlighting the key differences between the two. Quantum
computing's unique features, such as superposition,
entanglement, and qubits, enable faster and more powerful
computing. We discuss quantum algorithms, including Shor's
and Grover's, and their potential to revolutionize fields like
cryptography and optimization. Despite current challenges,
quantum computing's future prospects are promising, with
potential applications in quantum networks, quantum internet,
and hybrid computing. This paper concludes by emphasizing
the need for further research and collaboration to harness the
full potential of quantum computing.

1
Keywords: Quantum Computing, Ordinary Computing, Qubits,
Quantum Algorithms, Future Prospects.

QUANTUM COMPUTING – A NEW

FRONTIER IN THE TECH WORLD

CLASSICAL COMPUTERS:

Classical computers, commonly referred to as traditional

computers, utilize processors including Intel and Pentium,
which are composed of transistors. These transistors function to
convert code into binary format, represented as 0s and 1s.
According to the principle that "As transistor size
decreases, operation speed increases," the industry has
progressed from 14nm transistors to 10nm and, more recently,
to 5nm designs. However, further miniaturization has faced
significant challenges, such as deflections in binary signal
processing, which hinder reliable operations.
Despite advancements, classical computers encounter
limitations in terms of time complexity and efficiency,
particularly when handling complex computational tasks. To
address these challenges, quantum computing—a
revolutionary paradigm—has been developed, promising to
transform the landscape of computational problem-solving.

Figure:1.0

2
QUANTUM COMPUTING:
Quantum computing is an advanced computational model that
utilizes the principles of quantum mechanics to process
information. Unlike classical computers, which use binary bits
(0s and 1s), quantum computers use quantum bits, or qubits,
which can exist in multiple states simultaneously
(superposition) and exhibit unique interactions (entanglement).
This enables quantum computers to handle certain complex
computations much faster and more efficiently.
Quantum computing uses qubits, which can exist in multiple
states simultaneously (superposition) and interact in
interconnected ways (entanglement). Instead of sequentially
testing possibilities, quantum algorithms process many
outcomes in parallel, leveraging quantum gates to manipulate
qubits and find solutions exponentially faster in
certain problems.

EXAMPLE: (UNLOCKING THE LOCK-CLASSICAL VS QUANTUM

APPROACHES)
Classical Computing: Brute Force(Key-101)
The classical approach systematically tests each
combination of the 3-digit lock (000 to 111) one by one.
Each combination is processed individually, taking 1
second per attempt.
For a total of 8 possible patterns, the worst-case time is 8
seconds if the correct combination is the last one (101).
Key Insight: This method guarantees the correct result
but is inefficient for large search spaces.

3
Pattern Status Time Taken
000 Wrong 1Sec
001 Wrong 1Sec
010 Wrong 1Sec
011 Wrong 1Sec
100 Wrong 1Sec
101 Correct 1Sec

Table:1.0

Quantum Computing: Grover's Algorithm(Key-101)

Grover’s algorithm leverages the principles of quantum
mechanics, such as superposition and amplitude amplification.
Instead of testing each pattern sequentially, it evaluates
all possibilities simultaneously in a superposition state.
The oracle identifies the correct combination (101), and
the diffusion operator amplifies its probability, making it more
likely to appear upon measurement.
The correct pattern is found in just 1 second, regardless of
the size of the search space.
Key Insight: This method is exponentially faster for
larger search spaces, as it reduces the time complexity from
(classical) to (quantum).
Pattern Status Time Taken
000 Wrong -
001 Wrong -
010 Wrong -
011 Wrong -
100 Wrong -
101 Correct 1Sec
Table:1.1

4
Generally,
In classical computing, data is stored and processed using bits,
which exist in one of two definite states: 0 or 1. These states
are represented physically using transistors, which function as
tiny switches that can turn on (1) or off (0).
In contrast, quantum computing utilizes quantum bits
(qubits), which leverage the principles of quantum mechanics.
A key property of qubits is superposition, which allows them
to exist simultaneously in a combination of states (both 0 and
1) until they are measured. This duality enables quantum
computers to store and process vast amounts of information
simultaneously, as qubits can represent multiple states at once.
The behaviour of qubits is governed by their wave function, a
mathematical representation that encapsulates all possible
states of the qubit. When a measurement or interaction occurs,
the wave function "collapses" to a specific state (either 0 or 1).
This unique feature of quantum computing provides
exponential computational power compared to classical
systems for certain tasks.

SUPERPOSITION:
In quantum mechanics, superposition is a fundamental
principle that allows quantum systems, such as quantum bits
(qubits), to exist in multiple states simultaneously. Unlike
classical systems, which are restricted to definite states,
superposition introduces a new realm of computational
possibilities.
Classical Bits:
 A classical bit is the basic unit of information in classical
computing.
 It can exist exclusively in one of two states: 0 or 1 at any
given time.

5
Quantum Bits (Qubits):
 A qubit is the basic unit of information in quantum
computing.
 Unlike classical bits, a qubit can exist in a superposition
of states. This means it can simultaneously represent a
combination of 0 and 1,

Figure:1.1

Implications of Superposition:

states (0 or 1), with probabilities proportional to ∣α∣2|\

 When measured, the qubit collapses into one of the basis

alpha|^2∣α∣2 and ∣β∣2|\beta|^2∣β∣2, respectively.

 Superposition enables quantum computers to process and
explore vast amounts of possibilities simultaneously,
making
them exponentially more powerful for certain tasks
compared to classical computers.

ENTANGLEMENT:
Entanglement is a cornerstone phenomenon in quantum
mechanics, where two or more qubits become intertwined
in such a way that the state of one qubit is intrinsically
connected to the state of another, regardless of the
physical distance separating them. This non-local property

6
implies that measuring the state of one qubit
instantaneously determines the state of its entangled
counterpart, a phenomenon that has been experimentally
validated and described by Bell's Theorem.

Figure:1.2

Entanglement is a critical resource for numerous quantum

technologies, including quantum communication, quantum
cryptography, and quantum computing. In quantum
communication, it enables protocols like quantum
teleportation and entanglement-based quantum key
distribution, which offer unprecedented levels of security.
In quantum computing, entangled states facilitate
parallelism and enable advanced operations that classical
systems cannot perform
Notably, IBM, a leading organization in quantum research
based in the United States, has made significant
advancements in harnessing entanglement for practical
quantum computing systems. Their quantum processors
utilize entangled qubits to perform complex calculations
and demonstrate the potential for solving problems that
are infeasible for classical computers.

QUANTUM INTERFERENCE:

7
 Quantum interference is a fundamental principle of
quantum mechanics that describes the behaviour of
quantum states when they overlap. When quantum states
combine, the probabilities associated with certain
outcomes can either amplify or cancel each other due to
constructive or destructive interference. This unique
property arises from the wave-like nature of quantum
particles, as described by the superposition principle.
In quantum algorithms, quantum interference is a
powerful tool for manipulating probability amplitudes to
enhance the likelihood of desired outcomes. For instance,
algorithms like Grover's Search Algorithm and Shor's
Algorithm exploit interference to achieve significant
speed-ups compared to their classical counterparts. By
carefully designing quantum circuits, researchers can
control interference patterns to direct the computation
toward solutions with higher probabilities.
As a pivotal concept in quantum computing, quantum
interference enables the exploration of multi-dimensional
Hilbert spaces, allowing quantum systems to process and
analyse data in ways that surpass classical methods. IBM's
quantum research initiatives have leveraged interference
to optimize quantum operations, paving the way for real-
world applications in areas such as optimization, machine
learning, and material science.

OVERVIEW OF QUANTUM ALGORITHMS:

Quantum algorithms harness the unique principles of quantum
mechanics, such as superposition and entanglement, to
solve problems that are intractable for classical computers.
Unlike classical bits, which represent data as either 0 or 1,
qubits can exist in multiple states simultaneously due to
superposition. This enables quantum computers to evaluate
numerous possibilities at once, offering exponential speedups
for specific types of problems.

8
The power of quantum algorithms lies in their ability to exploit
the parallelism inherent in quantum systems. Entanglement,
another quantum phenomenon, enables qubits to correlate
their states in a way that classical systems cannot replicate.
These properties enable quantum computers to process
information in fundamentally new ways, unlocking
transformative computational capabilities.

SHOR’S ALGORITHM:
Theoretical Background:
Shor's algorithm addresses the problem of integer
factorization, which involves finding the prime factors of a
given integer. This problem is considered computationally hard
on classical computers, forming the foundation of many
cryptographic protocols like RSA. RSA relies on the assumption
that factoring large numbers is infeasible within a reasonable
timeframe using classical computation. Shor’s algorithm
disrupts this assumption by providing an efficient quantum
solution.
Quantum Advantage:
Shor's algorithm uses quantum principles such as
superposition and entanglement to perform parallel
computations. The core innovation lies in using quantum
Fourier transforms to find the periodicity in modular
arithmetic, which enables efficient factorization. This reduces
the time complexity from exponential
Impact on Cryptography:
By making RSA encryption breakable in polynomial time,
Shor's algorithm demonstrates the need for post-quantum
cryptographic protocols that remain secure against quantum
attacks.

9
 Figure:1.3

GROVER’S ALGORITHM:
Theoretical Background:
Grover's algorithm provides a quantum solution for
unstructured search problems, where no inherent order
exists in the dataset. For example, given N items, the task is to
find the one item satisfying a specific condition. Classical
algorithms require O(N) queries, but Grover's algorithm reduces
this to O(N), offering a quadratic speedup.
Quantum Advantage:
Grover's algorithm leverages the principles of quantum
superposition and amplitude amplification. It starts by
placing all items in a superposition and then iteratively
amplifies the probability of the correct solution using a
combination of quantum operators (oracle and diffusion
operators).
Applications:
Though Grover’s algorithm doesn't achieve exponential
speedup, its quadratic speedup is significant for problems like
searching unsorted databases, optimization, and cryptographic
key cracking (e.g., brute-forcing symmetric encryption).

10
 Figure:1.4

REVOLUTIONIZING SCIENCE AND TECHNOLOGY: QUANTUM

COMPUTING APPLICATIONS IN MACHINE LEARNING, DRUG
DISCOVERY, AND PERSONALIZED MEDICINE :
 Quantum algorithms can speed up ML tasks like training
models, clustering, and pattern recognition.
 Used for natural language processing and
 recommendation systems.
 By simulating molecular interactions at the quantum level,
quantum computing accelerates drug discovery and
reduces the need for physical experiments.
 Quantum computers can analyse vast datasets for better
and faster climate predictions and natural disaster
modelling
 Quantum computers simulate complex molecular and
chemical interactions to identify potential drug candidates
more efficiently.
 Quantum algorithms analyse genetic data to tailor
treatments based on an individual’s genome, improving
precision in therapies.

REFERENCE:
1. Nielsen, M. A., & Chuang, I. L. (2010). Quantum
Computation and Quantum Information. Cambridge
University Press

11
2. Feynman, R. P. (1982). Simulating physics with
computers. International Journal of Theoretical Physics,
21(6), 467-488.
3. Dirac, P. A. M. (1981). The Principles of Quantum
Mechanics. Oxford University Press.
4. Ars Technica. (2019). Quantum Computing: How It
Works and Why It’s Different [Video]. YouTube.
https://youtu.be/IHDMJqJHCQg
5. Aspect, A., Dalibard, J., & Roger, G. (1982).
Experimental test of Bell's inequalities using time‐
varying analyzers. Physical Review Letters, 49(25),
1804
6. IBM Research. (2020). Explaining Quantum Computing
with a Deck of Cards [Video]. YouTube.
https://youtu.be/HhUxR8fkFi4
7. Shor, P. W. (1997). Polynomial-time algorithms for prime
factorization and discrete logarithms on a quantum
computer. SIAM Journal on Computing, 26(5), 1484-
1509.
8. Quantum Tech QC. (2021). Quantum Computing Basics:
A Beginner's Guide [Video]. YouTube.
https://youtu.be/5_56TXtFVK4
9. Grover, L. K. (1996). A fast quantum mechanical
algorithm for database search. In Proceedings of the
twenty-eighth annual ACM symposium on Theory of
computing (pp. 212-219).
10. Quanta Magazine. (2018). What Is Quantum
Computing? [Video]. YouTube.
https://youtu.be/EoH3JeqA55A
11. Mr. Veezhinathan Kamakoti Ph.D.Director of the
Indian Institute of Technology Madras
https://www.iitm.ac.in/happenings/press-releases-and-
coverages/iit-madras-hosts-international-conference-
quantum

12