Classical and Quantum Computation (Graduate Studies in Mathematics) - Image 1

£44.50

Oxford University Press Classical and Quantum Computation (Graduate Studies in Mathematics)

Name: Classical and Quantum Computation (Graduate Studies in Mathematics)
Brand: Oxford University Press
Price: 44.5 GBP
Availability: InStock

58222

Architecture & Microprocessors

Price History & Forecast

Last 22 days • 22 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 22 days • 1 price levels

Days at Price

Price Analysis

Most common price: £45 (22 days, 100.0%)

Price range: £45 - £45

Price levels: 1 different prices over 22 days

Description

This book is an introduction to a new rapidly developing theory of quantum computing. It begins with the basics of classical theory of computation: Turing machines, Boolean circuits, parallel algorithms, probabilistic computation, NP-complete problems, and the idea of complexity of an algorithm. The second part of the book provides an exposition of quantum computation theory. It starts with the introduction of general quantum formalism (pure states, density matrices, and superoperators), universal gate sets and approximation theorems. Then the authors study various 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).Rapid development of quantum computing started in 1994 with a stunning suggestion by Peter Shor to use quantum computation for factoring large numbers - an extremely difficult and time-consuming problem when using a conventional computer. Shor's result spawned a burst of activity in designing new algorithms and in attempting to actually build quantum computers. Currently, the progress is much more significant in the former: a sound theoretical basis of quantum computing is under development and many algorithms have been suggested.In this concise text, the authors provide solid foundations to the theory - in particular, a careful analysis of the quantum circuit model - and cover selected topics in depth. Included are a complete proof of the Solovay-Kitaev theorem with accurate algorithm complexity bounds, approximation of unitary operators by circuits of doubly logarithmic depth. Among other interesting topics are toric codes and their relation to the anyon approach to quantum computing. Prerequisites are very modest and include linear algebra, elements of group theory and probability, and the notion of a formal or an intuitive algorithm. This text is suitable for a course in quantum computation for graduate students in mathematics, physics, or computer science. More than 100 problems (most of them with complete solutions) and an appendix summarizing the necessary results are a very useful addition to the book. It is available in both hardcover and softcover editions.

Product Specifications

Brand: Oxford University Press
Model: 58222
Format: Paperback
ASIN: 0821832298
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 19 December 2002
Listed Since: 10 December 2006

Barcode

No barcode data available

Oxford University Press Classical and Quantum Computation (Graduate Studies in Mathematics)

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Quantum Computing: Foundations and Practice

Quantum Computer Science: An Introduction

Quantum Computing: Foundations and Practice

Fundamentals of Quantum Computing: Theory and Practice

Quantum Computation and Quantum Information: A Mathematical Perspective: 243 (Graduate Studies in Mathematics)

Mathematics of Quantum Computing: An Introduction

Mathematics of Quantum Computing: An Introduction

Fundamentals of Quantum Computing: Theory and Practice

Quantum Computing for Programmers

Quantum Computing Algorithms: Discover how a little math goes a long way

An Introduction to Quantum Computing Algorithms: 19 (Progress in Computer Science and Applied Logic, 19)

Quantum Computation (Advances in Applied Mathematics)

The Joy of Quantum Computing: A Concise Introduction

Explorations in Quantum Computing (Texts in Computer Science)

Introduction to Quantum Computing with Q# and QDK (Quantum Science and Technology)

Introduction to the Theory of Quantum Information Processing (Graduate Texts in Physics)

Quantum Computation: A Grand Mathematical Challenge for the Twenty-First Century and the Millennium (Proceedings of Symposia in Applied Mathematics)

Elements of Quantum Computation and Quantum Communication

Mathematics of Quantum Computation and Quantum Technology: 14 (Chapman & Hall/CRC Applied Mathematics and Nonlinear Science)

Dancing with Qubits: From qubits to algorithms, embark on the quantum computing journey shaping our future

Explorations in Quantum Computing (Texts in Computer Science)

Applied Quantum Cryptanalysis

Problems And Solutions In Quantum Computing And Quantum Information (4Th Edition)

The Theory of Open Quantum Systems