Cargando…
Quantum Walks for Computer Scientists
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. Solvi...
Autor principal: | |
---|---|
Lenguaje: | eng |
Publicado: |
Morgan & Claypool Publishers
2008
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1486477 |
_version_ | 1780926140051881984 |
---|---|
author | Venegas-Andraca, Salvador |
author_facet | Venegas-Andraca, Salvador |
author_sort | Venegas-Andraca, Salvador |
collection | CERN |
description | 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 of which employ stochastic processes as their mathematical basis. Discrete random walks are a popular choice among those stochastic processes. Inspir |
id | cern-1486477 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 2008 |
publisher | Morgan & Claypool Publishers |
record_format | invenio |
spelling | cern-14864772021-04-22T00:17:32Zhttp://cds.cern.ch/record/1486477engVenegas-Andraca, SalvadorQuantum Walks for Computer ScientistsComputing and ComputersQuantum 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 of which employ stochastic processes as their mathematical basis. Discrete random walks are a popular choice among those stochastic processes. InspirMorgan & Claypool Publishersoai:cds.cern.ch:14864772008 |
spellingShingle | Computing and Computers Venegas-Andraca, Salvador Quantum Walks for Computer Scientists |
title | Quantum Walks for Computer Scientists |
title_full | Quantum Walks for Computer Scientists |
title_fullStr | Quantum Walks for Computer Scientists |
title_full_unstemmed | Quantum Walks for Computer Scientists |
title_short | Quantum Walks for Computer Scientists |
title_sort | quantum walks for computer scientists |
topic | Computing and Computers |
url | http://cds.cern.ch/record/1486477 |
work_keys_str_mv | AT venegasandracasalvador quantumwalksforcomputerscientists |