Quantum Computer Science

Author: N. David Mermin
Publisher: Cambridge University Press
ISBN: 9781139466806
Format: PDF, Docs
Download Now
In the 1990's it was realized that quantum physics has some spectacular applications in computer science. This book is a concise introduction to quantum computation, developing the basic elements of this new branch of computational theory without assuming any background in physics. It begins with an introduction to the quantum theory from a computer-science perspective. It illustrates the quantum-computational approach with several elementary examples of quantum speed-up, before moving to the major applications: Shor's factoring algorithm, Grover's search algorithm, and quantum error correction. The book is intended primarily for computer scientists who know nothing about quantum theory, but will also be of interest to physicists who want to learn the theory of quantum computation, and philosophers of science interested in quantum foundational issues. It evolved during six years of teaching the subject to undergraduates and graduate students in computer science, mathematics, engineering, and physics, at Cornell University.

An Introduction to Quantum Computing

Author: Phillip Kaye
Publisher: Oxford University Press
ISBN: 0198570007
Format: PDF, Docs
Download Now
The authors provide an introduction to quantum computing. Aimed at advanced undergraduate and beginning graduate students in these disciplines, this text is illustrated with diagrams and exercises.

Quantum Computing

Author: Eleanor G. Rieffel
Publisher: MIT Press
ISBN: 0262015064
Format: PDF, ePub
Download Now
A thorough exposition of quantum computing and the underlying concepts of quantum physics, with explanations of the relevant mathematics and numerous examples.

Quantum Computing Since Democritus

Author: Scott Aaronson
Publisher: Cambridge University Press
ISBN: 0521199565
Format: PDF, ePub, Docs
Download Now
Takes students and researchers on a tour through some of the deepest ideas of maths, computer science and physics.

An Introduction to Quantum Computing Algorithms

Author: Arthur O. Pittenger
Publisher: Springer Science & Business Media
ISBN: 1461213908
Format: PDF, ePub
Download Now
In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com puter. Since the difficulty of the factoring problem is crucial for the se curity of a public key encryption system, interest (and funding) in quan tum computing and quantum computation suddenly blossomed. Quan tum computing had arrived. The study of the role of quantum mechanics in the theory of computa tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.

Explorations in Quantum Computing

Author: Colin P. Williams
Publisher: Springer Science & Business Media
ISBN: 9781846288876
Format: PDF, Docs
Download Now
By the year 2020, the basic memory components of a computer will be the size of individual atoms. At such scales, the current theory of computation will become invalid. "Quantum computing" is reinventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality currently known. Remarkably, this theory predicts that quantum computers can perform certain tasks breathtakingly faster than classical computers – and, better yet, can accomplish mind-boggling feats such as teleporting information, breaking supposedly "unbreakable" codes, generating true random numbers, and communicating with messages that betray the presence of eavesdropping. This widely anticipated second edition of Explorations in Quantum Computing explains these burgeoning developments in simple terms, and describes the key technological hurdles that must be overcome to make quantum computers a reality. This easy-to-read, time-tested, and comprehensive textbook provides a fresh perspective on the capabilities of quantum computers, and supplies readers with the tools necessary to make their own foray into this exciting field. Topics and features: concludes each chapter with exercises and a summary of the material covered; provides an introduction to the basic mathematical formalism of quantum computing, and the quantum effects that can be harnessed for non-classical computation; discusses the concepts of quantum gates, entangling power, quantum circuits, quantum Fourier, wavelet, and cosine transforms, and quantum universality, computability, and complexity; examines the potential applications of quantum computers in areas such as search, code-breaking, solving NP-Complete problems, quantum simulation, quantum chemistry, and mathematics; investigates the uses of quantum information, including quantum teleportation, superdense coding, quantum data compression, quantum cloning, quantum negation, and quantum cryptography; reviews the advancements made towards practical quantum computers, covering developments in quantum error correction and avoidance, and alternative models of quantum computation. This text/reference is ideal for anyone wishing to learn more about this incredible, perhaps "ultimate," computer revolution. Dr. Colin P. Williams is Program Manager for Advanced Computing Paradigms at the NASA Jet Propulsion Laboratory, California Institute of Technology, and CEO of Xtreme Energetics, Inc. an advanced solar energy company. Dr. Williams has taught quantum computing and quantum information theory as an acting Associate Professor of Computer Science at Stanford University. He has spent over a decade inspiring and leading high technology teams and building business relationships with and Silicon Valley companies. Today his interests include terrestrial and Space-based power generation, quantum computing, cognitive computing, computational material design, visualization, artificial intelligence, evolutionary computing, and remote olfaction. He was formerly a Research Scientist at Xerox PARC and a Research Assistant to Prof. Stephen W. Hawking, Cambridge University.

