Quantum Computing: A Comprehensive Seminar
Report
Your Name
June 17, 2025
Abstract
This seminar report provides an extensive overview of quantum computing,
including its history, purpose, literature survey, specifications, applications, ad-
vantages and disadvantages, examples, future scope, and conclusion. Quantum
computing represents a significant leap in computational capabilities, promising to
solve complex problems that are currently intractable for classical computers. This
report aims to explore the theoretical foundations, practical implementations, and
implications of quantum computing in various fields.
1
Contents
1 Introduction 4
1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.2 Objectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
2 History of Quantum Computing 6
2.1 Key Milestones . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
2.2 Evolution of Quantum Technologies . . . . . . . . . . . . . . . . . . . . . 6
3 Purpose of Project 8
3.1 Research Questions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
4 Literature Survey 9
4.1 Quantum Algorithms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
4.2 Quantum Error Correction . . . . . . . . . . . . . . . . . . . . . . . . . . 9
4.3 Recent Advances . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
5 Specification (Hardware/Software) 11
5.1 Hardware . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
5.1.1 Superconducting Qubits . . . . . . . . . . . . . . . . . . . . . . . 11
5.1.2 Trapped Ions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
5.1.3 Topological Qubits . . . . . . . . . . . . . . . . . . . . . . . . . . 11
5.2 Software . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
5.2.1 Qiskit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.2.2 Cirq . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
5.2.3 Quipper . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
6 Applications 13
6.1 Cryptography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
6.2 Drug Discovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
6.3 Optimization Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
6.4 Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
6.5 Financial Modeling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13
2
7 Advantages and Disadvantages 14
7.1 Advantages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
7.2 Disadvantages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
8 Example 16
8.1 Example Calculation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
9 Future Scope 17
9.1 Emerging Trends . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
9.2 Potential Impact on Society . . . . . . . . . . . . . . . . . . . . . . . . . 17
10 Conclusion 18
10.1 Final Thoughts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 18
11 References 19
3
1 Introduction
Quantum computing is a revolutionary technology that leverages the principles of quan-
tum mechanics to process information in fundamentally different ways than classical com-
puters. Unlike classical bits, which can be either 0 or 1, quantum bits (qubits) can exist
in superpositions of states, allowing quantum computers to perform complex calculations
at unprecedented speeds. This unique property of qubits enables quantum computers to
explore multiple solutions simultaneously, making them particularly powerful for certain
types of problems.
The fundamental principles of quantum mechanics, such as superposition, entangle-
ment, and quantum interference, form the basis of quantum computing. Superposition
allows qubits to be in multiple states at once, while entanglement enables qubits to be
correlated in ways that classical bits cannot. These principles lead to the potential for
exponential speedup in computation, particularly for problems in cryptography, opti-
mization, and simulation of quantum systems.
1.1 Motivation
The motivation behind quantum computing stems from the limitations of classical com-
puting. As the complexity of problems increases, classical computers face challenges in
processing time and resource allocation. Quantum computing offers a new paradigm that
could potentially overcome these limitations, leading to breakthroughs in various fields
such as cryptography, materials science, and artificial intelligence.
1.2 Objectives
The objectives of this report are to:
• Provide a comprehensive overview of quantum computing principles and technolo-
gies.
• Explore the historical development of quantum computing and its key milestones.
• Analyze the current state of quantum computing hardware and software.
• Discuss the applications, advantages, and disadvantages of quantum computing.
4
• Investigate the future scope and potential impact of quantum computing on society.
5
2 History of Quantum Computing
The concept of quantum computing emerged in the early 1980s. In 1981, physicist Richard
Feynman proposed the idea of a quantum computer to simulate quantum systems, arguing
that classical computers would struggle to efficiently simulate quantum phenomena. In
1985, David Deutsch formulated the first theoretical model of a quantum computer,
introducing the concept of a universal quantum computer capable of performing any
computation that can be described algorithmically.
2.1 Key Milestones
• 1981: Richard Feynman’s Proposal - Feynman suggested that quantum sys-
tems could not be efficiently simulated by classical computers, leading to the idea
of quantum computing.
• 1985: David Deutsch’s Model - Deutsch introduced the concept of a universal
quantum computer, laying the theoretical groundwork for quantum algorithms.
• 1994: Shor’s Algorithm - Peter Shor developed an algorithm that could fac-
tor large integers efficiently, demonstrating the potential of quantum computers to
outperform classical ones in specific tasks.
• 1996: Grover’s Algorithm - Lov Grover introduced an algorithm that provided a
quadratic speedup for unstructured search problems, further showcasing the power
of quantum computing.
• 2001: Experimental Demonstration - IBM and Stanford University executed
a simple quantum algorithm on a liquid-state NMR quantum computer, marking a
significant milestone in practical quantum computing.
• 2019: Quantum Supremacy - Google claimed to achieve quantum supremacy
by performing a specific computation faster than the best classical supercomputers.
2.2 Evolution of Quantum Technologies
The evolution of quantum technologies has been marked by significant advancements
in both hardware and software. Early quantum computers were primarily based on
6
liquid-state NMR systems, which had limitations in scalability and coherence times. The
development of superconducting qubits, trapped ions, and topological qubits has led to
more robust and scalable quantum systems.
7
3 Purpose of Project
The purpose of this project is to explore the principles of quantum computing, its current
state, and its potential future impact on various fields. By understanding the underlying
concepts and technologies, we aim to highlight the significance of quantum computing in
solving problems that are intractable for classical computers. This report will also exam-
ine the challenges faced by the field and the ongoing research efforts aimed at overcoming
these obstacles.
3.1 Research Questions
To guide the exploration of quantum computing, the following research questions will be
addressed:
• What are the fundamental principles of quantum mechanics that enable quantum
computing?
• How do quantum algorithms differ from classical algorithms, and what advantages
do they offer?
• What are the current challenges in building practical quantum computers, and how
are researchers addressing them?
• In what ways can quantum computing impact various industries and scientific re-
search?
8
4 Literature Survey
A comprehensive literature survey reveals significant advancements in quantum comput-
ing. Notable works include:
4.1 Quantum Algorithms
• Shor’s Algorithm (1994): Demonstrated the potential of quantum computers to
factor large integers efficiently, posing a threat to classical encryption methods such
as RSA.
• Grover’s Algorithm (1996): Provided a quadratic speedup for unstructured
search problems, allowing for faster database searches compared to classical al-
gorithms.
• Quantum Fourier Transform (QFT): A key component in many quantum al-
gorithms, QFT allows for efficient computation of the discrete Fourier transform,
which is crucial in various applications, including signal processing and quantum
simulations.
4.2 Quantum Error Correction
Quantum error correction is a critical area of research aimed at protecting quantum
information from decoherence and operational errors. Notable contributions include:
• Shor’s Code (1995): Introduced a method for correcting errors in quantum bits,
demonstrating that quantum information can be preserved despite the presence of
noise.
• Surface Codes: A family of error-correcting codes that are particularly well-suited
for implementation in two-dimensional quantum systems, providing a pathway to
fault-tolerant quantum computing.
4.3 Recent Advances
Recent publications have focused on quantum hardware developments, such as super-
conducting qubits, trapped ions, and topological qubits, as well as software frameworks
9
like Qiskit and Cirq. For instance, the development of superconducting qubits has led
to significant advancements in the scalability and performance of quantum processors.
Companies like IBM and Google have made substantial progress in building quantum
processors with increasing numbers of qubits, paving the way for practical quantum ap-
plications.
10
5 Specification (Hardware/Software)
5.1 Hardware
Quantum computers require specialized hardware to manipulate qubits. Common tech-
nologies include:
5.1.1 Superconducting Qubits
Superconducting qubits utilize superconducting circuits to create and manipulate qubits.
These qubits are cooled to near absolute zero to minimize thermal noise, allowing for
coherent quantum operations. Companies like IBM and Google have developed super-
conducting qubit-based quantum processors, achieving significant milestones in quantum
computation.
5.1.2 Trapped Ions
Trapped ion systems use electromagnetic fields to trap ions, which serve as qubits.
Trapped ions have demonstrated high fidelity and long coherence times, making them
suitable for quantum computation. IonQ and Honeywell are leading companies in this
area, developing scalable trapped ion quantum computers.
5.1.3 Topological Qubits
Topological qubits aim to use anyons in two-dimensional materials to create more stable
qubits. This approach seeks to leverage the topological properties of quantum states
to protect against decoherence. Microsoft is actively researching topological qubits as a
potential path to fault-tolerant quantum computing.
5.2 Software
Quantum programming languages and frameworks have been developed to facilitate quan-
tum algorithm implementation. Notable examples include:
11
5.2.1 Qiskit
Qiskit is an open-source quantum computing framework by IBM that allows users to
create and run quantum circuits on real quantum hardware and simulators. Qiskit pro-
vides a comprehensive set of tools for quantum programming, including circuit design,
simulation, and execution.
5.2.2 Cirq
Cirq is a Python library for quantum circuits developed by Google, designed for building
and running quantum algorithms on noisy intermediate-scale quantum (NISQ) comput-
ers. Cirq emphasizes flexibility and ease of use, making it accessible for researchers and
developers.
5.2.3 Quipper
Quipper is a functional programming language for quantum computing that allows for
high-level quantum algorithm design. Quipper provides abstractions for quantum opera-
tions, enabling users to express complex quantum algorithms succinctly.
12
6 Applications
Quantum computing has potential applications across various fields, including:
6.1 Cryptography
Quantum computers can break classical encryption methods, leading to the development
of quantum-safe cryptography. For example, Shor’s algorithm can efficiently factor large
integers, undermining the security of RSA encryption. As a result, researchers are ex-
ploring post-quantum cryptographic algorithms that can withstand quantum attacks.
6.2 Drug Discovery
Quantum simulations can model molecular interactions, accelerating drug discovery pro-
cesses. Quantum computers can simulate complex quantum systems, allowing researchers
to explore new drug candidates and optimize molecular structures more efficiently than
classical methods.
6.3 Optimization Problems
Quantum algorithms can solve complex optimization problems in logistics, finance, and
machine learning. For instance, quantum annealers, such as those developed by D-Wave,
are designed to tackle optimization problems by finding the lowest energy state of a
system, which corresponds to the optimal solution.
6.4 Machine Learning
Quantum machine learning algorithms can potentially provide speedups for training and
inference tasks. Quantum versions of classical algorithms, such as support vector ma-
chines and clustering algorithms, are being researched to leverage quantum speedups.
6.5 Financial Modeling
Quantum computing can enhance financial modeling by enabling faster simulations of
market behaviors and risk assessments. Quantum algorithms can optimize trading strate-
gies and portfolio management, providing a competitive edge in the financial sector.
13
7 Advantages and Disadvantages
7.1 Advantages
• Speed: Quantum computers can solve certain problems exponentially faster than
classical computers. For example, Shor’s algorithm can factor large integers in poly-
nomial time, while the best-known classical algorithms require exponential time.
• Parallelism: The ability to process multiple states simultaneously allows for more
efficient computations. Quantum superposition enables quantum computers to ex-
plore many possible solutions at once, leading to faster problem-solving.
• Complex Problem Solving: Quantum computing can tackle problems that are
currently intractable for classical systems. Problems in cryptography, optimiza-
tion, and simulation of quantum systems can benefit significantly from quantum
algorithms.
• Energy Efficiency: Quantum computers have the potential to perform computa-
tions with lower energy consumption compared to classical supercomputers, espe-
cially for specific tasks.
7.2 Disadvantages
• Decoherence: Quantum states are fragile and can be easily disturbed by their
environment. Decoherence leads to the loss of quantum information, making it
challenging to maintain qubit coherence over extended periods.
• Error Rates: Current quantum computers have high error rates, necessitating
error correction techniques. Quantum error correction is a complex field that aims
to protect quantum information from errors due to decoherence and gate imperfec-
tions.
• Cost and Accessibility: Building and maintaining quantum computers is expen-
sive and requires specialized knowledge. The high cost of quantum hardware and
the need for cryogenic environments limit accessibility for many researchers and
organizations.
14
• Limited Algorithms: While quantum computing has shown promise for specific
problems, the range of problems that can be efficiently solved using quantum algo-
rithms is still being explored.
15
8 Example
An example of quantum computing in action is Shor’s algorithm, which can factor large
integers efficiently. For instance, factoring the number 15 can be done classically by
testing divisors (1, 2, 3, 5), which takes linear time. However, Shor’s algorithm can
achieve this in polynomial time, showcasing the power of quantum computation. The
algorithm works by finding the period of a function related to the number being factored,
allowing it to derive the factors efficiently.
8.1 Example Calculation
To illustrate Shor’s algorithm, consider the number 15. The steps involved in Shor’s
algorithm include: 1. Choose a random integer $ a $ such that $ 1 ¡ a ¡ 15 $. 2. Compute
the greatest common divisor (GCD) of $ a $ and 15. If GCD is not 1, we have found a
factor. 3. If GCD is 1, use quantum techniques to find the period $ r $ of the function
$ f(x) = ax mod 15$.4.If $r$iseven, compute$ar/2 mod 15$andcheckif ityieldsanon −
trivialf actor.
This example highlights the efficiency of quantum algorithms in solving problems that
would be computationally intensive for classical systems.
16
9 Future Scope
The future of quantum computing is promising, with ongoing research aimed at improving
qubit stability, error correction, and scalability. As quantum hardware becomes more
accessible, we can expect breakthroughs in various fields, including artificial intelligence,
materials science, and complex system simulations. The development of fault-tolerant
quantum computers will be crucial for realizing the full potential of quantum computing.
9.1 Emerging Trends
• Hybrid Quantum-Classical Algorithms: Researchers are exploring hybrid ap-
proaches that combine classical and quantum computing to leverage the strengths
of both paradigms. This approach can enhance the performance of machine learning
algorithms and optimization problems.
• Quantum Networking: The development of quantum networks aims to enable
secure communication and distributed quantum computing. Quantum key distri-
bution (QKD) is a promising application of quantum networking, providing secure
communication channels.
• Quantum Computing as a Service (QCaaS): Cloud-based quantum comput-
ing platforms are emerging, allowing users to access quantum hardware remotely.
This trend democratizes access to quantum computing resources and fosters collab-
oration among researchers.
9.2 Potential Impact on Society
As quantum computing technology matures, its impact on society could be profound.
Industries such as healthcare, finance, and logistics may experience significant transfor-
mations due to the enhanced computational capabilities offered by quantum computers.
The ability to solve complex problems efficiently could lead to advancements in drug
discovery, optimization of supply chains, and improved financial modeling.
17
10 Conclusion
Quantum computing represents a paradigm shift in computational capabilities. While
still in its infancy, the potential applications and advantages of quantum computing are
vast. Continued research and development will be crucial in overcoming current challenges
and unlocking the full potential of this technology. As we move forward, the collaboration
between academia, industry, and government will play a vital role in shaping the future
of quantum computing and its impact on society.
10.1 Final Thoughts
The journey of quantum computing is just beginning, and the next few decades will likely
witness significant advancements in both theory and practice. As researchers continue
to explore the frontiers of quantum mechanics and computation, we can anticipate a
future where quantum computers play a central role in solving some of the most pressing
challenges facing humanity.
18
11 References
References
[1] R. Feynman, “Simulating Physics with Computers,” International Journal of Theo-
retical Physics, vol. 21, no. 6, pp. 467-488, 1982.
[2] P. Shor, “Algorithms for Quantum Computation: Discrete Logarithms and Factor-
ing,” in Proceedings of the 35th Annual ACM Symposium on Theory of Computing,
1994, pp. 124-134.
[3] L. Grover, “A Fast Quantum Mechanical Algorithm for Database Search,” in Pro-
ceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp.
212-219.
[4] M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information.
Cambridge University Press, 2000.
[5] J. Preskill, “Quantum Computing in the NISQ era and beyond,” Quantum, vol. 2,
p. 79, 2018.
[6] F. Arute et al., “Quantum Supremacy Using a Programmable Superconducting Pro-
cessor,” Nature, vol. 574, pp. 505-510, 2019.
[7] M. H. Devoret and R. J. Schoelkopf, “Superconducting Qubits: A Short Review,”
Science, vol. 339, no. 6124, pp. 1169-1174, 2013.
[8] IonQ, “The Future of Quantum Computing: A New Era of Quantum Computing,”
2020. [Online]. Available: https://ionq.com/
[9] D-Wave Systems Inc., “D-Wave Quantum Computing: The Future of Optimization,”
2020. [Online]. Available: https://www.dwavesys.com/
19
