MAPPING, PROGRAMMABILITY AND SCALABILITY OF PROBLEMS FOR QUANTUM SPEED-UP

E. V. Krishnamurthy
Additional contact information
E. V. Krishnamurthy: Computer Sciences Laboratory, Research School of Information Sciences and Engineering, Australian National University, Canberra, ACT 0200, Australia

International Journal of Modern Physics C (IJMPC), 2003, vol. 14, issue 05, 587-600

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.

Keywords: Ackermann's function; decoherence free space; harmonic oscillator; number phase relation; primitives for quantum algorithms; programmability; quantum entropy; scalability (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183103004772
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:14:y:2003:i:05:n:s0129183103004772

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183103004772

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().