Related papers: Quantum Suicide in Many-Worlds Implies P=NP
The quantum search problem is an important problem due to the fact that a general NP problem can be solved efficiently by an unsorted quantum search algorithm. Here it has been shown that the quantum search problem could be solved in…
A quantum theory of the universe consists of a theory of its quantum dynamics and a theory of its quantum state The theory predicts quantum multiverses in the form of decoherent sets of alternative histories describing the evolution of the…
A unified approach, for solving a wide class of single and many-body quantum problems, commonly encountered in literature is developed based on a recently proposed method for finding solutions of linear differential equations. Apart from…
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…
We describe an algorithm for quantum state tomography that converges in polynomial time to an estimate, together with a rigorous error bound on the fidelity between the estimate and the true state. The result suggests that state tomography…
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
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…
In the many-worlds interpretations (MWIs) of Everett and others, if I am the observer, there are several versions of me but no version is singled out as the one corresponding to my perceptions. However, it can be shown that the probability…
A common situation in quantum many-body physics is that the underlying theories are known but too complicated to solve efficiently. In such cases one usually builds simpler effective theories as low-energy or large-scale alternatives to the…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time.
The question of whether or not quantum computers can efficiently solve NP-complete problems is open, although indications are that BQP does not contain NP. Still, many of these problems are natural candidates for solution on quantum…
We show that combining two different hypothetical enhancements to quantum computation---namely, quantum advice and non-collapsing measurements---would let a quantum computer solve any decision problem whatsoever in polynomial time, even…
This is a philosophical paper in favor of the Many-Worlds Interpretation (MWI) of quantum theory. The concept of the ``measure of existence of a world'' is introduced and some difficulties with the issue of probability in the framework of…
Many advocates of the Everettian interpretation consider that theirs is the only approach to take quantum mechanics really seriously, and that this approach allows to deduce a fantastic scenario for our reality, one that consists of an…
Only a few classes of quantum algorithms are known which provide a speed-up over classical algorithms. However, these and any new quantum algorithms provide important motivation for the development of quantum computers. In this article new…
The many-worlds interpretation of quantum mechanics predicts the formation of distinct parallel worlds as a result of a quantum mechanical measurement. Communication among these parallel worlds would experimentally rule out alternatives to…
This article is a brief introduction to quantum algorithms for the eigenvalue problem in quantum many-body systems. Rather than a broad survey of topics, we focus on providing a conceptual understanding of several quantum algorithms that…
We consider a quantum version of a well-known statistical decision problem, whose solution is, at first sight, counter-intuitive to many. In the quantum version a continuum of possible choices (rather than a finite set) has to be…