Related papers: NQP_{C} = co-C_{=}P
The widely held belief that BQP strictly contains BPP raises fundamental questions: if we cannot efficiently compute predictions for the behavior of quantum systems, how can we test their behavior? In other words, is quantum mechanics…
We prove that over a commutative noetherian ring the three approaches to introducing depth for complexes: via Koszul homology, via Ext modules, and via local cohomology, all yield the same invariant. Using this result, we establish a far…
The use of quantum computing to solve a problem in quantum mechanics is illustrated, step by step, by calculating energies and transition amplitudes in a nonrelativistic quark model. The quantum computations feature the use of variational…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
Inspired by computational complexity results for the quantified constraint satisfaction problem, we study the clones of idempotent polymorphisms of certain digraph classes. Our first results are two algebraic dichotomy, even "gap",…
Standard quantum inference converts quantum data into classical outputs. We study an alternative inference setting in which the desired output is quantum, preserving coherence. Such settings include quantum purity amplification (QPA),…
This paper is an updated version of ANT-0372 (2002 dec 4) with the same title. Several errors are corrected in this version. An example of the kind of results obtained is: Let K/\Q be an abelian extension with N = [K:\Q] > 1, N odd. Let…
Let $p$ be a prime, let $d \geq 1$ be an integer and $A$ be the algebra of square matrices of size $d$ over the field of order $p$. Let $P, Q \in A[x_1, \dots x_n]$ be polynomials in $n$ indeterminates with coefficients in $A$, such that…
We introduce general q-deformed multiple polylogarithms which even in the dilogarithm case differ slightly from the deformation usually discussed in the literature. The merit of the deformation as suggested, here, is that q-deformed…
We construct the q-discrete Painleve I and II equations and their higher order analogues by virtue of periodic cluster algebras. Using particular (k,k) exchange matrices, we show that the cluster algebras corresponding to k=4 and 5 give the…
We study the complexity of quantum query algorithms that make p queries in parallel in each timestep. This model is in part motivated by the fact that decoherence times of qubits are typically small, so it makes sense to parallelize quantum…
We give a corrected proof that if PP $\subseteq$ BQP/qpoly, then the Counting Hierarchy collapses, as originally claimed by [Aaronson 2006 arXiv:cs/0504048]. This recovers the related unconditional claim that PP does not have circuits of…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…
We present characterisations of "exact" gap-definable classes, in terms of indeterministic models of computation which slightly modify the standard model of quantum computation. This follows on work of Aaronson [arXiv:quant-ph/0412187], who…
Amplitude amplification is one of primary tools in building algorithms for quantum computers. This technique generalizes key ideas of the Grover search algorithm. Potentially useful modifications are connected with changing phases in the…
We introduce a quantitative version of polynomial cohomology for discrete groups and show that it coincides with usual group cohomology when combinatorial filling functions are polynomially bounded. As an application, we show that Betti…
The main purpose of this note is to investigate some kinds of nonlinear complementarity problems (NCP). For the structured tensors, such as, symmetric positive definite tensors and copositive tensors, we derive the existence theorems on a…
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…
In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…