Related papers: Quantum Query Complexity of the Hyperoctahedral Gr…
We construct $2^n$-families of solutions of the Yang-Baxter equation from $n$-products of three-dimensional $R$ and $L$ operators satisfying the tetrahedron equation. They are identified with the quantum $R$ matrices for the Hopf algebras…
We define solvable quantum mechanical systems on a Hilbert space spanned by bipartite ribbon graphs with a fixed number of edges. The Hilbert space is also an associative algebra, where the product is derived from permutation group…
We introduce a unital associative algebra ${\mathcal{SV}ir\!}_{q,k}$, having $q$ and $k$ as complex parameters, generated by the elements $K^\pm_m$ ($\pm m\geq 0$), $T_m$ ($m\in \mathbb{Z}$), and $G^\pm_m$ ($m\in \mathbb{Z}+{1\over 2}$ in…
We consider an approach to deciding isomorphism of rigid n-vertex graphs (and related isomorphism problems) by solving a nonabelian hidden shift problem on a quantum computer using the standard method. Such an approach is arguably more…
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…
It is known that any quantum algorithm for Graph Isomorphism that works within the framework of the hidden subgroup problem (HSP) must perform highly entangled measurements across Omega(n log n) coset states. One of the only known models…
While the quantum query complexity of $k$-distinctness is known to be $O\left(n^{3/4-1/4(2^k-1)}\right)$ for any constant $k \geq 4$, the best previous upper bound on the time complexity was $\widetilde{O}\left(n^{1-1/k}\right)$. We give a…
We show that the quantum Heisenberg group $H_{q}(1)$ can be obtained by means of contraction from quantum $SU_q(2)$ group. Its dual Hopf algebra is the quantum Heisenberg algebra $U_{q}(h(1))$. We derive left and right regular…
This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory…
The learnable, linear neural network layers between tensor power spaces of $\mathbb{R}^{n}$ that are equivariant to the orthogonal group, $O(n)$, the special orthogonal group, $SO(n)$, and the symplectic group, $Sp(n)$, were characterised…
Quantum query complexity is typically characterized in terms of XOR queries |x,y> to |x,y+f(x)> or phase queries, which ensure that even queries to non-invertible functions are unitary. When querying a permutation, another natural model is…
In this paper, we introduce the hybrid query complexity, denoted as $\mathrm{Q}(f;q)$, which is the minimal query number needed to compute $f$, when a classical decision tree is allowed to call $q'$-query quantum subroutines for any $q'\leq…
We show that there is a dense set $\ourset\subseteq \mathbb{N}$ of group orders and a constant $c$ such that for every $n\in \ourset$ we can decide in time $O(n^2(\log n)^c)$ whether two $n\times n$ multiplication tables describe isomorphic…
It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected…
Matrix multiplication is a fundamental classical computing operation whose efficiency becomes a major challenge at scale, especially for machine learning applications. Quantum computing, with its inherent parallelism and exponential storage…
In the present article we discuss the classification of quantum groups whose quasi-classical limit is a given simple complex Lie algebra $\mathfrak{g}$. This problem reduces to the classification of all Lie bialgebra structures on…
The arithmetic complexity counts the number of algebraically independent entries in the periodic continued fraction $\theta=[b_1,\dots, b_N, \overline{a_1,\dots,a_k}]$. If $\mathscr{A}_{\theta}$ is a noncommutative torus corresponding to…
Let $O$ be a closed Poisson conjugacy class of the complex algebraic Poisson group GL(n) relative to the Drinfeld-Jimbo factorizable classical r-matrix. Denote by $T$ the maximal torus of diagonal matrices in GL(n). With every $a\in O\cap…
This paper addresses the problem of finding the densest $k$-vertex subgraph in an arbitrary graph. This problem is NP-hard and has important applications in social network analysis, fraud detection, recommendation systems, and…
This thesis provides a partial answer to a question posed by Greg Kuperberg in q-alg/9712003 and again by Justin Roberts as problem 12.18 in "Problems on invariants of knots and 3-manifolds", math.GT/0406190, essentially: "Can one describe…