Related papers: BQP_p = PP for integer p > 2
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,…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
Some representation-theoretic multiplicities, such as the Kostka and the Littlewood-Richardson coefficients, admit a combinatorial interpretation that places their computation in the complexity class #P. Whether this holds more generally is…
The major conceptual difficulties of quantum mechanics are analyzed. They are: the notion "wave-particle", the probabilistic interpretation of the Schroedinger wave \psi-function and hence the probability amplitude and its phase, long-range…
A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in…
The common structure of the space of pure states $P$ of a classical or a quantum mechanical system is that of a Poisson space with a transition probability. This is a topological space equipped with a Poisson structure, as well as with a…
Some of the problems connected with the interpretation of quantum mechanics are enumerated, in particular those related to some well known paradoxes and, above all, to the measurement process. We then show how the so called "Physics…
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…
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…
"Ever since the advent of modern quantum mechanics in the late 1920's, the idea has been prevalent that the classical laws of probability cease, in some sense, to be valid in the new theory. [...] The primary object of this presentation is…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
Quantum physics, despite its observables being intrinsically of a probabilistic nature, does not have a quantum entropy assigned to them. We propose a quantum entropy that quantify the randomness of a pure quantum state via a conjugate pair…
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision. Here we study a…
Quantum Mechanics lacks an intuitive interpretation, which is the cause of a generally formalistic approach to its use. This in turn has led to a certain insensitivity to the actual meaning of many words used in its description and…
We suggest an interpretation of quantum mechanics, inspired by the ideas of Aharonov et al. of a time-symmetric description of quantum theory. We show that a special final boundary condition for the Universe, may be consistently defined as…
We introduce a new way of quantifying the degrees of incompatibility of two ob- servables in a probabilistic physical theory and, based on this, a global measure of the degree of incompatibility inherent in such theories, across all…
This paper argues that the requirement of applicableness of quantum linearity to any physical level from molecules and atoms to the level of macroscopic extensional world, which leads to a main foundational problem in quantum theory…
Quantum theory is formulated as the uniquely consistent way to manipulate probability amplitudes. The crucial ingredient is a consistency constraint: if the amplitude of a quantum process can be computed in two different ways, the two…
An extension of the Born rule, the {\it quantum typicality rule}, has recently been proposed [B. Galvan: Found. Phys. 37, 1540-1562 (2007)]. Roughly speaking, this rule states that if the wave function of a particle is split into…
We attempt to contribute some novel points of view to the "foundations of quantum mechanics", using mathematical tools from "quantum probability theory" (such as the theory of operator algebras). We first introduce an abstract algebraic…