Quantum Computer Science

Quantum Computer Science

Marco Lanzagorta, Jeffrey Uhlmann
ISBN: 9781598297324 | PDF ISBN: 9781598297331
Copyright © 2008 | 124 Pages | Publication Date: 01/01/2008

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00159ED1V01Y200810QMC002

Ordering Options: Paperback $30.00   E-book $24.00   Paperback & E-book Combo $37.50

Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:

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

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

About the Author(s)

Marco Lanzagorta, ITT Corporation
Dr. Marco Lanzagorta is Technical Fellow and Senior Principal Scientist at the Advanced Engineering and Sciences Division of ITT Corporation, a scientific consultant for a project for the US Naval Research Laboratory in Washington, DC, and an Affiliate Associate Professor at the Center for Quantum Studies of George Mason University in Fairfax, VA. In addition, Dr. Lanzagorta is co-editor of the Synthesis Lectures on Quantum Computing published by Morgan and Claypool. Dr. Lanzagorta received a PhD in Theoretical Physics from the University of Oxford, UK, and in the past he worked at the European Organization for Nuclear Research (CERN) in Switzerland and the International Centre for Theoretical Physics (ICTP) in Italy.

Jeffrey Uhlmann, University of Missouri-Columbia
Dr. Uhlmann is a leading researcher in the theory of stochastic tracking and control. He is currently a professor at the University of Missouri-Columbia after working for 12 years at the Naval Research Laboratory in Washington, DC. He has a bachelors degree in philosophy, a masters in computer science, and a doctorate in robotics from the University of Oxford in England. Dr. Uhlmann is also a scholar of cult and B-movies, especially of the lucha and kaiju genres.

Related Series

Computer Architecture

Browse by Subject
ACM Books
IOP Concise Physics
0 items

Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: