This is an outdated version published on 2019-11-03. Read the most recent version.
Preprint
/
Version 2
On A Quantum Proof Of The Equivalence of P And NP
DOI:
https://doi.org/10.31224/osf.io/8ht2mKeywords:
3 satisfiability, calabi yau manifold, np completeness, p = np, p vs np, quantum computation, quantum engineering, quantum information scienceAbstract
We present an algorithm, along with a correctness proof, for solving the 3 Satisfiability problem that is inspired by quantum mechanical principles and that runs in polynomial time with respect to the size of the input problem. Even though we term both our algorithm and its associated proof as quantum (for reasons which we will demonstrate), it is intended to be run on standard classical architecture. In the article, we posit that the 3 Satisfiability problem has an intrinsic complex quantum form that can be programmed in order to build a model of the solution space for satisfiable instances or show that such a model cannot be constructed. This yields surprising results on the ability for classical systems to abstractly simulate general quantum systems.Downloads
Download data is not yet available.
Downloads
Posted
2019-11-03 — Updated on 2019-11-03
Versions
- 2019-11-03 (5)
- 2019-11-03 (4)
- 2019-11-03 (3)
- 2019-11-03 (2)
- 2019-11-03 (1)