Related papers: The P versus NP Problem in Quantum Physics
In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…
This article finds the answer to the question: for any problem from which a non-deterministic algorithm can be derived which verifies whether an answer is correct or not in polynomial time (complexity class NP), is it possible to create an…
The relationship between the complexity classes P and NP is an unsolved question in the field of theoretical computer science. In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic"…
We study the quadratic residue problem known as an NP complete problem by way of the prime number and show that a nondeterministic polynomial process does not belong to the class P because of a random distribution of solutions for the…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
NP complete problem is one of the most challenging issues. The question of whether all problems in NP are also in P is generally considered one of the most important open questions in mathematics and theoretical computer science as it has…
Can the computational complexity theory of computer science and mathematics say something new about unresolved problems in quantum physics? Particularly, can the P versus NP question in the computational complexity theory be a factor in the…
Quantum computers are widely believed have an advantage over classical computers, and some have even published some empirical evidence that this is the case. However, these publications do not include a rigorous proof of this advantage,…
In this paper we discusses the relationship between the known classes P and NP. We show that the difficulties in solving problem "P versus NP" have methodological in nature. An algorithm for solving any problem is sensitive to even small…
The notion of "closed systems" in Quantum Mechanics is discussed. For this purpose, we study two models of a quantum-mechanical system $P$ spatially far separated from the "rest of the universe" $Q$. Under reasonable assumptions on the…
An approach is presented treating decision theory as a probabilistic theory based on quantum techniques. Accurate definitions are given and thorough analysis is accomplished for the quantum probabilities describing the choice between…
This paper considers the question of P = NP in context of the polynomial time SAT algorithm. It posits proposition dependent on existence of conjectured problem that even where the algorithm is shown to solve SAT in polynomial time it…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
We present a brief non-technical introduction to the standing discussion on the relation between Quantum Mechanics and Determinism. Quantum Mechanics inherent randomness in the measurement process is sometimes presented as a door to explain…
The mathematical representation of the physical objects determines which mathematical branch will be applied during the physical analysis in the systems studied. The difference among non-quantum physics, like classic or relativistic…
A suitable unified statistical formulation of quantum and classical mechanics in a *-algebraic setting leads us to conclude that information itself is noncommutative in quantum mechanics. Specifically we refer here to an observer's…
The mind-body problem is reviewed in the context of a non-technical account of quantum information theory. The importance of clearly defining: `what is physical?' is highlighted, since only then can we give meaning to the concept…
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts deterministic and probabilistic algorithms, propositions of…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…