连续不完全von Neumann测量假设下的NP-complete=P
An Inherently Quantum Computation Paradigm: NP-complete=P Under the Hypothetical Notion of Continuous Uncomplete von Neumann Measurement
摘要：
量子计算范式是图灵机到量子框架的一种转换。基于这种范式的实现在以下方面有限制：量子比特、计算步骤、有效的量子算法（到目前为止发现的）。基于连续不完全冯·诺依曼测量的推测性概念，提出了一种新的完全量子范式（没有经典范式）。在这样的概念下，NP完全等于P。这可以为搜索可实现的范例提供一个数学框架，可能利用粒子统计。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
