Quantum Computing Unit 1
Quantum Computing Unit 1
Classical Computer
Classical computing is another name for binary
computing. In this traditional approach to computing,
information is stored in bits that are represented
logically by either a 0 (off) or a 1 (on)
What is a Quantum Computing
00 = Wrong (1 Sec)
01= Wrong (1 Sec)
10= Wrong (1 Sec)
11= Correct (1 Sec)
00 ,01,10,11 (1 Sec)
Super position
• Simulating quantum systems: One of the key benefits of quantum computers is their ability to
simulate quantum systems, such as molecules and materials, with greater accuracy and efficiency
than classical computers. This could have important applications in fields such as chemistry,
material science, and drug discovery.
• Optimizing large-scale systems: Quantum computers can use quantum algorithms to solve
optimization problems, such as the traveling salesman problem, more efficiently than classical
computers. This could have important applications in fields such as logistics, finance, and energy
management.
• Cryptography: Certain encryption algorithms that are currently used to secure communications and
protect sensitive information, such as RSA and Elliptic Curve Cryptography, can be broken by a large
enough quantum computer. On the other hand, quantum computers can also be used to create
new, more secure forms of encryption.
• Machine learning: Quantum computers have the potential to perform machine learning tasks, such
as pattern recognition and data analysis, faster and more efficiently than classical computers.
• Overall, quantum computers are a new and powerful tool that have the potential to impact many
fields and enable breakthroughs in areas where classical computers have reached their limits.
How does quantum computing work?
• Quantum computing uses quantum mechanics to
manipulate qubits. Qubits can be represented by the
spin of an electron or the polarization of a photon.
• Quantum gates are analogous to the logic gates used
in classical computing.
• However, quantum gates can perform multiple
operations simultaneously, allowing quantum
computers to perform most complex problems that
are currently unsolvable with classical computers
and calculations at an unprecedented speed.
Evolution of Quantum Theory & Quantum Technology
Brief History of Quantum Computers
• 1981: Richard Feynman proposed to use quantum computing to model
quantum systems. He also describe theoretical model of quantum
computer
• 1985: David Deutsch described first universal quantum computer
• 1994: Peter Shor developed the first algorithm for quantum computer
(factorization into primes)
• 1995 Schumacher proposed “Quantum bit” or “qubit” as physical
resource
• 1996: Lov Grover developed an algorithm for search in unsorted
database
• 1998: the first quantum computers on two qubits, based on NMR
(Oxford; IBM, MIT, Stanford)
• 2000: quantum computer on 7 qubits, based on NMR (Los-Alamos)
• 2001: 15 = 3 x 5 on 7- qubit quantum computer by IBM
• 2005-2006: experiments with photons; quantum dots; fullerenes and
nanotubes as "particle traps"
Brief History of Quantum Computers
• 2007: D-Wave announced the creation of a quantum computer on 16
qubits
• 2012: D-Wave claimed a quantum computation using 84 qubits
• 2017: D-Wave Systems Inc. announced the D-Wave 2000Q quantum
annealer with 2000 qubits
• 2017: Microsoft revealed Q Sharp with 32 qubits
• 2018: Google announced the creation of a 72-qubit quantum chip
• 2019: Google claimed quantum supremacy with 54 qubits to perform
operations in 200 seconds that would take a supercomputer about 10,000
years to complete
• 2019: IBM revealed 53 qubits
• 2020: Chinese researchers claimed to have achieved quantum supremacy
using a photonic 76-qubit system at 100 trillion times the speed of
classical supercomputers.
• 2020: IBM will build 1121-qubit quantum computer in 2023, and 1
million-qubit quantum computer in 2030.
How Hard Is It to Build a Quantum Computer?
• ket 1
The Power of Qubits
• Mathematically, the number of bits required to
match the computing power of qubits is as follows:
n qubits = 2n bits or an exponential relationship
• If we consider two classical bits, we know that they
can be either 1 or 0, so together they can take on the
following values:00,01,10,11
• However, two entangled qubits can take all of those
values at once, because of the entanglement, so in
this case 2 qubits can take the value of 4 bits.
The Power of Qubits
• If we consider three classical bits, they can be
any of the following combined entries:
0, 0, 0 1, 0, 0
0, 1, 0 1, 1, 0
0, 0, 1 1, 0, 1
0, 1, 1 1, 1, 1
• So, in this case there are 8 combinations, but
this can be fully described using 3 qubits (again
because they are entangled).
The Power of Qubits
• To understand the power of qubits, let's consider a
simple example. Suppose you have a classical computer
with 4 bits. It can represent numbers from 0 to 15 (2^4).
• However, a quantum computer with 4 qubits can
represent all 16 possible states simultaneously. This
parallelism is what makes quantum computing so
enticing for solving complex problems that are
infeasible for classical computers.
• https://quantumtech.blog/2021/11/14/quantum-
superposition-and-entanglement/
Classical Bit vs. Quantum Bit
Quantum
• Quantum – The word “Quantum” refers to
quantum mechanics which explains the
behavior and properties of atomic or
subatomic particles, such as electrons,
neutrinos, and photons.
Quantum mechanics
• Quantum mechanics is a fundamental theory
in physics that describes the behavior of
nature at the scale of atoms and
subatomic particles.
Need for quantum computers
• Quantum Information Processing (QIP) is the
study of how to use quantum computers to
process information. It involves developing
algorithms and protocols that can take
advantage of the unique properties of
quantum mechanics to solve problems faster
and more efficiently than classical computers.
Quantum Algorithms
• Quantum algorithms leverage the principles of
quantum mechanics to perform specific
computations more efficiently than classical
algorithms.
• The Key to Unlocking Quantum Computing's
Potential
• These are algorithms designed to run on a quantum
computer. Quantum algorithms are expected to be
much faster than classical algorithms for certain
problems, such as factoring large numbers.
Quantum Information
• Quantum information refers to the application
of quantum mechanics principles to
information processing.
• Unlike classical bits, which can exist in a state
of 0 or 1, quantum bits or qubits can exist in a
superposition of both 0 and 1 simultaneously.
This unique property, along with entanglement
and other quantum phenomena, enables
quantum information processing.
Principles of quantum computing
Superposition
• Superposition states that quantum state can be
represented as a sum of two or more other quantum states.
• A qubit can be in both 0 and 1 state at the same time.
When multiple qubits act together, they can process
multiple options simultaneously. This allows them to
process information much faster than a classical computer.
Quantum Entanglement
• Entanglement is an observed physical phenomenon where a
pair or group of qubits can be in a quantum state that cannot
be described independently. The measurement of the physical
properties like momentum, position, spin, polarization are
perfectly correlated among entangled qubits; irrespective of
the distance between them.
Decoherence
In classical computers, bits, registers, and logic gates are the building blocks
of the hardware.
In quantum computers it is qubits, quantum registers, and reversible gates.
Quantum computing components
• Quantum computers have hardware and software, similar to a
classical computer.
Quantum hardware
• Quantum hardware has three main components.
1.Quantum data plane
The quantum data plane is the core of the quantum computer
and includes the physical qubits and the structures required to hold
them in place.
2.Control and measurement plane
The control and measurement plane converts digital signals
into analog or wave control signals. These analog signals perform
the operations on the qubits in the quantum data plane.
Quantum computing components
3.Control processor plane and host processor
• The control processor plane implements the quantum
algorithm or sequence of operations. The host processor
interacts with the quantum software and provides a digital
signal or classical bits sequence to the control and
measurement plane.
Quantum software
• Quantum software implements unique quantum algorithms
using quantum circuits. A quantum circuit is a computing
routine that defines a series of logical quantum operations on
the underlying qubits. Developers can use various software
development tools and libraries to code quantum algorithms.
Quantum computing components
Qubits
• Qubits are the basic units of the quantum
memory which, in contrast to classical bits that
can be either 0 or 1, can hold both 0 and 1
state thanks to superposition.
• For example, 8 classical bits are enough to
represent any number between 0 and 255. On
the other hand 8 qubits can represent all
numbers between 0 and 255 at the same time.
• Photonics
• Photons have a natural isolation property due
to their weak interactions with the surrounding
environment, which makes them a great
candidate to carry information, represent
qubits, and operate at room temperature.
• Another advantage is that photonic quantum
computers can be integrated into existing fiber
optic-based telecommunications infrastructure.
Quantum computing components
• Trapped ions
• Quantum hardware that uses trapped ion
qubits typically rely upon microwave or optical
signals transmitted through free space or
waveguides and delivered to the location of
the qubits. Current QC prototypes of trapped-
ion consist of a chain of 5 to 20 static ions in a
single potential well.
Quantum computing components
Semiconducting material
• Qubits can be simulated by manipulating individual
electrons in semiconducting materials such as
selenium or germanium, or defected materials
such as diamonds, aluminum nitride or silicon
carbide.
• Applying microwaves and magnetic fields to these
materials will allow them to exhibit superposition,
entanglement, and other quantum properties.
Quantum computing components
Superconducting material
• Superconducting qubit systems are controlled
using microwave and low-frequency electrical
signals, both of which are communicated
through wires that run into cooling
refrigerators to reach the qubits inside the
controlled environment
Quantum computing components
Quantum registers
• A quantum register is a set of qubits, and it
holds all possible configurations of input data
at the same time. In other words, applying a
quantum algorithm to an n-qubit register will
get the QC to compute all possible 2^n
combinations of 0/1 states “in parallel”.
Quantum computing components
Quantum reversible gates
• A reversible gate is the one whose input can
be reconstructed just by looking at the output.
For example, in classical computation the NOT
inverter gate is reversible, whereas the XOR
gate is irreversible because inputs cannot be
identified by looking at the output.
Quantum processing unit
• A quantum processing unit (QPU) is a
computational unit that relies on quantum
principles to perform a task. the QPU includes the:
• QRAM (register + gates)
• Quantum control unit (QCU) which drives the
system to the desired state.
• Classical controller interface which defines the
interaction between the host CPU and the QPU
How does a developer interact with the quantum computer?
Classical Quantum
Computing Computing
Bits Qubi Complex
Numbers
0 tsα +β
b = {0,
1
States States Superposition
1} (Unit Vectors) (Linear
Combination)
State is
Deterministi State is :|
c Probabilistic : |2