Related papers: A remark on the quantum complexity of the Kronecke…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
Any finite simplicial complex K and a partition of the vertex set of K determines a canonical quotient space of the moment-angle complex of K. We prove that the cohomology groups of such a space can be computed via some Hochster's type…
We review the notion of simple compact quantum groups and examples, and discuss the problem of construction and classification of simple compact quantum groups. Several new quantum groups constructed by Banica, Curran and Speicher since the…
This is a self-contained review on the theory of quantum group and its applications to modern physics. A brief introduction is given to the Yang-Baxter equation in integrable quantum field theory and lattice statistical physics. The quantum…
We introduce a systematic study of "symmetric quantum circuits", a new restricted model of quantum computation that preserves the symmetries of the problems it solves. This model is well-adapted for studying the role of symmetry in quantum…
We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan-Wigner form for evaluation on quantum computers. Symmetries, such as point-group symmetries in molecules, are apparent in the…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well know that a quantum circuit over the complex numbers can be…
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group of minimal degree m and on the number of its elements of any given support.…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transforms yield efficient solutions to this…
Motivated by the Saxl conjecture and the tensor square conjecture, which states that the tensor squares of certain irreducible representations of the symmetric group contain all irreducible representations, we study the tensor squares of…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
In this paper we apply a method of Robinson and Taulbee for computing Kronecker coefficients together with other ingredients and show that the multiplicity of each component in a Kronecker square can be obtained from an evaluation of a…
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic…
This note is a stripped down version of a published paper on the Potts partition function, where we concentrate solely on the linear coding aspect of our approach. It is meant as a resource for people interested in coding theory but who do…
We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum…
We introduce an expansion formula for elements in quantum cluster algebras associated to type A and Kronecker quivers with principal quantization. Our formula is parametrized by perfect matchings of snake graphs as in the classical case. In…
Recently, Feh\'er and Kluck discovered, at the level of classical mechanics, new compactified trigonometric Ruijsenaars-Schneider $n$-particle systems, with phase space symplectomorphic to the $(n-1)$-dimensional complex projective space.…
Recent developments in quantum gravity have shown the Lorentzian treatment to be a fruitful approach towards the emergence of macroscopic spacetimes. In this paper, we discuss another related aspect of the Lorentzian treatment: we argue…