Related papers: A remark on the quantum complexity of the Kronecke…
We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum…
After recalling briefly some basic properties of the quantum group $GL_q(2)$, we study the quantum sphere $S_q^2$, quantum projective space $CP_q(N)$ and quantum Grassmannians as examples of complex (K\"{a}hler) quantum manifolds. The…
We associate to a bound quiver (Q,I) a CW-complex which we denote by B(Q,I), and call the classifying space of (Q,I). We show that the fundamental group of B(Q,I) is isomorphic to the fundamental group of (Q,I). Moreover, we show that this…
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version…
In this paper, we prove the integrality conjecture for quotient stacks arising from weakly symmetric representations of reductive groups. Our main result is a decomposition of the cohomology of the stack into finite-dimensional components…
We develop a theory of two-parameter quantum polynomial functors. Similar to how (strict) polynomial functors give a new interpretation of polynomial representations of the general linear groups $\operatorname{GL}_n$, the two-parameter…
We construct a CW decomposition $C_n$ of the $n$-dimensional half cube in a manner compatible with its structure as a polytope. For each $3 \leq k \leq n$, the complex $C_n$ has a subcomplex $C_{n, k}$, which coincides with the clique…
In this paper, we give some new identities of symmetry for q-Bernoulli polynomials under the symmetric group of degree n arising from p-adic q-integrals on Zp.
We calculate the Plancherel formula for complex semisimple quantum groups, that is, Drinfeld doubles of $ q $-deformations of compact semisimple Lie groups. As a consequence we obtain a concrete description of their associated reduced group…
We tackle the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch 20 years ago. We show that this decision…
We define a new category of quantum polynomial functors extending the quantum polynomials introduced by Hong and Yacobi. We show that our category has many properties of the category of Hong and Yacobi and is the natural setting in which…
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
We compare the integral category O of shifted affine quantum groups of symmetric and non symmetric types. To do so we compute the K-theoretic analog of the Coulomb branches with symmetrizers introduced by Nakajima and Weekes. This yields an…
We provide a generalized definition for the quantized Clifford algebra introduced by Hayashi using another parameter $k$ that we call the twist. For a field of characteristic not equal to $2$, we provide a basis for our quantized Clifford…
Deterministic quantum computation with one quantum bit (DQC1) is a restricted model of quantum computing where the input state is the completely mixed state except for a single clean qubit, and only a single output qubit is measured at the…
We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_{\phi}\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also…
Clifford gates are a winsome class of quantum operations combining mathematical elegance with physical significance. The Gottesman-Knill theorem asserts that Clifford computations can be classically efficiently simulated but this is true…
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…