This document provides an overview of quantum computing. It begins with a short history and addresses the need for quantum computing to be faster than classical computing. It explains that while classical bits can only be 1 or 0, quantum bits or qubits can be both 1 and 0 simultaneously using superposition. The document notes that nobody fully understands quantum computing because it describes nature in a way that seems absurd. It provides an example of Google working with quantum computing and discusses some of the challenges like keeping qubits from losing their state due to low temperatures and errors. In the end, it suggests that quantum computing has great potential power.
2. Contents
Short History
Need for Speed!
Fussy Logic
Quantom Computing
BitVS Qbit
Google example
What does it represents
Power
PRESENTATION TITLE PAGE 2
3. What is Quantum Computing
PAGE 3
A form of computation based on Quantum
Mechanics that instead of bits uses Qbits.
Qbits can be Atoms, Ions, Electrons or Photons
4. DISCLAMER
PRESENTATION TITLE PAGE 4
NO you are not going to be able to understand it you see my physics students
dont understand it either.
That is because I dont understand it. Nobody does
The theory of quantum electrodynamics describes nature as absurd from the point
of view of common sense.
So I hope that you can accept nature as she isabsurd
Richard Feynman
6. What is Quantum Computing
PAGE 6
A form of computation based on Quantum Mechanics that
instead of bits uses Qbits.
7. Bit VS Qbit
Can be one or zero
The position can be
determined by 100%
2bits can be:
00 or
01 or
10 or
11
Can be 100% one, 100%
percent zero, or a
combination of both!
The value can not be
determined by 100%
2 Qbits can be
PAGE 7
8. How can we compute
Quantum superpositions
Lost quickly
Very low temperatures
Error Control
Source: www.ft.com PAGE 8
IMAGE CREDIT: NAME HERE
Lorem ipsum dolor sit amet, consectetur
adipiscing elit. Phasellus non sem semper,
rhoncus quam nec.