Quantum Computing for Computer Scientists

Author: Noson S. Yanofsky
Publisher: Cambridge University Press
ISBN: 1139643908
Format: PDF, ePub, Mobi
Download Now
The multidisciplinary field of quantum computing strives to exploit some of the uncanny aspects of quantum mechanics to expand our computational horizons. Quantum Computing for Computer Scientists takes readers on a tour of this fascinating area of cutting-edge research. Written in an accessible yet rigorous fashion, this book employs ideas and techniques familiar to every student of computer science. The reader is not expected to have any advanced mathematics or physics background. After presenting the necessary prerequisites, the material is organized to look at different aspects of quantum computing from the specific standpoint of computer science. There are chapters on computer architecture, algorithms, programming languages, theoretical computer science, cryptography, information theory, and hardware. The text has step-by-step examples, more than two hundred exercises with solutions, and programming drills that bring the ideas of quantum computing alive for today's computer science students and researchers.

Quantum Computer Science

Author: Marco Lanzagorta
Publisher: Morgan & Claypool Publishers
ISBN: 1598297333
Format: PDF, ePub, Docs
Download Now
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 computingrather 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 graduatecourse at George Mason University. In all these cases our challenge has been the same: how to present to a generalaudience 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. Table of Contents: Introduction / The Algorithmic Structure of Quantum Computing / Advantages and Limitations of Quantum Computing / Amplitude Amplification / Case Study: Computational Geometry / The Quantum Fourier Transform / Case Study: The Hidden Subgroup / Circuit Complexity Analysis of Quantum Algorithms / Conclusions / Bibliography

Automatic Quantum Computer Programming

Author: Lee Spector
Publisher: Springer Science & Business Media
ISBN: 1402078951
Format: PDF, Docs
Download Now
Automatic Quantum Computer Programming provides an introduction to quantum computing for non-physicists, as well as an introduction to genetic programming for non-computer-scientists. The book explores several ways in which genetic programming can support automatic quantum computer programming and presents detailed descriptions of specific techniques, along with several examples of their human-competitive performance on specific problems. Source code for the author’s QGAME quantum computer simulator is included as an appendix, and pointers to additional online resources furnish the reader with an array of tools for automatic quantum computer programming.

Classical and Quantum Computation

Author: Alexei Yu. Kitaev
Publisher: American Mathematical Soc.
ISBN: 0821832298
Format: PDF, Kindle
Download Now
This book presents a concise introduction to an emerging and increasingly important topic, the theory of quantum computing. The development of quantum computing exploded in 1994 with the discovery of its use in factoring large numbers--an extremely difficult and time-consuming problem when using a conventional computer. In less than 300 pages, the authors set forth a solid foundation to the theory, including results that have not appeared elsewhere and improvements on existing works. The book starts with the basics of classical theory of computation, including NP-complete problems and the idea of complexity of an algorithm. Then the authors introduce general principles of quantum computing and pass to the study of main 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). This is a suitable textbook for a graduate course in quantum computing. Prerequisites are very modest and include linear algebra, elements of group theory and probability, and the notion of an algorithm (on a formal or an intuitive level). The book is complete with problems, solutions, and an appendix summarizing the necessary results from number theory.