Mapping, Programmability and Scalability of Problems for Quantum Speed-up
Date
2003
Authors
Krishnamurthy, E.Vikram
Journal Title
Journal ISSN
Volume Title
Publisher
World Scientific Publishing Company
Abstract
This paper explores the reasons as to why the quantum paradigm is not so easy to extend to all of the classical computational algorithms. We also explain the failure of programmability and scalability in quantum speed-up. Due to the presence of quantum entropy, quantum algorithm cannot obviate the curse of dimensionality encountered in solving many complex numerical and optimization problems. Finally, the stringent condition that quantum computers have to be interaction-free, leave them with little versatility and practical utility.
Description
Keywords
Keywords: Ackermann's function; Decoherence free space; Harmonic oscillator; Number phase relation; Primitives for quantum algorithms; Programmability; Quantum entropy; Scalability
Citation
Collections
Source
International Journal of Modern Physics C: Physics and Computers
Type
Journal article