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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Book by A Yu Kitaev A H Shen M N Vyalyi
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 16,92 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiEUR 11,49 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Better World Books, Mishawaka, IN, U.S.A.
Condizione: Very Good. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 52678733-6
Quantità: 1 disponibili
Da: San Francisco Book Company, Paris, Francia
Paperback. Condizione: Very good. Paperback Small Quarto. wraps, 257 pp Standard shipping (no tracking or insurance) / Priority (with tracking) / Custom quote for large or heavy orders. Codice articolo 103838
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: As New. Unread book in perfect condition. Codice articolo 2431563
Quantità: 1 disponibili
Da: Antiquariat Bernhardt, Kassel, Germania
kartoniert. Condizione: Sehr gut. Zust: Gutes Exemplar. 257 Seiten, mit Abbildungen, Englisch 470g. Codice articolo 494377
Quantità: 1 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. uk ed. edition. 272 pages. 10.25x7.25x0.50 inches. In Stock. Codice articolo 0821832298
Quantità: 1 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: New. 2002. Paperback. 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. Series: Graduate Studies in Mathematics. Num Pages: 272 pages, Illustrations. BIC Classification: PBW; PHQ; UYA. Category: (P) Professional & Vocational. Dimension: 254 x 177 x 13. Weight in Grams: 478. . . . . . Codice articolo V9780821832295
Quantità: 1 disponibili
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo FW-9780821832295
Quantità: 4 disponibili
Da: moluna, Greven, Germania
Condizione: New. 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 comple. Codice articolo 694071545
Quantità: 4 disponibili
Da: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condizione: Good. UK ed. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Codice articolo 0821832298-11-1
Quantità: 1 disponibili
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 2431563-n
Quantità: 1 disponibili