Related papers: BQP_p = PP for integer p > 2
The status of locality in quantum mechanics is analyzed from a nonstandard point of view. It is assumed that quantum states are relative, they depend on and are defined with respect to some bigger physical system which contains the former…
A celebrated important result due to Freedman, Larsen and Wang states that providing additive approximations of the Jones polynomial at the k'th root of unity, for constant k=5 and k>6, is BQP-hard. Together with the algorithmic results of…
It can be argued that the ordinary description of the reversible quantum process between two one-to-one correlated measurement outcomes is incomplete because, by not specifying the direction of causality, it allows causal structures that…
We propose an experiment that allows one to test the Einstein's intuitive objection to Bohr's quantum mechanics (QM), which was that if QM is correct, then there should be a nonlocality related to the collapse of a single-particle…
We consider the problem of gambling on a quantum experiment and enforce rational behaviour by a few rules. These rules yield, in the classical case, the Bayesian theory of probability via duality theorems. In our quantum setting, they yield…
In this paper Quantum Mechanics with Fundamental Length is chosen as Quantum Mechanics at Planck's scale. This is possible due to the presence in the theory of General Uncertainty Relations. Here Quantum Mechanics with Fundamental Length is…
Supersymmetric and parasupersymmetric quantum mechanics are now recognized as two further parts of quantum mechanics containing a lot of new informations enlightening (solvable) physical applications. Both contents are here analysed in…
We define an index of compatibility for a probabilistic theory (PT). Quantum mechanics with index 0 and classical probability theory with index 1 are at the two extremes. In this way, quantum mechanics is at least as incompatible as any PT.…
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…
Despite its enormous empirical success, the formalism of quantum theory still raises fundamental questions: why is nature described in terms of complex Hilbert spaces, and what modifications of it could we reasonably expect to find in some…
Motivated by the result that an `approximate' evaluation of the Jones polynomial of a braid at a $5^{th}$ root of unity can be used to simulate the quantum part of any algorithm in the quantum complexity class BQP, and results relating BQP…
Quantum physics is surprising in many ways. One surprise is the threat to locality implied by Bell's Theorem. Another surprise is the capacity of quantum computation, which poses a threat to the complexity-theoretic Church-Turing thesis. In…
Here we continue with the ideas expressed in "On the strangeness of quantum mechanics" aiming to demonstrate more concretely how this philosophical outlook might be used as a key for resolving the measurement problem. We will address in…
We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g. Grover's algorithm does not fall into this class). Our…
We prove that P = NP implies #P = FP by exploiting the topological structure of 3SAT solution spaces. The argument proceeds via a dichotomy: any polynomial-time algorithm for 3SAT either operates without global knowledge of the…
We consider the quantum complexity of computing Schatten $p$-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation. We show that the problem of…
Instantaneous quantum polynomial-time (IQP) computation is a class of quantum computation consisting only of commuting two-qubit gates and is not universal in the sense of standard quantum computation. Nevertheless, it has been shown that…
A common understanding of quantum mechanics (QM) among students and practical users is often plagued by a number of "myths", that is, widely accepted claims on which there is not really a general consensus among experts in foundations of…
We consider random operators $\Omega \to \mathcal{L}(\ell_p, \ell_p)$ for some $1 \leqslant p < \infty$. The law of large numbers is known in the case $p=2$ in the form of usual law of large numbers. Instead of sum of i.i.d. variables there…
We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…