Shri G.S.

Institute of Technology and Science

Topic:-Quantum Computation and

Algorithms

Prepared By :-
Samith Maheshwari (24D038)
Samriddhi Purohit (24D039)
Sandeep Raghuwanshi (24D040)

Ayush Kothe (24D042)

Krishna Gupta (24D043)

Prepared For :-
Dr. Yatish Dhakad Sir
 @Copyright Notice

Quantum computation and algorithm, 2025

This report is the intellectual property of its creator(s). All rights are
reserved. Redistribution, reproduction, or use of this report, in whole or in
part, is permitted only with proper acknowledgment and in compliance
with applicable copyright laws.
For academic, research, or non-commercial purposes, the content may be
used with appropriate citation to the author(s). Unauthorized commercial
use, modification, or distribution of this report is prohibited without prior
written consent.
Please contact the author(s) for any permissions or inquiries related to this
report.

Publisher’s Address
SGSITS INDORE – 452003

i
 Letter of Transmittal
To,
The Director

Shri GS Institute of Technology and Science 23

Sir M. Visvesvaraya Marg, Indore (M.P)

April 16th, 2025

Subject: This is a form of letter of transmittal on the topic of “Quantum Computation and

Algorithm”.
Respected Sir,

This technical report is made with the guidance of our mentor of technical English teaching
Dr. Yatish Dhakad Sir to showcase an aggregate on the topic of “Quantum Computation and
Algorithm”. This report provides an in-depth overview of the current advancements in
quantum computing, explores its potential applications, and outlines future trends that
could impact various industries. The purpose of this report is to provide an insightful and
forward-looking perspective on the state of quantum computing,highlighting both the
technical hurdles and the opportunities it presents. We believe this document will be useful
in supporting your strategic decisions in this emerging field.

Thanking You
Yours faithfully
Sandeep Raghuwanshi

Samith Maheshwari
Samriddhi Purohit
Krishna Gupta
Ayush Kothe

ii
 Preface

• Quantum computing is an exciting new field that promises to solve

complex problems faster and more efficiently than today’s classical
computers. This report has been created to explain the core ideas,
principles, and applications of quantum computing in a way that is
simple and clear, even for those new to the topic. By the end of this
report, readers will understand how quantum computers work, why
they are powerful, and the ways they might reshape the future.

 This report explores the foundational theories of quantum computing,

the various approaches being pursued to build practical quantum
computers, and the implications these advancements could have on
industries ranging from cybersecurity to pharmaceuticals. Additionally,
it highlights the technical challenges, such as error correction and
qubit coherence, that must be overcome to make quantum
computers commercially viable.

iii
 Acknowledgement

 We, the authors of this report on quantum computing, would like to

express our sincere gratitude to all those who have supported us
throughout the process of research and writing.

 Firstly, we extend our heartfelt thanks to our supervisor Dr. Yatish

Dhakad Sir, for their expert guidance, valuable feedback, and
encouragement, which have been pivotal to the successful completion
of this report.

 We also wish to acknowledge the contributions of our colleagues for

their assistance in gathering data, reviewing content, and offering
insightful suggestions that greatly improved the quality of our work.
We are deeply grateful to all those who have contributed in any way
to this report. Your help has been invaluable.

iv
 Table of Content

Sr. No. Content Page No.

1. @Copyright i

2. Letter of Transmittal ii

3. Preface iii

4. Acknowledgement iv

5. List of Illustrations v

6. Abstract vi

7. Introduction vii

8. Conclusion xv

9. Appendix xvi

10. List of References xvii

11. Bibliography xviii

12. Index xix

13. Glossary xx

v
 List of Illustrations

1. Basic triangle model of quantum computing principles.

2. Added table showing the comparison between classical
and quantum computing.
3. Table explaining advantages and challenges of physical
implementations.

v
 Abstract

 Quantum computers are machines that use the rules of quantum

physics to solve problems faster than ordinary computers.
Traditional computers rely on bits that are either 0 or 1. Quantum
computers use qubits, which can be both 0 and 1 at the same time,
allowing them to explore many possibilities in one go. This report
covers how qubits work, where quantum computers can be used,
and what challenges still need to be solved before these computers
become part of our daily lives.

 The report also discusses the latest advancements in quantum

computing, including improvements in hardware, algorithms, and
error correction methods. It highlights how quantum computing could
be used in areas like cryptography, artificial intelligence, and drug
development. Additionally, it covers the challenges of making
quantum computers practical and widely available, such as dealing
with errors and maintaining qubit stability.

 Finally, the report looks ahead to the future of quantum computing,

discussing ongoing research and what breakthroughs may be needed
for it to become fully usable in everyday applications.

vi
 Introduction

Quantum computing is an emerging field that leverages the principles of

