Related papers: Quantum Query Complexity of the Hyperoctahedral Gr…
We first show that infinite satisfiability can be reduced to finite satisfiability for all prenex formulas of Separation Logic with $k\geq1$ selector fields ($\seplogk{k}$). Second, we show that this entails the decidability of the finite…
Motivated by the recent experimental demonstrations of quantum supremacy, proving the hardness of the output of random quantum circuits is an imperative near term goal. We prove under the complexity theoretical assumption of the…
We will give a representation-theoretic proof for the multiplication formula in the Ringel-Hall algebra ${\frak H}_\Delta(n)$ of a cyclic quiver $\Delta(n)$ given in \cite[Thm~4.5]{DuFu2015quantum}. As a first application, we see…
In the oracle identification problem, we are given oracle access to an unknown N-bit string x promised to belong to a known set C of size M and our task is to identify x. We present a quantum algorithm for the problem that is optimal in its…
Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give…
In a previous work (arXiv:0806.1503v2), we defined a family of subcomplexes of the $n$-dimensional half cube by removing the interiors of all half cube shaped faces of dimension at least $k$, and we proved that the homology of such a…
In this paper we present a quantum algorithm solving the triangle finding problem in unweighted graphs with query complexity $\tilde O(n^{5/4})$, where $n$ denotes the number of vertices in the graph. This improves the previous upper bound…
Quantum theory may be formulated using Hilbert spaces over any of the three associative normed division algebras: the real numbers, the complex numbers and the quaternions. Indeed, these three choices appear naturally in a number of…
The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…
Theta series for exceptional groups have been suggested as a possible description of the eleven-dimensional quantum supermembrane. We present explicit formulae for these automorphic forms whenever the underlying Lie group $G$ is split (or…
We give an explicit description of the $q$-deformation of symplectic group $SP_{q}(2n)$ at the $C^*$-algebra level and find all irreducible representations of this $C^{*}$-algebra. Further we describe the $C^*$-algebra of the quotient space…
In this paper, we explore the descriptive complexity theory of finite groups by examining the power of the second Ehrenfeucht-Fraisse bijective pebble game in Hella's (Ann. Pure Appl. Log., 1989) hierarchy. This is a Spoiler-Duplicator game…
In Exact Quantum Query model, almost all of the Boolean functions for which non-trivial query algorithms exist are symmetric in nature. The most well known techniques in this domain exploit parity decision trees, in which the parity of two…
For any function $f: X \times Y \to Z$, we prove that $Q^{*\text{cc}}(f) \cdot Q^{\text{OIP}}(f) \cdot (\log Q^{\text{OIP}}(f) + \log |Z|) \geq \Omega(\log |X|)$. Here, $Q^{*\text{cc}}(f)$ denotes the bounded-error communication complexity…
For any complex reflection group $G=G(m,p,n)$, we prove that the $G$-invariants of the division ring of fractions of the $n$:th tensor power of the quantum plane is a quantum Weyl field and give explicit parameters for this quantum Weyl…
The generalized quantum Euclidean group $\oq(\frak{b}_{m,n})$ is a natural generalization of the quantum Euclidean group $\oq(\frak{b}_{1,1})$. The Heisenberg double $\od(\frak{b}_{m,n})$ of $\oq(\frak{b}_{m,n})$ is the smash product of…
In our earlier work, we constructed a specific non-compact quantum group whose quantum group structures have been constructed on a certain twisted group C*-algebra. In a sense, it may be considered as a ``quantum Heisenberg group…
We consider the problem of finding a subcomplex K' of a simplicial complex K such that K' is homeomorphic to the 2-dimensional sphere, S^2. We study two variants of this problem. The first asks if there exists such a K' with at most k…
The quantum query complexity of subgraph-containment problems, which ask whether a given subgraph $H$ is present in an input graph $G$, has been the subject of considerable study. However, even for relatively simple subgraphs, such as paths…
A Kronecker coefficient is the multiplicity of an irreducible representation of a finite group $G$ in a tensor product of irreducible representations. We define Kronecker Hecke algebras and use them as a tool to study Kronecker coefficients…