Why Quantum computing

Because ….
Thanks To
Fayez foq Alaade the manager of Association
Syrienne de Cosmologie, de Science et de Science
Fiction
Shirwan Abdullah, Postgraduate Student of
Quantum Information, Department of Physics,
University of York, UK
The goal
•Solving Nondeterministic
polynomial problems ,which
add new dimension to the
solution where ever a new
variable is added.

•More’s Law

•Millions of calculations
parallel in d(t).
What is quantum computing ?
to answer this we need to know
Introduction to quantum theory
Quantum mechanics
Mathematics in Quantum computing
Quantum computing in action
Algorithms in quantum computing
Implementing the simulator
Software engineering
Software Engineering History
Quantum software Engineering
Languages and Compilers
Methods and Tools …. BUT
Quantum Physical Operations Language
1990s
Software Engineering
Object-oriented programmingHistory
(OOP)
has been developed since the early 1960s
Rapid application development (RAD)
since 1991.
Scrum (development), since the late
1990s
Team software process developed by
Watts Humphrey at the SEI
2000s
Rational Unified Process (RUP)
since 1998.
Extreme Programming since 1999
Quantum software Engineering
we need metaphors and models of
quantum computation, that enable
us design and reason about quantum
algorithms without recourse to QM,
unitary matrices, etc. We need
theories and models of that weirdest
quantum process of all: that of
quantum entanglement. Two qubit
entanglement is relatively well
understood – but multi qubit
entanglement, and qudit
entanglement, are barely understood.
Languages and Compilers
We need to design suitable
assembly level and high level
Q-languages
We need to design and
implement (initially, simulate)
new Q-algorithms (beyond the
current ones of Min Max, Shor’s
period finding algorithm used
for factorization, and Grover’s
algorithm for DB searching).
Methods and Tools …. BUT

we have to make do with simulations on classical

machines. We need to implement powerful quantum
computer simulators, in order to perform computational
experiments and validate language and algorithm
designs.
BUT
limits of computer science and software engineering.
The physical infrastructure is being worked on
separately
The existence of high level languages and
development techniques
It has enthusiastic support from (almost) the entire
research community
Quantum Physical Operations Language
Quantum Mechanics
What is QM
Quantum mechanics is generally
about the novel behavior of very
small things. At this scale matter
becomes quantised, this means that
it can be subdivided no more.
Quantum mechanics has never
been wrong, it explains why the
stars shine, how matter is
structured, the periodic table, and
countless other phenomena.
Interference (wave propagation)
Interference Simulation

Patterns formed by 100, 1000 and 10 000 quantum

particles are illustrated.
 MEASUREMENT
In classical physics, the act of measurement
need not affect the object under observation.
classical object can be specified with precision
and without reference to the process of
measurement.
QM measurement plays an active and
disturbing role. Because of this, quantum
particles are best described within the context
of the possible outcomes of measurements.
measurement here can affect things over
there. Thus, measurements can have a non-
local impact on our knowledge of the world.
 Entanglement
Entanglement is the ability for
pairs of particles to interact over
any distance instantaneously.
Particles don’t exactly
communicate, but there is a
statistical correlation between
results of measurements on each
particle that is hard to understand
using classical physics.
The Schrodinger equation
describing how the wave function
representing a quantum particle
ebbs and flows.
describing how the quantum state
of a physical system changes in
time.
describing the wave-like properties
of particles
The Four Postulates of Quantum
Mechanics
To every state of a physical system there is a
function Ψ ascribed to and defining the state.
If ℋ1 is the Hilbert space associated with the
physical system S1, and ℋ2 is the Hilbert space
physical system S2, then S1 + S2 will be
associated with the tensor product of the two
Hilbert vector spaces ℋ1 ⊗ℋ2.
To every observable of a physical system is
associated a self-adjoint (or Hermitian) operator
allowing a complete set of eigenfunctions.
The time evolution of a quantum state is
governed by a unitary transformation.
Mathematics in Quantum Computing
Dirac bra-ket notation
MATRICES AND OPERATORS
Pauli operators,Unitary Operators
Hilbert space
It extends the methods of vector algebra and calculus
from the two-dimensional Euclidean plane and three-
dimensional space to spaces with any finite or infinite
number of dimensions.
TENSOR PRODUCTS

The tensor product of two vector spaces and , denoted and also
called the tensor direct product, is a way of creating a new
vector space analogous to multiplication of integers.
Hadamard transform
The Hadamard transform is a × matrix, the
Hadamard matrix (scaled by a normalization factor),
that transforms real numbers into real numbers
Quantum Computing
The State of a Quantum System
PAULI X
Pauli-X gate
The Pauli-X gate acts on a single
qubit. It is the quantum equivalent
of a NOT gate. It maps to and to . It
is represented by the Pauli X matrix:
.
A QUANTUM MODEL OF COMPUTATION
quantum circuit model, logical qubits,quantum gates
that act on the qubits.
A quantum circuit is often illustrated schematically by
a circuit diagram
Controlled Not Gate
The CNOT gate flips the second qubit (the target qubit) if
and only if the first qubit (the control qubit) is 1.

Before After

Control Target Control Target

0 0 0 0

0 1 0 1
Controlled U Gates
1 0 1 1

