Classical and Quantum Computation

Valutazione media 4,14
( su 7 valutazioni fornite da GoodReads )
 
9780821832295: Classical and Quantum Computation

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Sinossi:

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.

I migliori risultati di ricerca su AbeBooks

Edizione Internazionale
Edizione Internazionale

1.

A. YU. KITAEV
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Quantità: 5
Edizione Internazionale
Da
firstbookstore
(New Delhi, India)
Valutazione libreria
[?]

Descrizione libro Condizione libro: Brand New. Brand New Paperback International Edition, Perfect Condition. Printed in English. Excellent Quality, Service and customer satisfaction guaranteed!. Codice libro della libreria AIND-33533

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 27,13
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: India a: U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

2.

A. Yu. Kitaev
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Quantità: 5
Edizione Internazionale
Da
EBOOKSTORE2010
(New Delhi, ND, India)
Valutazione libreria
[?]

Descrizione libro Condizione libro: Brand New. New. SoftCover International edition. Different ISBN and Cover image but contents are same as US edition. Customer Satisfaction guaranteed!!. Codice libro della libreria SHUB66840

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 27,41
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: India a: U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

3.

A. Yu. Kitaev
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Quantità: 5
Edizione Internazionale
Da
Bookshub
(Karol Bagh, India)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. New. International edition. Perfect condition. Ship by express service to USA, Canada, Australia, France, Italy, UK, Germany and Netherland. Customer satisfaction our priority. Codice libro della libreria ABE-FEB-66840

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 27,46
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: India a: U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

4.

A. YU. KITAEV
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Brossura Quantità: 5
Edizione Internazionale
Da
Romtrade Corp.
(STERLING HEIGHTS, MI, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. Brand New Paperback International Edition.We Ship to PO BOX Address also. EXPEDITED shipping option also available for faster delivery. Codice libro della libreria AUSBNEW-33533

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 29,56
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi
Edizione Internazionale
Edizione Internazionale

5.

A. Yu. Kitaev
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Brossura Quantità: 5
Edizione Internazionale
Da
Basi6 International
(Irving, TX, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: Brand New. New, SoftCover International edition. Different ISBN and Cover image but contents are same as US edition. Excellent Customer Service. Codice libro della libreria ABEUSA-66840

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 29,56
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

6.

A. Yu. Kitaev; A. H. Shen; M. N. Vyalyi
Editore: Amer Mathematical Society (2002)
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Paperback Quantità: > 20
Da
Sequitur Books
(Boonsboro, MD, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Amer Mathematical Society, 2002. Paperback. Condizione libro: New. Brand new. We distribute directly for the publisher. 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. Codice libro della libreria 1007140020

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 36,97
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 3,68
In U.S.A.
Destinazione, tempi e costi

7.

Kitaev; Shen; Vyalyi
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Quantità: 3
Da
BWB
(Valley Stream, NY, U.S.A.)
Valutazione libreria
[?]

Descrizione libro Condizione libro: New. Depending on your location, this item may ship from the US or UK. Codice libro della libreria 97808218322950000000

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 45,23
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
In U.S.A.
Destinazione, tempi e costi

8.

A. Yu Kitaev, H. Shen, M. N. Vyalyi
Editore: American Mathematical Society, United States (2002)
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Paperback Quantità: 1
Da
The Book Depository US
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro American Mathematical Society, United States, 2002. Paperback. Condizione libro: New. 249 x 175 mm. Language: English . Brand New Book. 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. Codice libro della libreria AAN9780821832295

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 46,87
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

9.

A. Yu Kitaev, H. Shen, M. N. Vyalyi
Editore: American Mathematical Society, United States (2002)
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Paperback Quantità: 1
Da
The Book Depository
(London, Regno Unito)
Valutazione libreria
[?]

Descrizione libro American Mathematical Society, United States, 2002. Paperback. Condizione libro: New. 249 x 175 mm. Language: English . Brand New Book. 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. Codice libro della libreria AAN9780821832295

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 46,89
Convertire valuta

Aggiungere al carrello

Spese di spedizione: GRATIS
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

10.

A. Yu Kitaev
Editore: American Mathematical Society (2002)
ISBN 10: 0821832298 ISBN 13: 9780821832295
Nuovi Quantità: 3
Da
Books2Anywhere
(Fairford, GLOS, Regno Unito)
Valutazione libreria
[?]

Descrizione libro American Mathematical Society, 2002. PAP. Condizione libro: New. New Book. Shipped from UK in 4 to 14 days. Established seller since 2000. Codice libro della libreria CE-9780821832295

Maggiori informazioni su questa libreria | Fare una domanda alla libreria

Compra nuovo
EUR 40,30
Convertire valuta

Aggiungere al carrello

Spese di spedizione: EUR 10,68
Da: Regno Unito a: U.S.A.
Destinazione, tempi e costi

Vedi altre copie di questo libro

Vedi tutti i risultati per questo libro