Papers › Classical and quantum algorithms for characters of the symmetric group
Classical and quantum algorithms for characters of the symmetric group
Sergey Bravyi, David Gosset, Vojtech Havlicek, Louis Schatzki
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group Sₙ is a challenging problem known to be #P-hard in the worst case. Here we describe a Matrix Product State (MPS) algorithm for characters of Sₙ. The algorithm computes an MPS encoding all irreducible characters of a given permutation. It relies on a mapping from characters of Sₙ to quantum spin chains proposed by Crichigno and Prakash. We also provide a simpler derivation of this mapping. We complement this result by presenting a poly(n) size quantum circuit that prepares the corresponding MPS, obtaining an efficient quantum algorithm for certain sampling problems based on characters of Sₙ. To assess classical hardness of these problems we present a general reduction from strong simulation (computing a given probability) to weak simulation (sampling with a small error). This reduction applies to any sampling problem with a certain granularity structure and may be of independent interest.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections