Related papers: The quantum measurement problem and physical reali…
The Schrodinger equation is incomplete, inherently unable to explain the collapse of the wavefunction caused by measurement; a fundamental issue known as the quantum measurement problem. Quantum mechanics is generally constrained by the…
Quantum theory's irreducible empirical core is a probability calculus. While it presupposes the events to which (and on the basis of which) it serves to assign probabilities, and therefore cannot account for their occurrence, it has to be…
With nowadays steadily growing quantum processors, it is required to develop new quantum tomography tools that are tailored for high-dimensional systems. In this work, we describe such a computational tool, based on recent ideas from…
When we want to predict the future, we compute it from what we know about the present. Specifically, we take a mathematical representation of observed reality, plug it into some dynamical equations, and then map the time-evolved result back…
Quantum computers are expected to revolutionize our ability to process information. The advancement from classical to quantum computing is a product of our advancement from classical to quantum physics -- the more our understanding of the…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
Endeavoring to formulate an exhaustive solution to the measurement problem in view of the theory of decoherence leads to a better understanding of the status of the collapse and of the emergence of classicality, thanks to a precise…
Realist, no-collapse interpretations of quantum mechanics, such as Everett's, face the probability problem: how to justify the norm-squared (Born) rule from the wavefunction alone. While any basis-independent measure can only be…
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation…
The paper gives a systematic review of the basic ideas of (non-relativistic) quantum mechanics including all changes that result from previous work of the authors. This shows that the new theory is self-consistent and (in certain sense)…
Quantum sensing is commonly described as a constrained optimization problem: maximize the information gained about an unknown quantity using a limited number of particles. Important sensors including gravitational-wave interferometers and…
Inspired by the work of Feynman, Deutsch, We formally propose the theory of physical computability and accordingly, the physical complexity theory. To achieve this, a framework that can evaluate almost all forms of computation using various…
General relativity treats spacetime as dynamical and exhibits its breakdown at singularities. This failure is interpreted as evidence that quantum gravity is not a theory formulated within spacetime; instead, it must explain the very…
We pose the following question: If a physical experiment were to be completely controlled by an algorithm, what effect would the algorithm have on the physical measurements made possible by the experiment? In a programme to study the nature…
We show that one may interpret physical reality as random fields in space-time. These have a probability given by the expectation of a coherent state projection operator, called the Q-function. The resulting dynamical evolution includes…
Despite the unparalleled accuracy of quantum-theoretical predictions across an enormous range of phenomena, the theory's foundations are still in doubt. The theory deviates radically from classical physics, predicts counterintuitive…
The discovery of an algorithm for factoring which runs in polynomial time on a quantum computer has given rise to a concerted effort to understand the principles, advantages, and limitations of quantum computing. At the same time, many…
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…
There are four reasons why our present knowledge and understanding of quantum mechanics could be regarded as incomplete. Firstly, the principle of linear superposition has not been experimentally tested for position eigenstates of objects…
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…