Related papers: Solving the P/NP Problem under Intrinsic Uncertain…
Uncertainty relations (URs) like the Heisenberg-Robertson or the time-energy UR are often considered to be hallmarks of quantum theory. Here, a simple derivation of these URs is presented based on a single classical inequality from…
Heisenberg showed in the early days of quantum theory that the uncertainty principle follows as a direct consequence of the quantization of electromagnetic radiation in the form of photons. As we show here the gravitational interaction of…
For a simple set of observables we can express, in terms of transition probabilities alone, the Heisenberg Uncertainty Relations, so that they are proven to be not only necessary, but sufficient too, in order for the given observables to…
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the…
Recently it was shown in [New J. Phys. 8, 330 (2006)] that the three dimensional Heisenberg uncertainty principle might be signifficantly sharpened if the relevant quantum state describes the particle in a central potential. I extend that…
There's something really strange about quantum mechanics. It's not just that cats can be dead and alive at the same time, and that entanglement seems to violate the principle of locality; quantum mechanics seems to be what Aaronson calls…
As a compact representation of joint probability distributions over a dependence graph of random variables, and a tool for modelling and reasoning in the presence of uncertainty, Bayesian networks are of great importance for artificial…
This article was written for the Logic in Computer Science column in the February 2015 issue of the Bulletin of the European Association for Theoretical Computer Science. The intended audience is general computer science audience. The…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
We study a simplified Heisenberg spin model in order to clarify the idea of decoherence in closed quantum systems. For this purpose, we define a new concept: the decoherence function \Xi(t), which describes the dynamics of decoherence in…
In this paper, we make a preliminary interpretation of Cook's theorem presented in [1]. This interpretation reveals cognitive biases in the proof of Cook's theorem that arise from the attempt of constructing a formula in CNF to represent a…
Quantum theory is formulated as the only consistent way to manipulate probability amplitudes. The crucial ingredient is a consistency constraint: if there are two different ways to compute an amplitude the two answers must agree. This…
Since the particles such as molecules, atoms and nuclei are composite particles, it is important to recognize that physics must be invariant for the composite particles and their constituent particles, this requirement is called particle…
Matrix permanents arise naturally in the context of linear optical networks fed with nonclassical states of light. In this letter we tie the computational complexity of a class of multi-dimensional integrals to the permanents of large…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
Based on the doubly special relativity we find a new type of generalized uncertainty principle (GUP) where the coordinate remain unaltered at the high energy while the momentum is deformed at the high energy so that it may be bounded from…
The entropic formulation of the inertia and the gravity relies on quantum, geometrical and informational arguments. The fact that the results are completly classical is missleading. In this paper we argue that the entropic formulation…
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 P=?NP problem is philosophically solved by showing P is equal to NP in the random access with unit multiply (MRAM) model. It is shown that the MRAM model empirically best models computation hardness. The P=?NP problem is shown to be a…
The usual Heisenberg uncertainty relation for position and momentum may be replaced by an exact equality, for suitably chosen measures of position and momentum uncertainty. This "exact" uncertainty relation is valid for_all_ pure states,…