quantum mechanics to process information in fundamentally new ways.
Quantum computing is a new way of thinking about computation. Instead
of using bits, which are like tiny switches set to 0 or 1, quantum computers
use qubits, which can be in a superposition of both values. This ability
allows quantum computers to try multiple solutions at once, making them
much faster for certain problems.

Classical Computers Quantum Computers

Use Qubits: 0, 1, or both at
Use Bits: 0 or 1
once (superposition)
Perform one calculation at a Can perform many calculations
time at once
Excellent for highly complex
Good for regular tasks
problems like simulations

vii
Key Milestones in Quantum Computing:
•1980s: Richard Feynman suggested the idea of quantum computing for
simulating physical systems.

•1994: Peter Shor introduced an algorithm to break modern encryption by

factoring large numbers efficiently.

•2019: Google announced it had achieved quantum supremacy, solving a

problem faster than any classical computer.

Fundamental Principles of Quantum Computing:

1.Qubits:- A qubit is like a magic coin that can be both heads and
tails at the same time. This special property gives quantum
computers their power.
2.Superposition:- A qubit can hold both 0 and 1 at the same
time. When multiple qubits are combined, this creates the ability
to explore many possibilities in parallel.
3.Entanglement:- Entanglement connects two qubits so that
whatever happens to one instantly affects the other, no matter
how far apart they are. This enables faster and more secure
information transfer.
4.Quantum Gates:- Quantum gates are the basic operations that
change qubits and guide the computer toward a solution.

Gate Purpose
Flips a qubit from 0 to 1 or 1 to
X (NOT)
0
H (Hadamard) Creates superposition
Links two qubits
CNOT
(entanglement)

viii
 ix

Quantum Algorithms:
Quantum algorithms are computational procedures designed to run on
quantum computers, which leverage the principles of quantum
mechanics—such as superposition, entanglement, and interference—to
process information in fundamentally different ways than classical
algorithms.
Some famous quantum algorithms are listed below:
1. Shor's Algorithm –
Shor's Algorithm Used to break encryption by factoring large
numbers quickly — something classical computers take years
to do.

2. Grover's Algorithm –
Speeds up unstructured searches, finding a specific item in an
unsorted database exponentially faster than classical algorithms.
It's used for database searches, optimization problems, and
artificial intelligence.

3. Quantum Simulation –
Quantum Simulation Allows scientists to model real-world
molecules and chemical reactions accurately, helping in
medicine and material design.
.
 x

Physical Implementation:
Quantum computing relies on the physical implementation of quantum bits
(qubits), which are the fundamental units of information in quantum
systems. These implementations use physical systems that exhibit quantum
mechanical properties.

Technology Advantages Challenges

Superconducting Fast and well- Sensitive to noise,
Qubits researched short lifetime
High accuracy and Hard to scale up for
Trapped Ions
easy to control larger systems
Work at room Complex setup for
Photonic Qubits
temperature precise control
Highly sensitive to
Quantum Dots Tiny and compact external
interference
Naturally protected Still under research
Topological Qubits
from errors and testing

Challenges in Physical Implementations:

1. Decoherence: Qubits are easily disturbed by the environment,
losing their quantum state.
 xi
2. Error Correction: Fixing mistakes in quantum systems is more complex
than in classical computers.

3. Scalability: Building large, reliable quantum computers is difficult with

current technology.

Advantages of Quantum Computing:

Quantum computing offers transformative applications across various
domains by solving problems that are intractable or inefficient to solve with
classical computing. Below are the key areas and specific applications of
quantum computing:

1. Drug Discovery and Material Science

1. Molecular Simulation: Quantum computers simulate

molecular structures and chemical reactions accurately, which
is crucial for drug discovery and material design.

2. Protein Folding: Quantum computing could model protein

folding pathways, accelerating the development of
treatments for diseases.

1. Gaming and Entertainment

1. Game Development: Quantum algorithms can improve
physics simulations and AI for realistic gaming experiences.

2. Content Recommendation: Enhance recommendation

systems for streaming platforms.
 Field Benefits
Break existing encryption and
Cryptography
create ultra-secure systems
Speed up the process of
Drug Discovery
finding new medicines
Make machine learning models
Artificial Intelligence
smarter and faster
Solve large-scale problems like
Logistics & Optimization
xii route planning or scheduling

Current Developments:

1. Quantum Supremacy
Google's 2019 experiment demonstrated a task performed
exponentially faster than on
classical supercomputers.

2. Quantum Advantage
IBM, IonQ, and others aim
for practical quantum
advantage, where quantum
computers outperform
classical ones on real-world
problems.

3. Hybrid Quantum-
Classical Systems
Combining quantum and
classical computing resources offers a near-term pathway to
leveraging quantum capabilities.
 xiii

