The Complexity of Noise

Amit Hagar

ISBN 10: 3031013867 / ISBN 13: 9783031013867

Editore: Springer, Springer Jul 2010, 2010

Riguardo questo articolo

This item is printed on demand - Print on Demand Titel. Neuware -In quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the 'holy grail', and a worldwide quest for a large scale fault-tolerant, and computationally superior, quantum computer is currently taking place. Optimists rely on the premise that, under a certain threshold of errors, an arbitrary long fault-tolerant quantum computation can be achieved with only moderate (i.e., at most polynomial) overhead in computational cost. Pessimists, on the other hand, object that there are in principle (as opposed to merely technological) reasons why such machines are still inexistent, and that no matter what gadgets are used, large scale quantum computers will never be computationally superior to classical ones. Lacking a complete empirical characterization of quantum noise, the debate on the physical possibility of such machines invites philosophical scrutiny. Making this debate more precise by suggesting a novel statistical mechanical perspective thereof is the goal of this project.Table of Contents: Introduction / The Curse of the Open System / To Balance a Pencil on Its Tip / Universality at All Cost / CodaSpringer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 84 pp. Englisch.

Codice articolo 9783031013867

Dati bibliografici

• Titolo: The Complexity of Noise
• Editore: Springer, Springer Jul 2010
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 3031013867
• ISBN 13: 9783031013867
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 191 A x 6 P (millimetri) 235 millimetri di larghezza per 191 millimetri di altezza per 6 millimetri di profondità
• Peso: 176 grammi

Descrizione articolo

Riassunto

In quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the "holy grail", and a worldwide quest for a large scale fault-tolerant, and computationally superior, quantum computer is currently taking place. Optimists rely on the premise that, under a certain threshold of errors, an arbitrary long fault-tolerant quantum computation can be achieved with only moderate (i.e., at most polynomial) overhead in computational cost. Pessimists, on the other hand, object that there are in principle (as opposed to merely technological) reasons why such machines are still inexistent, and that no matter what gadgets are used, large scale quantum computers will never be computationally superior to classical ones. Lacking a complete empirical characterization of quantum noise, the debate on the physical possibility of such machines invites philosophical scrutiny. Making this debate more precise by suggesting a novel statistical mechanical perspective thereof is the goal of this project.Table of Contents: Introduction / The Curse of the Open System / To Balance a Pencil on Its Tip / Universality at All Cost / Coda

Informazioni sull'autore

Amit Hagar is a faculty member in the department of History and Philosophy of Science (HPS) at Indiana University, Bloomington (IN). Before coming to Bloomington he taught at the University of Delaware and was a research fellow at the University of Konstanz. He was born and educated in Israel, where he received a B.A. and M.A. in philosophy from the Hebrew University of Jerusalem. His Ph.D. thesis, entitled "Chance and Time" (2004), was written in Vancouver in the University of British Columbia and concerns the foundations of statistical physics. His main interests span the foundations of statistical and quantum mechanics, the philosophy of time, and the notion of physical computation, especially in the context of quantum information theory and quantum computing.