相关论文: The quantum measurement problem and physical reali…

Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum…

The topical quantum computation paradigm is a transposition of the Turing machine into the quantum framework. Implementations based on this paradigm have limitations as to the number of: qubits, computation steps, efficient quantum…

We present a panoramic view on various attempts to "solve" the problems of quantum measurement and macro-objectivation, i.e. of the transition from a probabilistic quantum mechanic microscopic world to a deterministic classical macroscopic…

According to the Church-Turing Thesis (CTT), effective formal behaviours can be simulated by Turing machines; this has naturally led to speculation that physical systems can also be simulated computationally. But is this wider claim true,…

The familiar theories of physics have the feature that the application of the theory to make predictions in specific circumstances can be done by means of an algorithm. We propose a more precise formulation of this feature --- one based on…

Ultimately, any explanation of quantum measurement must be extendable to relativistic quantum mechanics (RQM), since many precisely confirmed experimental results follow from quantum field theory (QFT), which is based on RQM. Certainly, the…

A long-standing quantum-mechanical puzzle is whether the collapse of the wave function is a real physical process or simply an epiphenomenon. This puzzle lies at the heart of the measurement problem. One way to choose between the…

In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…

When one takes into account gravitation, the measurement of space and time cannot be carried out with infinite accuracy. When quantum mechanics is reformulated taking into account this lack of accuracy, the resolution of the measurement…

Heisenberg's uncertainty principle states that it is not possible to compute both the position and momentum of an electron with absolute certainty. However, this computational limitation, which is central to quantum mechanics, has no…

I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coincides with a classical complexity class called PP, or Probabilistic…

The usual conjectures of quantum measurements approaches, inspired from the traditional interpretation of Heisenberg's ("uncertainty") relations, are proved as being incorrect. A group of reconsidered conjectures and a corresponding new…

The question whether quantum measurements reflect some underlying objective reality has no generally accepted answer. We show that description of such reality is possible under natural conditions such as linearity and causality, although in…

We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running…

Many attempts have been made to characterise and solve the infamous measurement problem of quantum mechanics by advocating, implicitly or explicitly, different realist perspectives. As a result, we are still uncertain where this problem and…

In this work we analyze the deep link between the 20th Century positivist re-foundation of physics and the famous measurement problem of quantum mechanics. We attempt to show why this is not an "obvious" nor "self evident" problem for the…

The quantum reality problem is that of finding a mathematically precise definition of a sample space of configurations of beables, events, histories, paths, or other mathematical objects, and a corresponding probability distribution, for…

Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…

I. The arena of quantum mechanics and quantum field theory is the abstract, unobserved and unobservable, M-dimensional formal Hilbert space [not equal to] spacetime. II. The arena of observations and, more generally, of all events (i.e.…

So far, none of attempts to quantize gravity has led to a satisfactory model that not only describe gravity in the realm of a quantum world, but also its relation to elementary particles and other fundamental forces. Here, we outline the…