Related papers: Characterizing the intersection of QMA and coQMA
We explain the use of quantum process calculus to describe and analyse linear optical quantum computing (LOQC). The main idea is to define two processes, one modelling a linear optical system and the other expressing a specification, and…
Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
For a covariant functor W. Fulton and R. MacPherson defined \emph{an operational bivariant theory} associated to this covariant functor. In this paper we will show that given a contravariant functor one can similarly construct a ``dual"…
We study automorphisms and representations of quasi polynomial algebras (QPAs) and quasi Laurent polynomial algebras (QLPAs). For any QLPA defined by an arbitrary skew symmetric integral matrix, we explicitly describe its automorphism…
The theory of Total Function NP (TFNP) and its subclasses says that, even if one is promised an efficiently verifiable proof exists for a problem, finding this proof can be intractable. Despite the success of the theory at showing…
Generalizing our earlier work, we introduce the homogeneous quantum $Z$-algebras for all quantum affine algebras $\alg$ of type one. With the new algebras we unite previously scattered realizations of quantum affine algebras in various…
This paper is concerned with quantum cohomology and Fukaya categories of a closed monotone symplectic manifold X, where we use coefficients in a field k of characteristic p > 0. The main result of this paper is that the quantum Steenrod…
We study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a…
In this paper we suggest that in the framework of the Category Theory it is possible to demonstrate the mathematical and logical \textit{dual equivalence} between the category of the $q$-deformed Hopf Coalgebras and the category of the…
Quantum computing will change the way we tackle certain problems. It promises to dramatically speed-up many chemical, financial, and machine-learning applications. However, to capitalize on those promises, complex design flows composed of…
Loop is a powerful program construct in classical computation, but its power is still not exploited fully in quantum computation. The exploitation of such power definitely requires a deep understanding of the mechanism of quantum loop…
This paper gives a uniform-theoretic refinement of classical homotopy theory. Both cubical sets (with connections) and uniform spaces admit classes of weak equivalences, special cases of classical weak equivalences, appropriate for the…
Inspired by a result in [Ga], we locate two $ k[q,q^{-1}] $-integer forms of $ F_q[SL(n+1)] $, along with a presentation by generators and relations, and prove that for $ q=1 $ they specialize to $ U({\mathfrak{h}}) $, where $…
We prove that the computation of the Kronecker coefficients of the symmetric group is contained in the complexity class #BQP. This improves a recent result of Bravyi, Chowdhury, Gosset, Havlicek, and Zhu. We use only the quantum computing…
The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…
The paper is devoted to the comparison of the Fukaya category (it is responcible for the A-side of mirror symmetry) with the category of holonomic modules over the quantized algebra of functions on the same symplectic manifold. We…
This note presents a concise and non-polemical comparison of several major interpretations of quantum mechanics, with a particular emphasis on the distinction between FAPP-solutions ("For All Practical Purposes'') versus ontological…
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…
{\it Learning finite automata} (termed as {\it model learning}) has become an important field in machine learning and has been useful realistic applications. Quantum finite automata (QFA) are simple models of quantum computers with finite…