Related papers: Quantum Algorithms for Representation-Theoretic Mu…

We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…

We present a quantum algorithm for computing the Ramsey numbers whose computational complexity grows super-exponentially with the number of vertices of a graph on a classical computer. The problem is mapped to a decision problem on a…

In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of…

We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…

We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…

Representability determines when a two-particle reduced density matrix (2-RDM) corresponds to a physical quantum state, enabling many-particle quantum calculations with 2-RDMs rather than the wave function. In this Letter, we present a…

The quantum cohomology of Grassmannians exhibits two symmetries related to the quantum product, namely a \Bbb {Z}/n action and an involution related to complex conjugation. We construct a new ring by dividing out these symmetries in an…

This paper is devoted to the study of harmonic analysis on quantum tori. We consider several summation methods on these tori, including the square Fej\'er means, square and circular Poisson means, and Bochner-Riesz means. We first establish…

Representations of the quantum superalgebra U_q[osp(1/2)] and their relations to the basic hypergeometric functions are investigated. We first establish Clebsch-Gordan decomposition for the superalgebra U_q[osp(1/2)] in which the…

We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of `knot invariants', among…

The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…

We resolve two open problems on Kronecker coefficients $g(\lambda,\mu,\nu)$ of the symmetric group. First, we prove that for partitions $\lambda,\mu,\nu$ with fixed Durfee square size, the Kronecker coefficients grow at most polynomially.…

Quantum computers may achieve speedups over their classical counterparts for solving linear algebra problems. However, in some cases -- such as for low-rank matrices -- dequantized algorithms demonstrate that there cannot be an exponential…

We establish equivalences of derived categories of the following 3 categories: (1) Principal block of representations of the quantum at a root of 1; (2) G-equivariant coherent sheaves on the Springer resolution; (3) Perverse sheaves on the…

This work explores classical discrete multiple orthogonal polynomials, including Hahn, Meixner of the first and second kinds, Kravchuk, and Charlier polynomials, with an arbitrary number of weights. Explicit expressions for the recursion…

The Littlewood-Richardson coefficients $c^\nu_{\lambda,\mu}$ are the multiplicities in the tensor product decomposition of two irreducible representations of the general linear group GL$(n, {\mathbb C})$. They are parametrized by the…

Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…

We propose an algebraic formulation for two distinct quantum algorithms: a quantum classification algorithm and a quantum search algorithm with a non-uniform initial distribution, both based on Clifford algebras and spinorial…

In the 90's a collection of Plethystic operators were introduced in [3], [7] and [8] to solve some Representation Theoretical problems arising from the Theory of Macdonald polynomials. This collection was enriched in the research that led…