Skip navigation
Skip navigation

Computational Power of Quantum Machines, Quantum Grammars and Feasible Computation

Krishnamurthy, E.Vikram

Description

This paper studies the computational power of quantum computers to explore as to whether they can recognize properties which are in nondeterministic polynomial-time class (NP) and beyond. To study the computational power, we use the Feynman's path integral (FPI) formulation of quantum mechanics. From a computational point of view the Feynman's path integral computes a quantum dynamical analogue of the k-ary relation computed by an Alternating Turing machine (ATM) using AND-OR Parallelism....[Show more]

CollectionsANU Research Publications
Date published: 1999
Type: Journal article
URI: http://hdl.handle.net/1885/93881
Source: International Journal of Modern Physics C: Physics and Computers

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:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator