Professional Documents
Culture Documents
Computing
Osama Awwad
Department of Computer Science
Western Michigan University
December 15, 2022
Overview
Introduction
Data Representation
Computational Complexity
Implementation Technologies
Quantum Computer Languages
Introduction to quantum mechanics
Richard Feynman
A simple experiment in optics
detectors
photon
beamsplitter
source
Now consider what happens when we fire a
single photon into the device…
50%
50%
full mirror
1
The probability of the computation following
2
0 a given path is obtained by multiplying the
1
probabilities along all branches of that
2 path… in the example the probability the
1
1 computation follows the red path is
2
1 1 1 1
0
2 2 2 4
The probability of the computation giving the
1 answer 0 is obtained by adding the
2
1
probabilities of all paths resulting in 0:
1 1 1
4 4 2
…vs quantum probabilities …
1 1 1
1 1 1 01
2 2 2
1
0 0 full mirror
2
Representation of Data
Quantum computers, which have not been built yet, would be based on
the strange principles of quantum mechanics, in which the smallest
particles of light and matter can be in different places at the same time.
In a quantum computer, one "qubit" - quantum bit - could be both 0 and
1 at the same time. So with three qubits of data, a quantum computer
could store all eight combinations of 0 and 1 simultaneously. That
means a three-qubit quantum computer could calculate eight times
faster than a three-bit digital computer.
Typical personal computers today calculate 64 bits of data at a time. A
quantum computer with 64 qubits would be 2 to the 64th power faster,
or about 18 billion billion times faster. (Note: billion billion is correct.)
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
Representation of Data - Qubits
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>.
Light pulse of
frequency for
Excited time interval t
State
Nucleus
Ground
State
Electron
State |0> State |1>
Representation of Data - Superposition
2 2
Where 1 and 2 are complex numbers and | 1 | + | 2 | = 1
2
we get x y with probability xy
Measurement
a,b G , ak = b , find k
Computational Complexity Comparison
Classical Quantum
Factoring
e
O n1 / 3 log 2 / 3 n On e O log n
Elliptic Curve
Discrete
O n
Logarithms e On e O log n
Even though no quantum computer has been built that hasn’t stopped
the proliferation of papers on various aspects of the subject. Many such
papers have been written defining language specifications.
Thank You