Kronecker Coefficients in #BQP
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 the same quantum algorithmic tools that are used in their paper, combined with additional classical representation theoretic insights. We also prove the analogous result for the plethysm coefficients and the row sums of the symmetric group character table.
Authors
- Christian Ikenmeyer (ORCID: https://orcid.org/0000-0003-4654-177X)
- Sathyawageeswar Subramanian (ORCID: https://orcid.org/0000-0001-8716-3424)
Institutions
- University of Cambridge (GB)
- University of Warwick (GB)
Publication Details
- Journal
- ACM Transactions on Quantum Computing
- Published
- 2025-08-22
- DOI
- https://doi.org/10.1145/3762673
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- article
- Field-Weighted Citation Impact
- 0.00