Scribd
Upload
77 views18 pages

Quantum Computing: Pradyumna Mukhopadhyay: Pranjoli Basak: Subhajit Bera: Srinyantu Chatterjee

1) The document discusses the history and principles of quantum computing, including how qubits can represent data using superposition and entanglement. It explains Shor's algorithm for factoring integers on a quantum computer. 2) Operations on qubits must be reversible, and the document describes quantum gates like the Hadamard and controlled-NOT gates. 3) Shor's algorithm uses modular arithmetic and the quantum Fourier transform to find the period of a function, which can be used to factor large numbers. While quantum computers are still in development, they may be useful for certain applications.

Uploaded by

Srinyantu Chatterjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
77 views18 pages

Quantum Computing: Pradyumna Mukhopadhyay: Pranjoli Basak: Subhajit Bera: Srinyantu Chatterjee

1) The document discusses the history and principles of quantum computing, including how qubits can represent data using superposition and entanglement. It explains Shor's algorithm for factoring integers on a quantum computer. 2) Operations on qubits must be reversible, and the document describes quantum gates like the Hadamard and controlled-NOT gates. 3) Shor's algorithm uses modular arithmetic and the quantum Fourier transform to find the period of a function, which can be used to factor large numbers. While quantum computers are still in development, they may be useful for certain applications.

Uploaded by

Srinyantu Chatterjee
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

QUANTUM COMPUTING

PRADYUMNA MUKHOPADHYAY: 13005317038


PRANJOLI BASAK: 13005317037
SUBHAJIT BERA: 13005317015
SRINYANTU CHATTERJEE: 13005317016
OVERVIEW

• Introduction and History


• Data Representation
• Operations on Data
• Shor’s Algorithm
• Conclusion and Scope
INTRODUCTION

What is a Quantum Computer?

ANS:-A quantum computer is a machine that performs


calculations based on the laws of quantum mechanics, which is
the behavior of particles at the sub-atomic level.
HISTORY
 1982 - Feynman proposed the idea of creating machines
based on the laws of quantum mechanics instead of the
laws of classical physics.

 1985 - David Deutsch developed the Quantum Turing


Machine, showing that quantum circuits are
universal.

 1994 - Peter Shor came up with a quantum algorithm


to factor very large numbers in polynomial time.

 1997 – Lov-grover develops a quantum search


algorithm with O(√N) complexity.

 In 2001, a 7 qubit machine was built and


programmed to run Shor’s algorithm to
successfully factor 15.
Data Representation - Qubits

A bit of data is represented by a single atom that is in one of two states denoted

by |0> and |1>. A single bit of this form is known as a qubit.


A physical implementation of a qubit could use the two energy levels of an atom. An excited state
representing |1> and a ground state representing |0>.

A single qubit can be forced into a superposition of the two states denoted by the addition of the
state vectors:

|  > = |0> + β|1>

Where  and β are complex numbers and |  | ² + | β | ² = 1


SUPERPOSITION
A qubit in superposition is in both of the states
|1> and |0> at the same time.

Consider a 3 bit qubit register ,an equally weighted superposition of all possible
states would be denoted by:

|> = _1|000> + _1|001> + . . . + 1_|


√8 √8 111>
√8
In general, an n qubit register can represent the numbers 0 through 2^n-1
simultaneously. If we attempt to retrieve the values represented within a
superposition, the superposition randomly collapses to represent just one
of the original values.
In our equation: |>=|0>+β|1>
,where
 represents the probability of the
superposition collapsing to |0> and β to |
1>
These are called probability amplitudes.
In a balanced superposition,
 = 1/√(2^n) where n is the number of qubits.
ENTANGLEMENT
 Entanglement is the ability of quantum systems to exhibit
correlations between states within a superposition.
 Imagine two qubits, each in the state |0> + |1> (a
superposition of the 0 and 1.) We can entangle the
two qubits such that the measurement of one qubit is
always correlated to the measurement of the other
qubit.
Operations on Qubits - Reversible Logic
 Due to the nature of quantum physics, the destruction of information in a
gate will cause heat to be evolved which can destroy the superposition of
qubits.
INPU OUTPU
A A T B T C
C
B 0 0 0
0 1 0
Example: The Logical AND
1 0 0
Gate
1 1 1

Note: This type of gate cannot be used. We must use Quantum Gates.
Quantum Gates
 Quantum Gates are similar to classical gates, but do not have a
degenerate output. i.e. their original input state can be derived
from their output state, uniquely. They must be reversible.
 This means that a deterministic computation can be performed
on a quantum computer only if it is reversible.Luckily, it has
been shown that any deterministic computation can be made
reversible. (Charles Bennet, 1973)
Quantum Gates-Hadamard
 Simplest gate involves one qubit and is called a Hadamard
Gate (also known as a square-root of NOT gate.) Used to
put qubits into superposition.

H H
State |0> State |0> + State |1> State |

Note :
1> Two Hadamard gates used in succession can be used
as a NOT gate.
Quantum Gates - Controlled NOT
 A gate which operates on two qubits is called
a Controlled-NOT (CN) Gate. If the bit on
the control line is 1, invert the bit on the
target line. INPUT
A-Target
+ A’
A
0
OUTPUTB
0
A’
0
B’
0
0 1 1 1
B-Target
1 0 1 0
B’
1 1 0 1

Note: The CN gate has a similar behavior to the XOR gate with
some extra information to make it reversible.
A QUANTUM CIRCUIT DIAGRAM
GIVEN GRAPH TELLS US THE PROBABILITIES OF EACH STATE
Shor’s Algorithm
 Shor’s algorithm shows (in principle,) that a quantum computer is capable
of factoring very large numbers in polynomial time.

 The algorithm uses the following concepts:


 Modular Arithmetic
 Quantum Parallelism
 Quantum Fourier Transform
Shor’s Algorithm - Periodicity
 An important result from Number Theory:

F(a) = xamod N is a periodic function.


 Choose N = 15 and x = 7 and we get the following:
7 0 mod 15 = 1
7 1 mod 15 = 7
7 2 mod 15 = 4
3
7

mod 15 = 13
7 4 mod 15 = 1
…
Shor’s Algorithm - Analysis
To Factor an odd integer N (Let’s choose 15) :
 Choose an integer q such that N2 < q < 2N2 let’s pick 256
 Choose a random integer x such that GCD(x, N) = 1 let’s pick 7
 Create two quantum registers (these registers must also be entangled so that
the collapse of the input register corresponds to the collapse of the output
register)
 Input register: must contain enough qubits to represent numbers as large as q-
1. up to 255, so we need 8 qubits .
 Output register: must contain enough qubits to represent numbers as large
as N-1. up to 14, so we need 4 qubits.
Conclusion and Scope
 Various researchers are actively looking for new algorithms and
communication protocols to exploit the properties of quantum
systems.
 D-Wave Systems is a Canadian company that claims to have
developed a 28-qubit quantum computer, though there have been
criticisms of their claims. In 2007, they demonstrated the use of a 16-qubit
computer to solve such problems as pattern-matching, seating
arrangements, and a Sudoku puzzle.
 It is unlikely that quantum computers will entirely replace classical
computers. Their advantage over classical computers is significant
only in specific application areas.
 It is most likely that future computers will instead be some sort of hybrid,
containing components from both types of computers.

You might also like