Future Directions:
The future of quantum computing holds immense potential, with
advancements expected across hardware, algorithms, and applications. As
quantum computers evolve, they could transform industries, science, and
everyday technology in ways we are just beginning to understand.

•Better hardware with more stable and longer-lasting qubits.

•Smarter algorithms designed for machine learning, chemistry, and

optimization.

•Quantum-secure communication using quantum key distribution (QKD).

•The development of the quantum internet for instant, safe, and

encrypted data transfer.

•Hybrid computing systems that mix classical and quantum power for real-
world applications.
 xiv

Conclusion

Quantum computing has the potential to transform industries by solving

problems that classical computers cannot handle. As technology advances,
we can expect better quantum hardware, more powerful algorithms, and
practical applications in areas like healthcare, finance, and logistics. With
improvements in error correction and the ability to scale up quantum
systems, we’ll see more reliable and efficient quantum computers.
Quantum technologies will also provide new ways to secure data, such as
quantum key distribution. As quantum and classical systems work together,
the impact on science, business, and technology will continue to grow,
unlocking new opportunities for innovation.
 xv

Appendix
Appendix A. Quantum Gate Examples

X (NOT) Flips a qubit (0↔1).

Z Adds a phase

H (Hadamard) Creates superposition of states.

CNOT Flips a target qubit

Appendix B. Key Quantum Concepts

1. Qubit: A unit of quantum information.
2. Superposition: A qubit can be both (0)and (1) at the same
time.
3. Entanglement: Linked qubits share information instantly.
Appendix C. Famous Algorithms
 Shor’s Algorithm: Quickly factors large numbers, breaking RSA
encryption.
 Grover’s Algorithm: Speeds up unstructured searches.
Appendix D. Quantum Computers Examples

Platform Provider Technology

IBM Quantum IBM Superconducting qubits

Sycamore Google Superconducting qubits

IonQ Quantum Cloud IonQ Trapped ions

xvi
 List of References

1. Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and

Quantum Information.

2. Preskill, J. (2018). "Quantum Computing in the NISQ Era and Beyond."

3. Google AI Quantum Team (2019). "Quantum Supremacy Using a

Programmable Superconducting Processor."

4. Shor, P. W. (1994). "Algorithms for Quantum Computation: Discrete

Logarithms and Factoring."

5. Grover, L. K. (1996). "A Fast Quantum Mechanical Algorithm for

Database Search."

xvii
 Bibliography

1. Nielsen, M. A., & Chuang, I. L. (2010). Quantum Computation and

Quantum Information. Cambridge University Press.

2. Shor, P. W. (1994). Algorithms for Quantum Computation: Discrete

Logarithms and Factoring. Proceedings of the 35th Annual Symposium
on Foundations of Computer Science (FOCS).

3. Preskill, J. (2018). Quantum Computing in the NISQ Era and Beyond.

Quantum, 2, 79.

4. Google AI Quantum Team (2019). Quantum Supremacy Using a

Programmable Superconducting Processor. Nature, 574(7779), 505–
510.

5. https://quantum-computing.ibm.com.

6. https://www.rigetti.com.

7. https://quantum.country.

xviii
 Glossary
1.Qubit
The basic unit of quantum information. Unlike a normal computer bit
(which can only be 0 or 1), a qubit can be both 0 and 1 at the same time.
This unique ability helps quantum computers solve complex problems
faster.
2.Superposition
A quantum rule where qubits can hold multiple values at once. This means
that a quantum computer can explore many solutions in parallel, rather
than testing one at a time like a classical computer.
3.Entanglement
A mysterious connection between qubits, where the state of one qubit
instantly affects the other, even if they are far apart. This helps quantum
computers share and process data in new ways.
4.Quantum Gate
A basic operation that changes the state of qubits. Quantum gates are like
the instructions that tell the quantum computer what to do. Common gates
include the X gate (flips the state) and H gate (creates superposition).
5.Quantum Circuit
A sequence of quantum gates applied to qubits to solve a problem. Think of
it like a recipe that the quantum computer follows to compute answers.
6.Decoherence
The process where a qubit loses its quantum state due to interference from
the outside world (like temperature, sound, or light). When this happens,
the qubit behaves like a normal bit and loses its power.
7.Error Correction
A method of detecting and fixing errors in quantum systems caused by
decoherence or other disturbances. Reliable error correction is one of the
biggest challenges in building quantum computers.
8.Shor’s Algorithm
A quantum algorithm that can quickly factor large numbers, which would
take classical computers years.

xx
 Index

Sr. No. Topics Page No.

1. Introduction vii

2. Key milestones viii

3. Fundamental Principles viii- ix

4. Quantum Algorithms x

5. Physical Implementation xi

6. Challenges in Physical Implementation xi- xii

7. Advantages xii- xiii

8. Current Developments xiii

9. Future Directions xix

xix