Related papers: Quantum Query Complexity of the Hyperoctahedral Gr…

We introduce a novel quantum algorithm for similar subgraph identification in form of an NP-hard cardinality-constrained binary quadratic optimization problem. Given a weighted reference graph with Laplacian $\boldsymbol{B}$, our algorithm…

Based on [1], we study the complexity of horizontality in each twistor space $\hat{E}_{\varepsilon}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over the $2$-torus $T^2$, and obtain…

In this paper we analyze the quantum homological invariants (the Poincar\'e polynomials of the $\mathfrak{sl}_N$ link homology). In the case when the dimensions of homologies of appropriate topological spaces are precisely known, the…

This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum algorithm to compute $N$-bit OR functions with…

$U(N)^{\otimes r} \otimes O(N)^{\otimes q}$ invariants are constructed by contractions of complex tensors of order $r+q$, also denoted $(r,q)$. These tensors transform under $r$ fundamental representations of the unitary group $U(N)$ and…

Let $L$ be a number field and let $E/L$ be an elliptic curve with complex multiplication by the ring of integers $\mathcal{O}_K$ of an imaginary quadratic field $K$. We use class field theory and results of Skorobogatov and Zarhin to…

It is well known that quantum computers can efficiently find a hidden subgroup $H$ of a finite Abelian group $G$. This implies that after only a polynomial (in $\log |G|$) number of calls to the oracle function, the states corresponding to…

This paper develops a framework for the Hamiltonian quantization of complex Chern-Simons theory with gauge group $\mathrm{SL}(2,\mathbb{C})$ at an even level $k\in\mathbb{Z}_+$. Our approach follows the procedure of combinatorial…

We develop our method to prove quantum superintegrability of an integrable 2D system, based on recurrence relations obeyed by the eigenfunctions of the system with respect to separable coordinates. We show that the method provides rigorous…

We study the tensor product of principal unitary representations of the quantum Lorentz group, prove a decomposition theorem and compute the associated intertwiners. We show that these intertwiners can be expressed in terms of complex…

Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…

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…

Given its widespread application in machine learning and optimization, the Kronecker product emerges as a pivotal linear algebra operator. However, its computational demands render it an expensive operation, leading to heightened costs in…

Representations of a group $G$ in vector spaces over a field $K$ form a category. One can reconstruct the given group $G$ from its representations to vector spaces as the full group of monoidal automorphisms of the underlying functor. This…

This paper employs a powerful argument, called an algorithmic argument, to prove lower bounds of the quantum query complexity of a multiple-block ordered search problem in which, given a block number i, we are to find a location of a target…

We investigate the representation of a symmetric group $S_n$ on the homology of its Quillen complex at a prime $p$. For homology groups in small codimension, we derive an explicit formula for this representation in terms of the…

We give a quantum algorithm for a novel type of black-box problem: identifying a hidden $d$-regular base graph $G$ on $n$ vertices from oracle access to an obfuscated version of it, rather than traversing it. From $G$ we build the spired…

We prove a characterization of $t$-query quantum algorithms in terms of the unit ball of a space of degree-$2t$ polynomials. Based on this, we obtain a refined notion of approximate polynomial degree that equals the quantum query…

We prove exact complexity dichotomies for two quantum invariants of closed oriented three-manifolds, with the categorical data fixed. For a modular category $\mathcal{C}$, computing the Reshetikhin--Turaev invariant $Z_{\mathcal{C}}(M)$…

We find the complete branching law for the restriction of certain unitary representations of $O(1,n+1)$ to the subgroups $O(1,m+1)\times O(n-m)$, $0\leq m\leq n$. The unitary representations we consider belong either to the unitary…