Classical and Quantum Computation (Paperback)

A. Yu. Kitaev

19 valoraciones de Goodreads

Idioma: inglés

Editorial: American Mathematical Society, Providence, 2002

0821832298 / 9780821832295

  • Tapa blanda
  • Nuevo
Ver todos los detalles

Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tapa blanda

Condición: Nuevo

EUR 160,28

Envío por EUR 32,98 
Se envía de Australia a Estados Unidos de America

Cantidad disponible: 1 disponible

Añadir al carrito
Devoluciones gratuitas de 30 días

Descripción del artículo del vendedor

Paperback. This book is an introduction to a new rapidly developing topic: the 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. Some of the results have not appeared elsewhere while others improve on existing works. 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. Presents an introduction to the theory of quantum computing. This book starts 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. It provides an exposition of quantum computation theory. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…

N° de ref. del artículo 9780821832295

Título
Classical and Quantum Computation (Paperback)
Autor
A. Yu. Kitaev
Editorial
American Mathematical Society, Providence
Año de publicación
2002
Estado
new
Encuadernación
Paperback
Idioma
inglés
ISBN 10
0821832298
ISBN 13
9780821832295

AussieBookSeller

Truganina, VIC, Australia

Vendedor de 5 estrellas

Vendedor de IberLibro desde 22 de junio de 2007

Tarifas de envío de Australia a Estados Unidos de America

ArtículoDe 25 a 45 días hábilesDe 8 a 14 días hábiles
Primer artículoEUR 32,98EUR 39,23
Los plazos de entrega los establecen los vendedores y varían según el transportista y la ubicación. Los pedidos que pasan por la aduana pueden sufrir retrasos y los compradores son responsables de los aranceles o tarifas asociadas. Los vendedores pueden ponerse en contacto con usted en relación con cargos adicionales para cubrir cualquier aumento en los costes de envío de los artículos.

Métodos de pago

  • Visa
  • Mastercard
  • American Express
  • Carte Bleue
  • Apple Pay
  • Google Pay

Información empresarial del vendedor

The Nile Group Pty Ltd

42 Apex Drive
Truganina, VIC Australia 3029