Quantum computer science
Our rough guess is there are 27,000 words in this book.
At a pace averaging 250 words per minute, this book will take 1 hours and 48 minutes to read. With a half hour per day, this will take 4 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Uhlmann, Jeffrey K. - Contributor
Publication
2009 - Morgan & Claypool Publishers, San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA), California
Language
English
Word Count
27,000 words, Guess
Page Count
108 pages
Physical Format
Electronic resource
Identifiers
- Internet Archivelightscatteringf1998lanz
- Internet Archivequantumcomputers00lanz
- ISBN-139781598297331
- ISBN-139781598297324
- ISBN-101598297333
and 7 more
- ISBN-101598297325
- OCLC Control Number270769971
- OCLC Control Number228425553
- Better World Books9781598297324
- Better World Books9781598297331
- Better World BooksKT-779-758
- Open LibraryOL25537639M
Classifications
- DDC004.1
- LCCQA76.889 .L256 2009
- LCCQA76.889 .L35 2009
Alternate Titles
- Synthesis digital library of engineering and computer science.
Description
In this text we present a technical overview of the emerging field of quantum computation along with new research results by the authors.What distinguishes our presentation from that of others is our focus on the relationship between quantum computation and computer science. Specifically, our emphasis is on the computational model of quantum computing rather than on the engineering issues associated with its physical implementation.We adopt this approach for the same reason that a book on computer programming doesn't cover the theory and physical realization of semiconductors. Another distinguishing feature of this text is our detailed discussion of the circuit complexity of quantum algorithms. To the extent possible we have presented the material in a form that is accessible to the computer scientist, but in many cases we retain the conventional physics notation so that the reader will also be able to consult the relevant quantum computing literature. Although we expect the reader to have a solid understanding of linear algebra, we do not assume a background in physics. This text is based on lectures given as short courses and invited presentations around the world, and it has been used as the primary text for a graduate course at George Mason University. In all these cases our challenge has been the same: how to present to a general audience a concise introduction to the algorithmic structure and applications of quantum computing on an extremely short period of time. The feedback from these courses and presentations has greatly aided in making our exposition of challenging concepts more accessible to a general audience.
Subjects
Series Statement
- Synthesis lectures on quantum computing -- # 2
Other Editions
- Quantum computer science
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!