An Introduction to Quantum Computing Algorithms - Info and Reading Options
By Arthur O. Pittenger

"An Introduction to Quantum Computing Algorithms" was published by Birkhäuser Boston in 2000 - Boston, MA, it has 140 pages and the language of the book is English.
“An Introduction to Quantum Computing Algorithms” Metadata:
- Title: ➤ An Introduction to Quantum Computing Algorithms
- Author: Arthur O. Pittenger
- Language: English
- Number of Pages: 140
- Publisher: Birkhäuser Boston
- Publish Date: 2000
- Publish Location: Boston, MA
“An Introduction to Quantum Computing Algorithms” Subjects and Themes:
- Subjects: Quantum theory - Mathematics - Computer science - Computer software
Edition Specifications:
- Format: [electronic resource] /
- Pagination: ➤ 1 online resource (xii, 140 p.)
Edition Identifiers:
- The Open Library ID: OL27047046M - OL19859205W
- Online Computer Library Center (OCLC) ID: 853258995
- ISBN-13: 9781461271277 - 9781461213901 - 9780817641276 - 9783764341275
- ISBN-10: 1461271274 - 1461213908
- All ISBNs: ➤ 1461271274 - 1461213908 - 9781461271277 - 9781461213901 - 9780817641276 - 9783764341275
AI-generated Review of “An Introduction to Quantum Computing Algorithms”:
"An Introduction to Quantum Computing Algorithms" Description:
The Open Library:
The purpose of this monograph is to provide the mathematically literate reader with an accessible introduction to the theory of quantum computing algorithms, one component of a fascinating and rapidly developing area which involves topics from physics, mathematics, and computer science. The author briefly describes the historical context of quantum computing and provides the motivation, notation, and assumptions appropriate for quantum statics, a non-dynamical, finite dimensional model of quantum mechanics. This model is then used to define and illustrate quantum logic gates and representative subroutines required for quantum algorithms. A discussion of the basic algorithms of Simon and of Deutsch and Jozsa sets the stage for the presentation of Grover's search algorithm and Shor's factoring algorithm, key algorithms which crystallized interest in the practicality of quantum computers. A group theoretic abstraction of Shor's algorithms completes the discussion of algorithms. The last third of the book briefly elaborates the need for error- correction capabilities and then traces the theory of quantum error- correcting codes from the earliest examples to an abstract formulation in Hilbert space. This text is a good self-contained introductory resource for newcomers to the field of quantum computing algorithms, as well as a useful self-study guide for the more specialized scientist, mathematician, graduate student, or engineer. Readers interested in following the ongoing developments of quantum algorithms will benefit particularly from this presentation of the notation and basic theory.
Read “An Introduction to Quantum Computing Algorithms”:
Read “An Introduction to Quantum Computing Algorithms” by choosing from the options below.
Search for “An Introduction to Quantum Computing Algorithms” downloads:
Visit our Downloads Search page to see if downloads are available.
Find “An Introduction to Quantum Computing Algorithms” in Libraries Near You:
Read or borrow “An Introduction to Quantum Computing Algorithms” from your local library.
- The WorldCat Libraries Catalog: Find a copy of “An Introduction to Quantum Computing Algorithms” at a library near you.
Buy “An Introduction to Quantum Computing Algorithms” online:
Shop for “An Introduction to Quantum Computing Algorithms” on popular online marketplaces.
- Ebay: New and used books.