Introduction to quantum algorithms / (Record no. 15300)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03980cam a22003138i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 11382 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | IN-BhIIT |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260206134925.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240413s2024 riu b 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9781470473983 (pbk.) |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | IN-BhIIT |
| 041 ## - LANGUAGE CODE | |
| Language code of text | eng |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 004.1 |
| Book number | BUC/I |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Buchmann, Johannes, |
| Relator term | Author. |
| 245 10 - TITLE STATEMENT | |
| Title | Introduction to quantum algorithms / |
| Statement of responsibility, etc | Johannes A. Buchmann. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Providence, USA : |
| Name of publisher | American Mathematical Society, |
| Year of publication | 224. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xvi, 371 p. : |
| Other physical details(ill.) | ill. ; |
| Dimensions(size) | 24 cm. |
| 490 0# - SERIES STATEMENT | |
| Series statement | Pure and applied undergraduate texts ; 64 |
| 500 ## - GENERAL NOTE | |
| General note | Cover -- Title page -- Copyright -- Contents -- Preface -- The advent of quantum computing -- The goal of the book -- The structure of the book -- What is not covered -- For instructors -- Acknowledgements -- Chapter 1. Classical Computation -- 1.1. Deterministic algorithms -- 1.2. Probabilistic algorithms -- 1.3. Analysis of probabilistic algorithms -- 1.4. Complexity theory -- 1.5. The circuit model -- 1.6. Circuit families and circuit complexity -- 1.7. Reversible circuits -- Chapter 2. Hilbert Spaces -- 2.1. Kets and state spaces -- 2.2. Inner products -- 2.3. Linear maps -- 2.4. Endomorphisms -- 2.5. Tensor products -- Chapter 3. Quantum Mechanics -- 3.1. State spaces -- 3.2. State spaces of composite systems -- 3.3. Time evolution -- 3.4. Measurements -- 3.5. Density operators -- 3.6. The quantum postulates for mixed states -- 3.7. Partial trace and reduced density operators -- Chapter 4. The Theory of Quantum Algorithms -- 4.1. Simple single-qubit operators -- 4.2. More geometry in R3 -- 4.3. Rotation operators -- 4.4. Controlled operators -- 4.5. Swap and permutation operators -- 4.6. Ancillary and erasure gates -- 4.7. Quantum circuits revisited -- 4.8. Universal sets of quantum gates -- 4.9. Implementation of controlled operators -- 4.10. Perfectly universal sets of quantum gates -- 4.11. A universal set of quantum gates -- 4.12. Quantum algorithms and quantum complexity -- Chapter 5. The Algorithms of Deutsch and Simon -- 5.1. The Deutsch algorithm -- 5.2. Oracle complexity -- 5.3. The Deutsch-Jozsa algorithm -- 5.4. Simon's algorithm -- 5.5. Generalization of Simon's algorithm -- Chapter 6. The Algorithms of Shor -- 6.1. Idea of Shor's factoring algorithm -- 6.2. The Quantum Fourier Transform -- 6.3. Quantum phase estimation -- 6.4. Order finding -- 6.5. Integer factorization -- 6.6. Discrete logarithms. |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc | Includes bibliographical references and index. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Classical computation -- Hilbert spaces -- Quantum mechanics -- The theory of quantum algorithms -- The algorithms of Deutsch and Simon -- The algorithms of Shor -- Quantum search and quantum counting -- The HHL algorithm. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Quantum algorithms are among the most important, interesting, and promising innovations in information and communication technology. They pose a major threat to today's cybersecurity and at the same time promise great benefits by potentially solving previously intractable computational problems with reasonable effort. The theory of quantum algorithms is based on advanced concepts from computer science, mathematics, and physics. Introduction to Quantum Algorithms offers a mathematically precise exploration of these concepts, accessible to those with a basic mathematical university education, while also catering to more experienced readers. This comprehensive book is suitable for self-study or as a textbook for one- or two-semester introductory courses on quantum computing algorithms. Instructors can tailor their approach to emphasize theoretical understanding and proofs or practical applications of quantum algorithms, depending on the course's goals and timeframe. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Quantum computing. |
| Topical Term | Quantum computers. |
| Topical Term | Computer algorithms. |
| Topical Term | Number theory. |
| Topical Term | Computer science. |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Technical Reference Book |
| Koha issues (borrowed), all copies | 1 |
| Withdrawn status | Lost status | Damaged status | Not for loan | Collection code | Home library | Current library | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Not withdrawn | Not Lost | not damaged | Central Library, IIT Bhubaneswar | Central Library, IIT Bhubaneswar | 04/02/2026 | 39 | 5888.88 | 004.1 BUC/I | 11382 | 8066.96 | 04/02/2026 | Technical Reference Book |