Related papers: Quantum Algorithms for Representation-Theoretic Mu…
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory…
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic…
The reduced Kronecker coefficients are particular instances of Kronecker coefficients that contain enough information to recover them. In this notes we compute the generating function of a family of reduced Kronecker coefficients. We also…
There are 13 equivalence classes of 2D second order quantum and classical superintegrable systems with nontrivial potential, each associated with a quadratic algebra of hidden symmetries. We study the finite and infinite irreducible…
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…
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are…
In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…
Polymomentum canonical theories, which are manifestly covariant multi-parameter generalizations of the Hamiltonian formalism to field theory, are considered as a possible basis of quantization. We arrive at a multi-parameter hypercomplex…
Through dualities on representations on tensor powers and symmetric powers respectively, the partition algebra and multiset partition algebra have been used to study long-standing questions in the representation theory of the symmetric…
We categorify the highest weight integrable representations and their tensor products of a symmetric quantum Kac-Moody algebra. As byproducts, we obtain a geometric realization of Lusztig's canonical bases of these representations as well…
This article describes a {\em nonstandard} quantum group that may be used to derive a positive formula for the plethysm problem, just as the standard (Drinfeld-Jimbo) quantum group can be used to derive the positive Littlewood-Richardson…
We discuss classical and quantum algorithms for solvability testing and finding integer solutions x,y of equations of the form af^x + bg^y = c over finite fields GF(q). A quantum algorithm with time complexity q^(3/8) (log q)^O(1) is…
There is a unique finite group that lies inside the 2-dimensional unitary group but not in the special unitary group, and maps by the symmetric square to an irreducible subgroup of the 3-dimensional real special orthogonal group. In an…
The Littlewood-Richardson coefficients $c^{\lambda}_{\mu\nu}$ give the multiplicity of an irreducible polynomial ${\rm GL}_n$-representation $F^{\lambda}_n$ in the tensor product of polynomial representations $F^{\mu}_n\otimes F^{\nu}_n$.…
One of spectacular results in mathematical physics is the expression of Racah matrices for symmetric representations of the quantum group $SU_q(2)$ through the Askey-Wilson polynomials, associated with the $q$-hypergeometric functions…
It is declared that the aim of simplifying representations of coefficients of power series of classical statistical mechanics is to simplify a process of obtaining estimates of the coefficients using their simplified representations. The…
A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…
The states accepted by a quantum circuit are known as the witnesses for the quantum circuit's satisfiability. The assumption BQP does not equal QMA implies that no efficient algorithm exists for constructing a witness for a quantum circuit…
Kostka coefficients appear in the representation theory of the general linear group and enumerate semistandard Young tableaux of fixed shape and content. The $r$-Kostka cone is the real polyhedral cone generated by pairs of partitions with…
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…