Principles of quantum artificial intelligence / (Record no. 416213)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03701cam a22002415i 4500 |
001 - CONTROL NUMBER | |
control field | 18016832 |
003 - CONTROL NUMBER IDENTIFIER | |
control field | ISI Library, Kolkata |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20141208123817.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 140123s2014 si a b 001 0 eng |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9789814566742 (hbk.) |
040 ## - CATALOGING SOURCE | |
Original cataloging agency | ISI Library |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Edition number | 23 |
Item number | W633 |
Classification number | 004.1 |
100 1# - MAIN ENTRY--PERSONAL NAME | |
Personal name | Wichert, Andreas. |
245 10 - TITLE STATEMENT | |
Title | Principles of quantum artificial intelligence / |
Statement of responsibility, etc | Andreas Wichert. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication, distribution, etc | Singapore : |
Name of publisher, distributor, etc | World Scientific, |
Date of publication, distribution, etc | c2014. |
300 ## - PHYSICAL DESCRIPTION | |
Extent | xiv, 202 p. : |
Other physical details | ill. ; |
Dimensions | 24 cm. |
504 ## - BIBLIOGRAPHY, ETC. NOTE | |
Bibliography, etc | Includes bibliographical references (p. 247-257) and index. |
505 ## - FORMATTED CONTENTS NOTE | |
Formatted contents note | 1. Introduction. <br/>1.1. Artificial intelligence. <br/>1.2. Motivation and goals. <br/>1.3. Guide to the reader. <br/>1.4. Content --<br/><br/>2. Computation. <br/>2.1. Entscheidungsproblem. <br/>2.2. Complexity theory. <br/>2.3. Church-Turing thesis. <br/>2.4. Computers --<br/> <br/>3. Problem solving. <br/>3.1. Knowledge representation. <br/>3.2. Production system. <br/>3.3. Sub-symbolic models of problem-solving --<br/> <br/>4. Information. <br/>4.1. Information and thermodynamics. <br/>4.2. Hierarchical structures. <br/>4.3. Information and measurement. <br/>4.4. Information and memory. <br/>4.5. Sparse code for sub-symbols. <br/>4.6. Deduction systems and associative memory --<br/> <br/>5. Reversible algorithms. <br/>5.1. Reversible computation. <br/>5.2. Reversible circuits --<br/> <br/>6. Probability. <br/>6.1. Kolmogorovs probabilities. <br/>6.2. Mixed distribution. <br/>6.3. Markov chains --<br/> <br/>7. Introduction to quantum physics. <br/>7.1. Unitary evolution. <br/>7.2. Quantum mechanics. <br/>7.3. Hilbert space. <br/>7.4. Quantum time evolution. <br/>7.5. Compound systems. <br/>7.6. Von Neumann entropy. <br/>7.7. Measurement. <br/>7.8. Randomness --<br/><br/>8. Computation with qubits. <br/>8.1. Computation with one qubit. <br/>8.2. Computation with m qubit. <br/>8.3. Matrix representation of serial and parallel operations. <br/>8.4. Entanglement. <br/>8.5. Quantum Boolean circuits. <br/>8.6. Deutsch algorithm. <br/>8.7. Deutsch Jozsa algorithm. <br/>8.8. Amplitude distribution. <br/>8.9. Geometric operations --<br/> <br/>9. Periodicity. <br/>9.1. Fourier transform. <br/>9.2. Discrete Fourier transform. <br/>9.3. Quantum Fourier transform. <br/>9.4. FFT. <br/>9.5. QFT decomposition. <br/>9.6. QFT properties.<br/>9.7. The QFT period algorithm. <br/>9.8. Factorization. <br/>9.9. Kitaev's phase estimation algorithm. <br/>9.10. Unitary transforms --<br/> <br/>10. Search. <br/>10.1. Search and quantum oracle. <br/>10.2. Lower bound [symbol] for [symbol]-based search. <br/>10.3. Grover's amplification. <br/>10.4. Circuit representation. <br/>10.5. Speeding up the traveling salesman problem. <br/>10.6. The generate-and-test method --<br/> <br/>11. Quantum problem-solving. <br/>11.1. Symbols and quantum reality. <br/>11.2. Uninformed tree search. <br/>11.3. Heuristic search. <br/>11.4. Quantum tree search. <br/>11.5. Quantum production system. <br/>11.6. Tarrataca's quantum production system. <br/>11.7. A general model of a quantum computer --<br/> <br/>12. Quantum cognition. <br/>12.1. Quantum probability. <br/>12.2. Decision making. <br/>12.3. Unpacking effects. <br/>12.4. Conclusion --<br/> <br/>13. Related approaches. <br/>13.1. Quantum walk. <br/>13.2. Adiabatic computation. <br/>13.3. Quantum neural computation. <br/>13.4. Epilogue.<br/><br/>Bibliography--<br/>Index. |
520 ## - SUMMARY, ETC. | |
Summary, etc | 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. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Quantum computers. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Artificial intelligence. |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Dewey Decimal Classification |
Koha item type | Books |
Lost status | Not for loan | Home library | Current library | Date acquired | Cost, normal purchase price | Full call number | Accession Number | Koha item type |
---|---|---|---|---|---|---|---|---|
ISI Library, Kolkata | ISI Library, Kolkata | 17/11/2014 | 4800.31 | 004.1 W633 | 135412 | Books |