A remark on the quantum complexity of the Kronecker coefficients

2023/07/05 by Ikenmeyer, Christian, Subramanian, Sathyawageeswar · 1 citation
#FOS: Mathematics #FOS: Physical sciences #Quantum Physics (quant-ph) #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.2307.02389

Abstract

We prove that the computation of the Kronecker coefficients of the symmetric group is contained in the complexity class #BQP. This improves a recent result of Bravyi, Chowdhury, Gosset, Havlicek, and Zhu. We use only the quantum computing tools that are used in their paper and additional classical representation theoretic insights. We also prove the analogous result for the plethysm coefficients.

Cited by

• Plethysm is in #BQP

Related

• Quantum Algorithms for Representation-Theoretic Multiplicities
• Plethysm is in #BQP
• Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
• Geometric Complexity Theory IV: nonstandard quantum group for the Kronecker problem
• Bounds on the Kronecker coefficients