1 1 1 0
BASIC QUANTUM CIRCUIT DIAGRAMS
Quantum Algorithms
QM Algorithms
because the nature of quantum systems—captured in
superposition and interference of qubits—often allows
a quantum system to compute in a parallel way that is
not possible even, in principle, with a classical
computer.
a quantum algorithm is capable of evaluating the
function at multiple values of x simultaneously.
Shor's algorithm
Shor's algorithm, named after mathematician Peter
Shor, is a quantum algorithm (an algorithm which
runs on a quantum computer) for integer factorization
discovered in 1994. Informally it solves the following
problem: Given an integer N, find its prime factors.
Quantum => O((log N)3), Classic=>
Grover's algorithm
Grover's algorithm is a quantum algorithm for
searching an unsorted database with N entries in
O(N1/2) time and using O(log N) storage space .It was
invented by Lov Grover in 1996.
Compare …
Practical
JQuantum
QCS Quantum Computer Simulator
Upgrade
Complex number map
Difficulties about simulating a quantum
computer
Applications
These devices have
been used to
demonstrate the basic
operations required
for
a quantum computer
and for teleportation
of the quantum state
of one atom onto
another
Applications cont-2

Miniatur
e atomic
clock
occupyin
g less
than 10
mm3
Optical equipment at the Georgia
Institute of Technology is used to
transfer information from two
different groups of atoms onto a
single photon
 ‫المجال‬ ‫الحواسيب الكالسيكية‬ ‫الحواسيب الكونتية‬

‫وحدة التخزين المستخدمة‬ ‫البت‬ ‫الكيوبت‬

‫قيم التي يمكن لوحدة التخزين أن تحملها‬ ‫هي فقط إما ‪ 0‬أو ‪1‬‬ ‫لها عدد غير منتهي من القيم بشرط تحقق‬
‫الشرط التالي‬
‫إمكانية الحوسبة المتوازية‬ ‫من حيث' البنية المستخدمة فهي عاجزة عن الحوسبة‬ ‫محقق حيث تستطيع معالجة أكثر من حالة في‬
‫المتوازية‬ ‫نفس الوقت‬
‫خوارزميات تحليل العدد إلى عوامله األولية‬ ‫تعد هذه العملية من العمليات الغير مجدية حسابيا بسبب‬ ‫عملية سهلة الحساب حيث أن التعقيد هو كثير‬
‫التعقيد األسي‪ .‬ولذلك فهي االساس' الذي يعتمد عليه في‬ ‫حدود وذلك كما عبرت عنه خوارزمية شور‬
‫التشفير الغير متناظر‪.‬‬

‫خوارزمية البحث في قاعدة بيانات غير مرتبة‬ ‫ال توجد خوارزميات من أجل تسريع عملية البحث' حيث‬ ‫تم تقليل التعقيد فقد أصبح التعقيد لوغاريتمي‬
‫بقيت عملية البحث ذات تعقيد خطي‬ ‫وذلك باٍستخدام خوارزمية ‪Grover‬‬

‫صفات البوابات المستخدمة‬ ‫البوابات تعتمد في عملها على جدول الحقيقة‬ ‫البوابات المستخدمة تعتمد ف'ي تمثيلها على‬
‫أغلب هذه البوابات' هي بوابات غير قابلة للعكس‪.‬‬ ‫المصفوفات الواحدية ‪.‬‬
‫هي بوابات قابلة للعكس‪.‬‬

‫حالة النظام‬ ‫تمثل حالة النظام بالنتيجة النهائية التي تم الحصول عليها‬ ‫يتم تمثيل حالة النظام بواسطة شعاع موجود‬
‫أي سلسلة من ‪ 0‬و‪1‬‬ ‫ف'ي فضاء هيلبرت‪.‬‬
‫في مجال الفيزياء المستخدمة‬ ‫محدودة وحالة خاصة‪.‬‬ ‫هي الحالة العامة وتمثل جميع القيم الممكنة‪.‬‬

‫هندسة البرمجيات‬ ‫وصلت إلى مراحل متقدمة جدا‪.‬‬ ‫ما زالت في بداياتها‪.‬‬
‫التطبيقات‬ ‫تطبيقاتها منتشرة بشكل كبير‪.‬‬ ‫مازالت في مرحلة المحاكاة واألبحاث‪.‬‬
‫بنية الحواسيب المستخدمة‬ ‫وصل تصميم الحواسيب' إلى شكله النهائي و إلى حدود‬ ‫ما زال في مرحلة البحث والتصميم األولي‬
‫عمله‪.‬‬
Quantum is simply superior
1970s Polish mathematical physicist Roman Stanisław Ingarden publishes a seminal
paper entitled "Quantum Information Theory" in Reports on Mathematical Physics
1980s David Deutsch, at the University of Oxford, described the first
universal quantum computer
1990s Artur Ekert at the University of Oxford, invents entanglement based secure
communication
2000-2004 First execution of Shor's algorithm at IBM's Almaden Research Center and
Stanford University.
2005 Harvard University and Georgia Institute of Technology researchers succeeded in
transferring quantum information between "quantum memories" – from atoms to
photons and back again.
2006 University of Utah Scientist shows it's feasible to read data stored as nuclear spins
2007 Long distance entanglement demonstrated, Single electron qubit memory
2008 Possible non-entanglement quantum computing
2009 Google collaborates with D-Wave Systems on image search technology using
quantum computing
2010 Single electron qubit developed
Future look