An Inherently Quantum Computation Paradigm: NP-complete=P Under the Hypothetical Notion of Continuous Uncomplete von Neumann Measurement
Quantum Physics
2007-05-23 v1
Abstract
The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum algorithms (found so far). A new exclusively quantum paradigm (with no classical counterpart) is propounded, based on the speculative notion of continuous uncomplete von Neumann measurement. Under such a notion, NP-complete is equal to P. This can provide a mathematical framework for the search of implementable paradigms, possibly exploiting particle statistics.
Keywords
Cite
@article{arxiv.quant-ph/9810017,
title = {An Inherently Quantum Computation Paradigm: NP-complete=P Under the Hypothetical Notion of Continuous Uncomplete von Neumann Measurement},
author = {Giuseppe Castagnoli},
journal= {arXiv preprint arXiv:quant-ph/9810017},
year = {2007}
}
Comments
1 figure. From the Quantum Computation and Communication Pathfinder Meeting in Helsinki (September 26-28, 1998) - extended version