Related papers: A remark on the quantum complexity of the Kronecke…

Let $A$ be the path algebra of a finite acyclic quiver $Q$ over a finite field. We realize the quantum cluster algebra with principal coefficients associated to $Q$ as a sub-quotient of a certain Hall algebra involving the category of…

The plethysms of the Weyl characters associated to a classical Lie group by the symmetric functions stabilize in large rank. In the case of a power sum plethysm, we prove that the coefficients of the decomposition of this stabilized form on…

Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates, and thus a potential way to use these quantum devices is using a hybrid scheme that interleaves them with classical computers. For…

In this paper, we give an explicit description of the de Rham and p-adic polylogarithms for elliptic curves using the Kronecker theta function. We prove in particular that when the elliptic curve has complex multiplication and good…

Following the recent approach of using order domains to construct Grobner bases from general projective varieties, we examine the parity and time-reversal arguments relating de Witt and Lyman's assertion that all path weights associated…

The characterization of the quantum ensemble is a fundamental issue in quantum information theory and foundations. The ensemble is also useful for various quantum information processing. To characterize the quantum ensemble, in this…

A composite quantum system comprising a finite number k of subsystems which are described with position and momentum variables in Z_{n_{i}}, i=1,...,k, is considered. Its Hilbert space is given by a k-fold tensor product of Hilbert spaces…

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

We study quantum and classical systems associated with the quantum corner symmetry group $\mathrm{QCS}=\widetilde{\mathrm{SL}}(2,\mathbb{R})\ltimes \mathrm{H}_3,$ which arises in the context of quantum gravity. We relate quantum observables…

The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new…

The Kronecker theta function is a quotient of the Jacobi theta functions, which is also a special case of Ramanujan's $_1\psi_1$ summation. Using the Kronecker theta function as building blocks, we prove a decomposition theorem for theta…

Building on work by Kontsevich, Soibelman, Nagao and Efimov, we prove the positivity of quantum cluster coefficients for all skew-symmetric quantum cluster algebras, via a proof of a conjecture first suggested by Kontsevich on the purity of…

This article shows that one can consistently incorporate nonunitary representations of at least one group into the ``ordinary'' nonrelativistic quantum mechanics. This group turns out to be Lorentz group thus giving us an alternative…

We introduce the relative Coxeter groupoid and construct intrinsic relative braid group symmetries for quantum supersymmetric pairs of type sAIII. These symmetries are constructed by establishing new intertwining properties of quasi…

We are concerned with the Hidden Subgroup Problem for finite groups. We present a simplified analysis of a quantum algorithm proposed by Hallgren, Russell and Ta-Shma as well as a detailed proof of a lower bound on the probability of…

The cluster multiplication formulas for a generalized quantum cluster algebra of Kronecker type are explicitly given. Furthermore, a positive bar-invariant $\mathbb{Z}[q^{\pm\frac{1}{2}}]$-basis of this algebra is constructed.

A celebrated important result due to Freedman, Larsen and Wang states that providing additive approximations of the Jones polynomial at the k'th root of unity, for constant k=5 and k>6, is BQP-hard. Together with the algorithmic results of…

In this paper, we study the computational complexity of the quadratic unconstrained binary optimization (QUBO) problem under the functional problem FP^NP categorization. We focus on four sub-classes: (1) When all coefficients are integers…

In this paper we study weighted versions of Fourier algebras of compact quantum groups. We focus on the spectral aspects of these Banach algebras in two different ways. We first investigate their Gelfand spectrum, which shows a connection…

Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…