Classical and Quantum Algorithms for Characters of the Symmetric Group
Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group S_{n} 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_{n}. Th...
Saved in:
| Main Authors: | Sergey Bravyi, David Gosset, Vojtech Havlicek, Louis Schatzki |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
American Physical Society
2025-08-01
|
| Series: | PRX Quantum |
| Online Access: | http://doi.org/10.1103/bq28-r2r7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
AFFINE SUBGROUPS OF THE CLASSICAL
GROUPS AND THEIR CHARACTER DEGREES
Published: (1998-06-01) -
Quantum and classical algorithms for nonlinear unitary dynamics
by: Noah Brustle, et al.
Published: (2025-05-01) -
Quantum maximally symmetric spacetimes
by: P. Meert, et al.
Published: (2025-08-01) -
Quantum Product of Symmetric Functions
by: Rafael Díaz, et al.
Published: (2015-01-01) -
Use of hybrid quantum-classical algorithms for enhancing biomarker classification.
by: Aninda Astuti, et al.
Published: (2025-01-01)