English
Related papers

Related papers: Characterizing the intersection of QMA and coQMA

200 papers

We demonstrate that, in certain cases, quantization and the classical limit provide functors that are "almost inverse" to each other. These functors map between categories of algebraic structures for classical and quantum physics,…

Mathematical Physics · Physics 2024-01-17 Benjamin H. Feintzeig

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

Group Theory · Mathematics 2015-03-09 J. C. Birget

Determining the worst-case uncertainty added by a quantum circuit is shown to be computationally intractable. This is the problem of detecting when a quantum channel implemented as a circuit is close to a linear isometry, and it is shown to…

Quantum Physics · Physics 2010-06-02 Bill Rosgen

The generalization problem on KBQA has drawn considerable attention. Existing research suffers from the generalization issue brought by the entanglement in the coarse-grained modeling of the logical expression, or inexecutability issues due…

Artificial Intelligence · Computer Science 2023-06-27 Lingxi Zhang , Jing Zhang , Yanling Wang , Shulin Cao , Xinmei Huang , Cuiping Li , Hong Chen , Juanzi Li

We present a new quantum complexity class, called MQ^2, which is contained in AWPP. This class has a compact and simple mathematical definition, involving only polynomial-time computable functions and a unitarity condition. It contains both…

Computational Complexity · Computer Science 2007-05-23 Tereza Tusarova

We explore a number of functional properties of the $q$-gamma function and a class of its quotients; including the $q$-beta function. We obtain formulas for all higher logarithmic derivatives of these quotients and give precise conditions…

Classical Analysis and ODEs · Mathematics 2013-09-19 Ahmad El-Guindy , Zeinab Mansour

We study increasingly expressive type systems, from $F^\mu$ -- an extension of the polymorphic lambda calculus with equirecursive types -- to $F^{\mu;}_\omega$ -- the higher-order polymorphic lambda calculus with equirecursive types and…

Logic in Computer Science · Computer Science 2023-01-23 Diana Costa , Andreia Mordido , Diogo Poças , Vasco T. Vasconcelos

We study cohomological finiteness conditions for groups associated to Mackey and cohomological Mackey functors, proving that the cohomological dimension associated to cohomological Mackey functors is always equal to the…

Group Theory · Mathematics 2013-12-06 Simon St John-Green

We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science. In particular, we show that to nearly every quantum…

Quantum Physics · Physics 2015-03-27 Gus Gutoski , Patrick Hayden , Kevin Milner , Mark M. Wilde

I offer a case that quantum query complexity still has loads of enticing and fundamental open problems -- from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial…

Quantum Physics · Physics 2021-09-16 Scott Aaronson

We give a natural filtration F on quantum cohomology QH(G/B) of G/B, which respects the quantum product structure. Its associated graded algebra is isomorphic to the tensor product of QH(G/P) and a corresponding graded algebra of QH(P/B)…

Algebraic Geometry · Mathematics 2010-07-13 Naichung Conan Leung , Changzheng Li

Given a problem which is intractable for both quantum and classical algorithms, can we find a sub-problem for which quantum algorithms provide an exponential advantage? We refer to this problem as the "sculpting problem." In this work, we…

Quantum Physics · Physics 2015-12-15 Scott Aaronson , Shalev Ben-David

An open question in quantum complexity theory is whether or not the class $\operatorname{MIP}^{co}$, consisting of languages that can be efficiently verified using interacting provers sharing quantum resources according to the quantum…

Computational Complexity · Computer Science 2022-09-19 Isaac Goldbring , Bradd Hart

We introduce the monoidal closed category qCPO of quantum cpos, whose objects are "quantized" analogs of omega-complete partial orders (cpos). The category qCPO is enriched over the category CPO of cpos, and contains both CPO, and the…

Programming Languages · Computer Science 2021-09-07 Andre Kornell , Bert Lindenhovius , Michael Mislove

Let $\mathbb{F}\subset \mathbb{K}$ be fields with characteristic zero, $n$ be a positive integer and $\kappa\in \mathbb{K}$. In this paper, we determine those monomials $f\colon \mathbb{F}\to \mathbb{K}$ of degree $n$ for which \[ f(x^{2})=…

Number Theory · Mathematics 2024-10-11 Eszter Gselmann , Mehak Iqbal

We prove $q$-analogues of identities that are equivalent to the functional equation of the arithmetic-geometric mean. We also present $q$-analogues of $F(\sqrt{k},\frac{\pi}{2})$, the complete elliptical integral of the first kind, and its…

Combinatorics · Mathematics 2019-06-26 Mario DeFranco

We introduce the notion of formal multiparameter quantum universal enveloping algebras - in short FoMpQUEA - as a straightforward generalization of Drinfeld's quantum group. Then we show that the class of FoMpQUEA's is closed under…

Quantum Algebra · Mathematics 2026-03-06 Gastón Andrés García , Fabio Gavarini

Quantum complete intersections $A= A({\bf q, a})$ are Frobenius algebras, but in the most cases they can not become Hopf algebras. This paper aims to find bi-Frobenius algebra structures on $A$. A key step is the construction of…

Rings and Algebras · Mathematics 2025-01-31 Hai Jin , Pu Zhang

Quantum Measure Theory (QMT) is a generalization of quantum theory where physical predictions are computed from a matrix known as \emph{decoherence functional} (DF). Previous works have noted that, in its original formulation, QMT exhibits…

Quantum Physics · Physics 2017-02-22 Paul Boes , Miguel Navascues

This work presents AEQUAM (Area Efficient QUAntum eMulation), a toolchain that enables faster and more accessible quantum circuit verification. It consists of a compiler that translates OpenQASM 2.0 into RISC-like instructions, Cython…

Quantum Physics · Physics 2025-07-28 Lorenzo Lagostina , Deborah Volpe , Maurizio Zamboni , Giovanna Turvani