Quantum Computing

Mika Hirvensalo - Collection Natural Computing Series

214 pages, parution le 17/12/2003 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

This book is devoted to quantum computing, a new, multidisciplinary research area crossing quantum mechanics, theoretical computer science and mathematics. It contains an introduction to quantum computing as well as the most important recent results on the topic. Two famous algorithms, fast factorization and Grover search, are presented in separate chapters because these inventions are important structurally and developmentally. The presentation of the topic is uniform and computer science-oriented. Thus, the book differs from most of the previous ones which are mainly physics-oriented. The special style of presentation makes the theory of quantum computing accessible to a larger audience, including also the mathematics-oriented oriented readers. Many examples and exercises ease the understanding. In this edition new perspectives on quantum information have been added, and numerous corrections, amendments and extensions have been incorporated throughout the text.

Written for:
Scientists, researchers, practitioners, and graduate students

Introduction
Quantum Information
Devices for Computation
Fast Factorization
Finding the Hidden Subgroup
Grover's Search Algorithm
Complexity Lower Bounds for Quantum Circuits

Appendix A: Quantum Physics
Appendix B: Mathematical Background
References
Index

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Mika Hirvensalo
Collection	Natural Computing Series
Parution	17/12/2003
Édition	2^eme édition
Nb. de pages	214
Format	16 x 24
Couverture	Relié
Poids	460g
Intérieur	Noir et Blanc
EAN13	9783540407041