Related papers: The P versus NP Problem in Quantum Physics
Quantum mechanics---the theory describing the fundamental workings of nature---is famously counterintuitive: it predicts that a particle can be in two places at the same time, and that two remote particles can be inextricably and…
The problem of the determinism of Quantum Mechanics has been a main one during the 20th century. At the same time, in the context of Logic and Set Theory, the importance of ancient paradoxes as well as the appearance of many new ones, has…
The words: determinism, hidden variables, subjectivism, information, objectivism, informational-theoretic axioms,observers have some connection with physical reality? What we mean with "description" of physical reality? When we say that we…
Experimental studies of infinite (unrestricted at least in one direction) quantum particle motion using probe nanotechnologies have revealed the necessity of revising previous concepts of their motion. Particularly, quantum particles…
Physics is a model of nature able to both describe and predict the results of measurements made with respect to reference systems. These reference systems, in turn, are themselves physical and thus subject to the laws of physics. The…
The question of what ontological message (if any) is encoded in the formalism of contemporary physics is, to say the least, controversial. The reasons for this state of affairs are psychological and neurobiological. The processes by which…
The notion of nondeterminism has disappeared from the current definition of NP, which has led to ambiguities in understanding NP, and caused fundamental difficulties in studying the relation P versus NP. In this paper, we question the…
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill,…
We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We…
Quantum mechanics, one of the most successful theories in the history of science, was created to account for physical systems not describable by classical physics. Though it is consistent with all experiments conducted thus far, many of its…
This chapter delves into the realm of computational complexity, exploring the world of challenging combinatorial problems and their ties with statistical physics. Our exploration starts by delving deep into the foundations of combinatorial…
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…
Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model…
It is usually stated that quantum mechanics presents problems with the identity of particles, the most radical position -supported by E. Schrodinger- asserting that elementary particles are not individuals. But the subject goes deeper, and…
Process Physics models reality as self-organising relational or semantic information using a self-referentially limited neural network model. This generalises the traditional non-process syntactical modelling of reality by taking account of…
A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.
I dissent from the standard assertion of a "Two Times Problem," in which physical time is taken as being at odds with the human sense of a "flow of time." I provide a brief overview of the case to be made for the contrary view: namely, that…
Historically, appearance of the quantum theory led to a prevailing view that Nature is indeterministic. The arguments for the indeterminism and proposals for indeterministic and deterministic approaches are reviewed. These include collapse…