TY - JOUR
T1 - Mapping, programmability and scalability of problems for quantum speed-up
AU - Krishnamurthy, E. V.
PY - 2003/6
Y1 - 2003/6
N2 - 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.
AB - 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.
KW - Ackermann's function
KW - Decoherence free space
KW - Harmonic oscillator
KW - Number phase relation
KW - Primitives for quantum algorithms
KW - Programmability
KW - Quantum entropy
KW - Scalability
UR - http://www.scopus.com/inward/record.url?scp=0348219130&partnerID=8YFLogxK
U2 - 10.1142/S0129183103004772
DO - 10.1142/S0129183103004772
M3 - Article
SN - 0129-1831
VL - 14
SP - 587
EP - 600
JO - International Journal of Modern Physics C
JF - International Journal of Modern Physics C
IS - 5
ER -