Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .

1.1 What is Quantum Computing?
1.2 Why Another Quantum Computing Tutorial?
1.2.1 The Bible of Quantum Computing
2.1 Introduction
2.2 History
2.3 Turing Machines
2.3.1 Binary Numbers and Formal Languages
2.3.2 Turing Machines in Action
2.3.3 The Universal Turing Machine
2.3.4 The Halting Problem
2.4 Circuits
2.4.1 Common Gates
2.4.2 Combinations of Gates
2.4.3 Relevant Properties
2.4.4 Universality
2.5 Computational Resources and Efﬁciency
2.5.1 Quantifying Computational Resources
2.5.2 Standard Complexity Classes
2.5.3 The Strong Church-Turing Thesis
2.5.4 Quantum Turing Machines
2.6 Energy and Computation
2.6.1 Reversibility
2.6.2 Irreversibility
2.6.3 Landauer’s Principle
2.6.4 Maxwell’s Demon
2.6.5 Reversible Computation
2.6.6 Reversible Gates
2.6.7 Reversible Circuits
2.7 Artiﬁcial Intelligence
2.7.1 The Chinese Room
2.7.2 Quantum Computers and Intelligence
3.1 Introduction
3.2 Polynomials
3.3 Logical Symbols
3.4 Trigonometry Review
3.4.1 Right Angled Triangles
3.4.2 Converting Between Degrees and Radians
3.4.3 Inverses
3.4.5 Visualisations and Identities
3.5 Logs
3.6 Complex Numbers
3.6.1 Polar Coordinates and Complex Conjugates
3.6.2 Rationalising and Dividing
3.6.3 Exponential Form
3.7 Matrices
3.7.1 Matrix Operations
3.8 Vectors and Vector Spaces
3.8.1 Introduction
3.8.2 Column Notation
3.8.3 The Zero Vector
3.8.4 Properties of Vectors inCn
3.8.5 The Dual Vector
3.8.6 Linear Combinations
3.8.7 Linear Independence
3.8.8 Spanning Set
3.8.9 Basis
3.8.10 Probability Amplitudes
3.8.11 The Inner Product
3.8.12 Orthogonality
3.8.13 The Unit Vector
3.8.14 Bases forCn
3.8.17 Outer Products and Projectors
3.8.19 Eigenvalues and Eigenvectors
3.8.20 Trace
3.8.21 Normal Operators
3.8.22 Unitary Operators
3.8.23 Hermitian and Positive Operators
3.8.24 Diagonalisable Matrix
3.8.25 The Commutator and Anti-Commutator
3.8.26 Polar Decomposition
3.8.27 Spectral Decomposition
3.8.28 Tensor Products
3.9 Fourier Transforms
3.9.1 The Fourier Series
3.9.2 The Discrete Fourier Transform
Quantum Mechanics
4.1 History
4.1.1 Classical Physics
4.1.2 Important Concepts
4.1.3 Statistical Mechanics
4.1.4 Important Experiments
4.1.5 The Photoelectric Effect
4.1.6 Bright Line Spectra
4.1.7 Proto Quantum Mechanics
4.1.8 The New Theory of Quantum Mechanics
4.2 Important Principles for Quantum Computing
4.2.1 Linear Algebra
4.2.2 Superposition
4.2.3 Dirac Notation
4.2.4 Representing Information
4.2.5 Uncertainty
4.2.6 Entanglement
4.2.7 The Four Postulates of Quantum Mechanics
Quantum Computing
5.1 Elements of Quantum Computing
5.1.1 Introduction
5.1.2 History
5.1.3 Bits and Qubits
5.1.4 Entangled States
5.1.5 Quantum Circuits
5.2 Important Properties of Quantum Circuits
5.2.1 Common Circuits
5.3 The Reality of Building Circuits
5.3.1 Building a Programmable Quantum Computer
5.4 The Four Postulates of Quantum Mechanics
5.4.1 Postulate One
5.4.2 Postulate Two
5.4.3 Postulate Three
5.4.4 Postulate Four
Information Theory
6.1 Introduction
6.2 History
6.3 Shannon’s Communication Model
6.3.1 Channel Capacity
6.4 Classical Information Sources
6.4.1 Independent Information Sources
6.5 Classical Redundancy and Compression
6.5.1 Shannon’s Noiseless Coding Theorem
6.5.2 Quantum Information Sources
6.5.3 Pure and Mixed States
6.5.4 Schumacher’s Quantum Noiseless Coding Theorem
6.6 Noise and Error Correction
6.6.1 Quantum Noise
6.6.2 Quantum Error Correction
6.7 Bell States
6.7.1 Same Measurement Direction
6.7.2 Different Measurement Directions
6.7.3 Bell’s Inequality
6.8 Cryptology
6.8.1 Classical Cryptography
6.8.2 Quantum Cryptography
6.8.3 Are we Essentially Information?
6.9 Alternative Models of Computation
Quantum Algorithms
7.0.1 Introduction
7.1 Deutsch’s Algorithm
7.1.1 The Problem Deﬁned
7.1.2 The Classical Solution
7.1.3 The Quantum Solution
7.1.4 Physical Implementations
7.2 The Deutsch-Josza Algorithm
7.2.1 The Problem Deﬁned
7.2.2 The Quantum Solution
7.3 Shor’s Algorithm
7.3.1 The Quantum Fourier Transform
7.3.2 Fast Factorisation
7.3.3 Order Finding
7.4 Grover’s Algorithm
7.4.1 The Travelling Salesman Problem
7.4.2 Quantum Searching
Using Quantum Mechanical Devices
8.1 Introduction
8.2 Physical Realisation
8.2.1 Implementation Technologies
8.3 Quantum Computer Languages
8.4 Encryption Devices
0 of .
Results for:
P. 1
Temple of Quantum Computing v1 1

# Temple of Quantum Computing v1 1

Ratings: (0)|Views: 1,705|Likes:

### Availability:

See more
See less

11/01/2011

pdf

text

original

Pages 4 to 73 are not shown in this preview.
Pages 76 to 250 are not shown in this preview.