Mapping, programmability and scalability of problems for quantum speed-up

Krishnamurthy, E. V. (2003) Mapping, programmability and scalability of problems for quantum speed-up International Journal of Modern Physics C, 14 (5). pp. 587-600. ISSN 0129-1831

Full text not available from this repository.

Official URL: http://www.worldscinet.com/ijmpc/14/1405/S01291831...

Related URL: http://dx.doi.org/10.1142/S0129183103004772

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.

Item Type:Article
Source:Copyright of this article belongs to World Scientific Publishing Co Pte Ltd.
Keywords:Ackermann's Function; Decoherence Free Space; Harmonic Oscillator; Number Phase Relation; Primitives for Quantum Algorithms; Programmability; Quantum Entropy; Scalability
ID Code:28210
Deposited On:15 Dec 2010 12:24
Last Modified:04 Jun 2011 06:48

Repository Staff Only: item control page