On Some Aspects of Quantum Computational Models

弘忠 小林

Peter P. Rohde

RW Boyer

Reviews Penrose’s three-realm model, Hameroff and Penrose’s ‘Orch-OR’ theory, Tegmark’s levels of the computational/mathematical multiverse model, Davies’ three-level model of matter-laws of nature-information, Stapp’s three-aspect model of local physical, ‘experiental reality,’ and Hilbert space; Bohm and Hiley’s three-level model of explicate, implicate, and super-implicate orders, Hagelin’s three-aspect mathematical model of quantum mechanical states, quantum mechanical observables, and Hilbert space; and how all these models are progressing toward the holistic Vedic 3-in-1 model.

Mingsheng Ying

Tetsuro Nishino

V. Černý

In this paper we discuss physical aspects of intractable (NP-complete) computing problems. We show, using a specific model, that a quantum-mechanical computer can in principle solve an NP-complete problem in polynomial time; however, it would use an exponentially large energy for that computation. We conjecture that our model reflects a complementarity principle concerning the time and the energy needed to perform an NP-complete computation.