Quantum Walks for Computer Scientists / by Salvador Venegas-Andraca
By: Venegas-Andraca, Salvador Elías, autor
Material type:
E-bookSeries: (Synthesis Lectures on Quantum Computing, 1945-9734).Publisher: Cham : Springer International Publishing, 2008Edition: 1st edition 2008.Description: 1 recurso en línea (XIV, 119 páginas).ISBN: 9783031025112.Subject: Ordenadores cuánticos
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
LIBRO-E NO PRÉSTAMO
|
Madrid Digital Acceso Electrónico (UEM) | Ciencias e Ingeniería | QA76.889 2008 EB (Browse shelf(Opens below)) | Acceso electrónico | eBook.01112760 |
Browsing Madrid Digital shelves, Shelving location: Acceso Electrónico (UEM) Close shelf browser (Hides shelf browser)
| QA76.887 2011 EB Storing Clocked Programs Inside DNA : A Simplifying Framework for Nanocomputing | QA76.889 2000 EB The Physics of Quantum Information : Quantum Cryptography, Quantum Teleportation, Quantum Computation | QA76.889 2008 EB Quantum Computer Science | QA76.889 2008 EB Quantum Walks for Computer Scientists | QA76.889 2010 EB The Complexity of Noise : A Philosophical Outlook on Quantum Error Correction | QA76.889 2011 EB Quantum Computing for Computer Architects | QA76.889 2012 EB High Level Structures for Quantum Computing |
Introduction -- Quantum Mechanics -- Theory of Computation -- Classical Random Walks -- Quantum Walks -- Computer Science and Quantum Walks -- Conclusions.
Quantum computation, one of the latest joint ventures between physics and the theory of computation, is a scientific field whose main goals include the development of hardware and algorithms based on the quantum mechanical properties of those physical systems used to implement such algorithms. Solving difficult tasks (for example, the Satisfiability Problem and other NP-complete problems) requires the development of sophisticated algorithms, many ofwhich employ stochastic processes as their mathematical basis. Discrete random walks are a popular choice among those stochastic processes. Inspired on the success of discrete random walks in algorithm development, quantum walks, an emerging field of quantum computation, is a generalization of random walks into the quantum mechanical world. The purpose of this lecture is to provide a concise yet comprehensive introduction to quantum walks. Table of Contents: Introduction / Quantum Mechanics / Theory of Computation / Classical Random Walks / Quantum Walks / Computer Science and Quantum Walks / Conclusions.
There are no comments on this title.