Академический Документы
Профессиональный Документы
Культура Документы
Quantum Computing
Introduction
“I think I can safely say that nobody
understands quantum mechanics” - Feynman
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
Quantum computer
A quantum computer is any device for
computation that makes direct use of
distinctively quantum mechanical
phenomena , such as superposition and
entanglement , to perform operations on data.
Nucleus
Ground
State
Electron
State |0> State |1>
Representation of Data - Superposition
Light pulse of
frequency for time
interval t/2
Ex.
Input Output
The AND Gate In these 3 cases,
A B C information is
0 0 0 being destroyed
A
0 1 0
C
B 1 0 0
1 1 1
H H
State State | State
0> + |1> |1>
|0>
Input Output
A - Target A’ A B A’ B’
0 0 0 0
0 1 1 1
B - Control B’ 1 0 1 0
1 1 0 1
Input Output
Carry One Carry Ones
Bit s Bit Bit Bit
0 0 0 0
0 1 1 0
0 Carry Bit
Ones Bit
H
A Universal Quantum Computer
The CCN gate has been shown to be a universal reversible
logic gate as it can be used as a NAND gate.