Related papers: Even quantum advice is unlikely to solve PP
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
Quantum theory presents us with the tools for computational and communication advantages over classical theory. One approach to uncovering the source of these advantages is to determine how computation and communication power vary as…
We define rewinding operators that invert quantum measurements. Then, we define complexity classes ${\sf RwBQP}$, ${\sf CBQP}$, and ${\sf AdPostBQP}$ as sets of decision problems solvable by polynomial-size quantum circuits with a…
We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a…
In a recent preprint by Deutsch et al. [1995] the authors suggest the possibility of polynomial approximability of arbitrary unitary operations on $n$ qubits by 2-qubit unitary operations. We address that comment by proving strong lower…
The class QMA(k), introduced by Kobayashi et al., consists of all languages that can be verified using k unentangled quantum proofs. Many of the simplest questions about this class have remained embarrassingly open: for example, can we give…
If one modifies the laws of Quantum Mechanics to allow nonlinear evolution of quantum states, this paper shows that NP-complete problems would be efficiently solvable in polynomial time with bounded probability (NP in BQP). With that…
We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q^p of Q, as it is for example…
Partially quenched theories are theories in which the valence- and sea-quark masses are different. In this paper we calculate the nonanalytic one-loop corrections of some physical quantities: the chiral condensate, weak decay constants,…
A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems…
The class of commuting quantum circuits known as IQP (instantaneous quantum polynomial-time) has been shown to be hard to simulate classically, assuming certain complexity-theoretic conjectures. Here we study the power of IQP circuits in…
QMA (Quantum Merlin Arthur) is the class of problems which, though potentially hard to solve, have a quantum solution which can be verified efficiently using a quantum computer. It thus forms a natural quantum version of the classical…
Adleman, DeMarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. Fortnow and Rogers implicitly showed that, when the amplitudes are rational numbers, NQP is contained in the…
Withdrawn by the authors. Since the elements within each period of function hA are not distinct, period finding cannot operate properly. Thanks to all for the comments and sorry for the inconvenience.
A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.
The measurements of B -> pi K decays have been in disagreement with the predictions of the Standard Model (SM) for some time. In this paper, we perform an update of this puzzle using the latest (2008) data. We find that the situation has…
We consider the problem of covering hypersphere by a set of spherical hypercaps. This sort of problem has numerous practical applications such as error correcting codes and reverse k-nearest neighbor problem. Using the reduction of non…
Quantum correlations have fundamental and technological interest, and hence many measures have been introduced to quantify them. Some hierarchical orderings of these measures have been established, e.g., discord is bigger than entanglement,…
We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well know that a quantum circuit over the complex numbers can be…
In this paper, we study nonleptonic charmless B decays to two light pseudoscalar mesons within the frame of QCD factorization, including the contributions from the chirally enhanced power corrections and weak annihilation. Predictions for…