Skip navigation
Skip navigation

Mapping, Programmability and Scalability of Problems for Quantum Speed-up

Krishnamurthy, E.Vikram

Description

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...[Show more]

CollectionsANU Research Publications
Date published: 2003
Type: Journal article
URI: http://hdl.handle.net/1885/86089
Source: International Journal of Modern Physics C: Physics and Computers
DOI: 10.1142/S0129183103004772

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  27 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator