Related papers: BQP_p = PP for integer p > 2
Decoherence may not solve all of the measurement problems of quantum mechanics. It is proposed that a solution to these problems may be to allow that superpositions describe physically real systems in the following sense. Each quantum…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
This letter examines the consequences of a recently proposed modification of the postulate of equal {\it a priori} probability in quantum statistical mechanics. This modification, called the {\it quantum microcanonical postulate} (QMP),…
A century after the advent of Quantum Mechanics and General Relativity, both theories enjoy incredible empirical success, constituting the cornerstones of modern physics. Yet, paradoxically, they suffer from deep-rooted, so-far intractable,…
Quantum theory is notoriously counterintuitive, and yet remains entirely self-consistent when applied universally. Here we uncover a new manifestation of its unusual consequences. We demonstrate, theoretically and experimentally (by means…
We construct a quantum oracle relative to which $\mathsf{BQP} = \mathsf{QMA}$ but cryptographic pseudorandom quantum states and pseudorandom unitary transformations exist, a counterintuitive result in light of the fact that pseudorandom…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
Computational complexity theory contains a corpus of theorems and conjectures regarding the time a Turing machine will need to solve certain types of problems as a function of the input size. Nature {\em need not} be a Turing machine and,…
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the…
If quantum states exhibit small nonlinearities during time evolution, then quantum computers can be used to solve NP-complete problems in polynomial time. We provide algorithms that solve NP-complete and #P oracle problems by exploiting…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
We clarify the significance of quasiprobability (QP) in quantum mechanics that is relevant in describing physical quantities associated with a transition process. Our basic quantity is Aharonov's weak value, from which the QP can be defined…
Is quantum mechanics about 'states'? Or is it basically another kind of probability theory? It is argued that the elementary formalism of quantum mechanics operates as a well-justified alternative to 'classical' instantiations of a…
The statistics of local measurements of joint quantum systems can sometimes be used to distinguish the spatiotemporal structure in which they were measured. We first prove that every bipartite separable density matrix is temporally…
It is shown that Quantum Mechanics is ambiguous when predicting relative frequencies for an entangled system if the measurements of both subsystems are performed in spatially separated events. This ambiguity gives way to unphysical…
Two of the most intriguing features of quantum physics are the uncertainty principle and the occurrence of nonlocal correlations. The uncertainty principle states that there exist pairs of incompatible measurements on quantum systems such…
Post-selection, the power of discarding all runs of a computation in which an undesirable event occurs, is an influential concept introduced to the field of quantum complexity theory by Aaronson (Proceedings of the Royal Society A, 2005).…
Quantum theory is a mathematical formalism to compute probabilities for outcomes happenning in physical experiments. These outcomes constitute events happening in space-time. One of these events represents the fact that a system located in…
A type of mechanics will be presented that possesses some distinctive properties. On the one hand, its physical description & rules of operation are readily comprehensible & intuitively clear. On the other, it fully satisfies all observable…
This is the second of the two related papers analysing origins and possible explanations of a paradoxical phenomenon of the quantum potential (QP). It arises in quantum mechanics'(QM) of a particle in the Riemannian $n$-dimensional…