Pith. sign in

REVIEW 1 cited by

A remark on the quantum complexity of the Kronecker coefficients

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.02389 v1 pith:WGEEQJUA submitted 2023-07-05 quant-ph math.RT

Christian Ikenmeyer , Sathyawageeswar Subramanian This is my paper · ORCID
classification quant-phmath.RT
keywords coefficientscomplexitykroneckerprovequantumresultadditionalanalogous
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Plethysm is in #BQP

    quant-ph 2026-02 conditional novelty 8.0 of 10

    Plethysm coefficients and general branching multiplicities for products of general linear groups are computable in #BQP.

Pith tools