Professional Documents
Culture Documents
ð Data Representation
ð Operations on Data
ð Advantages
ð Physical Realization of Quantum Computing
ð 5 Things Every Quantum computer Needs
ð Limitations
<
ð !
ð Operations on Data
ð Advantages
ð Physical Realization of Quantum Computing
ð 5 Things Every Quantum computer Needs
j
Notation:
Spin up:
Spin up:
j |
A bit of data is represented by a single atom that is in one of
two states denoted by § and §. A single bit of this form is
known as a P
A physical implementation of a qubit could use the two energy
levels of an atom. An excited state representing |ñ and a
ground state representing |0.
á
ô
ô
§ §
j
§6
§
§
9here are complex numbers called probability
amplitudes.
§ §§
§
Probability of |0 § §
2
Probability of |ñ § §
j
á
ðô
is the ability of quantum systems to exhibit
correlations between states within a superposition.
ðImagine two qubits, each in the state |0 + |ñ (a superposition
of the 0 and ñ.) 9e can entangle the two qubits such that the
measurement of one qubit is always correlated to the
measurement of the other qubit.
=
V Introduction History
V Data Representation
ð = !
ð Advantages
ð Physical Realization of Quantum Computing
ð 5 Things Every Quantum computer Needs
ð Limitations
= | j
ô
< =
The AND Gate < !
"
0 ñ a
0 ñ 0
a 0 a a 0 a
ña
ñ 0
0 a, ñ a
0 ñ
| | =
T 0 ë ñ , T ñ ë 0
0 ñ
The NOT Gate as a Matrix 0
a
ñ 0
0 ñ
Quantum NOT 0G 0 ñ a a a
ñ 0
| =
|
ñ 0 #
a
0 ñ
$
° 0
ñ ñ ñ
=
ñ ña
2
|
0 ñ 0 ñ 0
0 ñ $ a G ñ 0
0 ñ # 0 ñ
0 ñ
0 ñ 0 ñ
2 2
| ==j
Ñ ( Ñ )
Ñ Ñ
Ñ ( Ñ )
? target
è qubits
2
with prob.
ë 0 ñ then:
with prob.
|
x x x x
0 y xÑy x
0 0 ñ ñ
0 0 0 ñ
|
0 ñ
00 ññ
0
ë G 0 ñ G 0 ñ
2 2
ë 00 0ñ ñ0 ññ
unwanted terms
j
y x y Output
ñ
0 0 G00 ññ
2
ñ
0 ñ G0ñ ñ0
2
ñ
ñ 0 G00 ññ
2
ñ
ñ ñ G0ñ ñ0
2
|
Mñ
M2
0 #
ñ
0 ë ë G 0 ñ G00 ññ
2
| !
Mñ
M2
0 #
ñ
ñ G 0 G00 ññ ñ G00 ññ
2
| "
Mñ
M2
0 #
ñ 00 G 0 ñ 0ñ G ñ 0
2 ë a
2 ñ0 G 0 ñ ññ G ñ 0 a
| #
Mñ
M2
0 #
00, 0ñ, ñ0 or ññ
| $
ñ 0 0
0 ñ
0 ñ #
ñ 0 $#0
|
: ¬, ¬, Ñ ( ¬ )
0 x x
G0 ñ
ñ y yÑf(x)
0ñ
0, ñ Ñ (0)
| !
ñ
G0 ñ x x 0 ñ
0
2
2
ñ y yÑf(x) 00 ñ0
2
0, 0 Ñ (0) ñ, 0 Ñ (ñ)
2
0, (0) ñ, (ñ)
2
%
ë Ñj
%
V Introduction History
V Data Representation
V Operations on Data
ð
ð Physical Realization of Quantum Computing
ð 5 Things Every Quantum computer Needs
ð Limitations
9 % |
ð Advances in security
ð Teleportation
|
=
V Introduction History
V Data Representation
V Operations on Data
V Advantages
ð á ( )
ð 5 Things Every Quantum computer Needs
ð Limitations
< |
ð Ion trap
ð Optical lattice
ð Kingdon trap
A Paul trap uses static direct current (DC) and radio frequency
(RF) oscillating electric fields to trap ions.
<
ð Simplicity of construction
<9
ð Symmetric Traps
ð Asymmetric Traps
ð The ions float above the surface of the chip, out of the
plane of the semiconductor.
Over the years physicists have proven the first four are true
for ion traps, and the development of ion-trap microchips
implies that the fifth is true as well. They are:
V Introduction History
V Data Representation
V Operations on Data
V Advantages
V Physical Realization of Quantum Computing
V 5 Things Every Quantum Computer Needs
ð
9 % |
ð Replication of Devices.