| 000 -LEADER |
|---|
| fixed length control field |
02578nam a2200253Ia 4500 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20241126123353.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
170804s2002 xx 000 0 und d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780821832295 |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
ICTS-TIFR |
| 050 ## - LIBRARY OF CONGRESS CALL NUMBER |
|---|
| Classification number |
QA267 |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
A. Yu. Kitaev |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Classical and quantum computation |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Name of publisher, distributor, etc. |
American Mathematical Society, |
| Date of publication, distribution, etc. |
[c2002] |
| Place of publication, distribution, etc. |
Rhode Island: |
| 300 ## - Physical Description |
|---|
| Pages: |
257 p |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Graduate studies in mathematics |
| 505 ## - FORMATTED CONTENTS NOTE |
|---|
| Formatted contents note |
Introduction<br/><br/>Part I- Classical computation<br/>1. Turing machines<br/>2. Boolean circuits<br/>3. The class NP: Reducibility and completeness<br/>4. Probabilistic algorithms and the class BPP<br/>5. The hierarchy of complexity classes<br/><br/>Part II- Quantum computation<br/>6. Definitions and notation<br/>7. Correspondence between classical and quantum computation<br/>8. Bases for quantum circuits<br/>9. Definition of quantum computation. Examples.<br/>10. Quantum probability<br/>11. Physically realizable transformations of density matrices<br/>12. Measuring operators<br/>13. Quantum algorithms for Abelian groups<br/>14. The quantum analogue of NP: the class BQNP<br/>15. Classical and quantum codes<br/><br/>Part III- Solutions<br/>S1. Problems of Section 1<br/>S2. Problems of Section 2<br/>S3. Problems of Section 3<br/>S5. Problems of Section 5<br/>S6. Problems of Section 6<br/>S7. Problems of Section 7<br/>S8. Problems of Section 8<br/>S9. Problems of Section 9<br/>S10. Problems of Section 10<br/>S11. Problems of Section 11<br/>S12. Problems of Section 12<br/>S13. Problems of Section 13<br/>S15. Problems of Section 15 |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc. |
This book is an introduction to a new rapidly developing theory of quantum computing. It begins with the basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm. The second part of the book provides an exposition of quantum computation theory. It starts with the introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Then the authors study various quantum computation algorithms: Grover's algorithm, Shor's factoring algorithm, and the Abelian hidden subgroup problem. In concluding sections, several related topics are discussed (parallel quantum computation, a quantum analog of NP-completeness, and quantum error-correcting codes). --- summary provided by publisher |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Mathematics |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Shen, A.H. |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Vyalyi, M.N. |
| 856 ## - ELECTRONIC LOCATION AND ACCESS |
|---|
| Uniform Resource Identifier |
<a href="https://www.ams.org/books/gsm/047/">https://www.ams.org/books/gsm/047/</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Koha item type |
Book |
