E-raamat: Principles of Quantum Artificial Intelligence [World Scientific e-raamat]

(Univ De Lisboa, Portugal & Inesc-id, Portugal)
  • Formaat: 276 pages
  • Ilmumisaeg: 09-Dec-2013
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • ISBN-13: 9789814566759
Teised raamatud teemal:
  • World Scientific e-raamat
  • Hind: 105,34 €*
  • * hind, mis tagab piiramatu üheaegsete kasutajate arvuga ligipääsu piiramatuks ajaks
Principles of Quantum Artificial IntelligenceSuurem pilt
  • Formaat: 276 pages
  • Ilmumisaeg: 09-Dec-2013
  • Kirjastus: World Scientific Publishing Co Pte Ltd
  • ISBN-13: 9789814566759
Teised raamatud teemal:
World Scientific e-raamatudRohkem infot World Scientific e-raamatute kohta
Raamatu kodulehekülg: http://www.worldscientific.com/worldscibooks/10.1142/8980#t=toc
In this book, we introduce quantum computation and its application to AI. We highlight problem solving and knowledge representation framework. Based on information theory, we cover two main principles of quantum computation — Quantum Fourier transform and Grover search. Then, we indicate how these two principles can be applied to problem solving and finally present a general model of a quantum computer that is based on production systems.
Preface vii
1 Introduction
1(8)
1.1 Artificial Intelligence
1(1)
1.2 Motivation and Goals
2(2)
1.3 Guide to the Reader
4(1)
1.4 Content
4(5)
1.4.1 Classical computation
4(2)
1.4.2 Quantum computation
6(3)
2 Computation
9(10)
2.1 Entscheidungsproblem
9(3)
2.1.1 Cantor's diagonal argument
11(1)
2.1.2 Reductio ad absurdum
11(1)
2.2 Complexity Theory
12(2)
2.2.1 Decision problems
13(1)
2.2.2 P and NP
13(1)
2.3 Church--Turing Thesis
14(1)
2.3.1 Church--Turing--Deutsch principle
15(1)
2.4 Computers
15(4)
2.4.1 Analog computers
15(1)
2.4.2 Digital computers
16(1)
2.4.3 Von Neumann architecture
16(3)
3 Problem Solving
19(18)
3.1 Knowledge Representation
19(6)
3.1.1 Rules
19(1)
3.1.2 Logic-based operators
20(3)
3.1.3 Frames
23(1)
3.1.4 Categorial representation
23(1)
3.1.5 Binary vector representation
24(1)
3.2 Production System
25(5)
3.2.1 Deduction systems
26(2)
3.2.2 Reaction systems
28(1)
3.2.3 Conflict resolution
28(1)
3.2.4 Human problem-solving
29(1)
3.2.5 Example
29(1)
3.3 Sub-Symbolic Models of Problem-Solving
30(7)
3.3.1 Proto logic
31(1)
3.3.2 Binding problem
32(1)
3.3.3 Icons
32(3)
3.3.4 Euclidian geometry of the world
35(2)
4 Information
37(38)
4.1 Information and Thermodynamics
37(10)
4.1.1 Dice model
39(1)
4.1.2 Entropy
40(1)
4.1.3 Maxwell paradox and information
41(1)
4.1.4 Information theory
42(5)
4.2 Hierarchical Structures
47(3)
4.2.1 Example of a taxonomy
49(1)
4.3 Information and Measurement
50(7)
4.3.1 Information measure I
52(3)
4.3.2 Nature of information measure
55(1)
4.3.3 Measurement of angle
55(1)
4.3.4 Information and contour
56(1)
4.4 Information and Memory
57(10)
4.5 Sparse code for Sub-symbols
67(1)
4.5.1 Sparsification based on unary sub-vectors
68(1)
4.6 Deduction Systems and Associative Memory
68(7)
4.6.1 Taxonomic knowledge organization
74(1)
5 Reversible Algorithms
75(4)
5.1 Reversible Computation
75(1)
5.2 Reversible Circuits
76(3)
5.2.1 Boolean gates
76(1)
5.2.2 Reversible Boolean gates
76(1)
5.2.3 Toffoli gate
77(1)
5.2.4 Circuit
78(1)
6 Probability
79(16)
6.1 Kolmogorovs Probabilities
79(11)
6.1.1 Conditional probability
80(1)
6.1.2 Bayes's rule
81(1)
6.1.3 Joint distribution
82(2)
6.1.4 Naeve Bayes and counting
84(1)
6.1.5 Counting and categorization
85(1)
6.1.6 Bayesian networks
86(4)
6.2 Mixed Distribution
90(1)
6.3 Markov Chains
91(4)
7 Introduction to Quantum Physics
95(24)
7.1 Unitary Evolution
95(2)
7.1.1 Schrodinger's cat paradox
96(1)
7.1.2 Interpretations of quantum mechanics
96(1)
7.2 Quantum Mechanics
97(2)
7.2.1 Stochastic Markov evolution and unitary evolution
98(1)
7.3 Hilbert Space
99(4)
7.3.1 Spectral representation*
101(2)
7.4 Quantum Time Evolution
103(2)
7.5 Compound Systems
105(3)
7.6 Von Neumann Entropy
108(1)
7.7 Measurement
109(5)
7.7.1 Observables
110(1)
7.7.2 Measuring a compound system
111(1)
7.7.3 Heisenberg's uncertainty principle*
112(2)
7.8 Randomness
114(5)
7.8.1 Deterministic chaos
114(1)
7.8.2 Kolmogorov complexity
114(2)
7.8.3 Humans and random numbers
116(1)
7.8.4 Randomness in quantum physics
116(3)
8 Computation with Qubits
119(26)
8.1 Computation with one Qubit
119(2)
8.2 Computation with m Qubit
121(2)
8.3 Matrix Representation of Serial and Parallel Operations
123(2)
8.4 Entanglement
125(2)
8.5 Quantum Boolean Circuits
127(3)
8.6 Deutsch Algorithm
130(2)
8.7 Deutsch Jozsa Algorithm
132(3)
8.8 Amplitude Distribution
135(4)
8.8.1 Cloning
136(1)
8.8.2 Teleportation
137(2)
8.9 Geometric Operations
139(6)
9 Periodicity
145(28)
9.1 Fourier Transform
145(2)
9.2 Discrete Fourier Transform
147(3)
9.2.1 Example
149(1)
9.3 Quantum Fourier Transform
150(3)
9.4 FFT
153(1)
9.5 QFT Decomposition
154(5)
9.5.1 QFT quantum circuit*
155(4)
9.6 QFT Properties
159(2)
9.7 The QFT Period Algorithm
161(3)
9.8 Factorization
164(4)
9.8.1 Example
164(4)
9.9 Kitaev's Phase Estimation Algorithm*
168(3)
9.9.1 Order finding
170(1)
9.10 Unitary Transforms
171(2)
10 Search
173(26)
10.1 Search and Quantum Oracle
173(2)
10.2 Lower Bound for Ω(√n) for Uf-based Search*
175(5)
10.2.1 Lower bound of at
176(2)
10.2.2 Upper bound of at
178(1)
10.2.3 Ω(√n)
179(1)
10.3 Grover's Amplification
180(14)
10.3.1 Householder reflection
180(1)
10.3.2 Householder reflection and the mean value
181(1)
10.3.3 Amplification
182(2)
10.3.4 Iterative amplification
184(7)
10.3.5 Number of iterations
191(1)
10.3.6 Quantum counting
192(2)
10.4 Circuit Representation
194(1)
10.5 Speeding up the Traveling Salesman Problem
195(1)
10.6 The Generate-and-Test Method
196(3)
11 Quantum Problem-Solving
199(24)
11.1 Symbols and Quantum Reality
199(1)
11.2 Uninformed Tree Search
200(3)
11.3 Heuristic Search
203(5)
11.3.1 Heuristic functions
205(1)
11.3.2 Invention of heuristic functions
205(2)
11.3.3 Quality of heuristic
207(1)
11.4 Quantum Tree Search
208(4)
11.4.1 Principles of quantum tree search
208(2)
11.4.2 Iterative quantum tree search
210(1)
11.4.3 No constant branching factor
211(1)
11.5 Quantum Production System
212(1)
11.6 Tarrataca's Quantum Production System
213(7)
11.6.1 3-puzzle
213(4)
11.6.2 Extending for any n-puzzle
217(1)
11.6.3 Pure production system
218(1)
11.6.4 Unitary control strategy
219(1)
11.7 A General Model of a Quantum Computer
220(3)
11.7.1 Cognitive architecture
220(1)
11.7.2 Representation
221(2)
12 Quantum Cognition
223(12)
12.1 Quantum Probability
223(3)
12.2 Decision Making
226(6)
12.2.1 Interference
231(1)
12.3 Unpacking Effects
232(1)
12.4 Conclusion
233(2)
13 Related Approaches
235(12)
13.1 Quantum Walk
235(5)
13.1.1 Random walk
235(1)
13.1.2 Quantum insect
235(2)
13.1.3 Quantum walk on a graph
237(1)
13.1.4 Quantum walk on one dimensional lattice
238(1)
13.1.5 Quantum walk and search
239(1)
13.1.6 Quantum walk for formula evaluation
239(1)
13.2 Adiabatic Computation
240(3)
13.2.1 Quantum annealing
241(2)
13.3 Quantum Neural Computation
243(2)
13.4 Epilogue
245(2)
Bibliography 247(12)
Index 259
Püsilink: https://www.kriso.ee/db/9789814566759_pe.html