Fetching the paper…
Reading the bibliography…
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups.
Young’s semi-normal representation of the symmetric group
R. M. Thrall · 1941
Earlier work this paper cites.
The Classical Groups
Hermann Weyl · 1946
Earlier work this paper cites.
Group Theory and its Application to Physical Problems
Morton Hamermesh · 1962
Earlier work this paper cites.
Representations of Groups
H. Boerner · 1963
Earlier work this paper cites.
A recursive formula for Young’s orthogonal representation
Sten Rettrup · 1977
Earlier work this paper cites.
A probabilistic proof of a formula for the number of Young tableaux of a given shape
Curtis Greene, Albert Nijenhuis, and Herbert S. Wilf · 1979
Earlier work this paper cites.
A simplification of the computation of the natural representation of the symmetric group S n S_{n}
Joseph M. Clifton · 1981
Earlier work this paper cites.
Algorithms for the character theory of the symmetric group
Ömer Eǧecioǧlu · 1985
Earlier work this paper cites.
Theory of Group Representations and Applications
A. O. Barut and R. Raçzka · 1986
Earlier work this paper cites.
The evaluation of irreducible polynomial representations of the general linear groups and the unitary groups over fields of characteristic 0
Johannes Grabmeier and Adalbert Kerber · 1987
Earlier work this paper cites.
Collected Papers
Izrail M. Gelfand · 1988
Earlier work this paper cites.
Representation of Lie groups and special functions
N. Ja. Vilenkin and A. U. Klimyk · 1992
Earlier work this paper cites.
An efficient algorithm for evaluating the standard Young-Yamanouchi orthogonal representation with two-column Young tableaux for symmetric groups
Wei Wu and Qianer Zhang · 1992
Earlier work this paper cites.
On the complexity of computing characters of finite groups
Charles Thomas Hepler · 1994
Cited alongside, same era.
The orthogonal and the natural representation for symmetric groups
Wei Wu and Qianer Zhang · 1994
Cited alongside, same era.
The Symmetric Group in Quantum Chemistry
Ruben Pauncz · 1995
Cited alongside, same era.
On Young’s orthogonal form and the characters of the alternating group
Patrick Headley · 1996
Cited alongside, same era.
Quantum computation of fourier transforms over symmetric groups
Robert Beals · 1997
Cited alongside, same era.
Conformal Field Theory
Philippe Di Francesco, Pierre Mathieu, and David Sénéchal · 1997
Cited alongside, same era.
Representation Theory: A first course
William Fulton and Joe Harris · 2004
Later among the works it cites.
Generic quantum Fourier transforms
Cristopher Moore, Daniel Rockmore, and Alexander Russell · 2004
Later among the works it cites.
Implementing high dimensional unitary representations of SU(2) on a quantum computer
Christof Zalka · 2004
Later among the works it cites.
Approximate counting and quantum computation
M. Bordewich, M. Freedman, L. Lovasz, and D. Welsh · 2005
Later among the works it cites.
The BQP-hardness of approximating the Jones polynomial
Dorit Aharonov and Itai Arad · 2006
Later among the works it cites.
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov, Vaughan Jones, and Zeph Landau · 2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Phillippe Biane · 1998
Cited alongside, same era.
A basis for representations of symplectic Lie algebras
Alexander Molev · 1999
Cited alongside, same era.
Characters of the symmetric groups: formulas, estimates and applications
Yuval Roichman · 1999
Cited alongside, same era.
The computational complexity to evaluate representations of general linear groups
Peter Bürgisser · 2000
Cited alongside, same era.
A modular functor which is universal for quantum computation
Michael Freedman, Michael Larsen, and Zhenghan Wang · 2000
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Cited alongside, same era.
Lie groups, Lie algebras, and some of their applications
Robert Gilmore · 2006
Later among the works it cites.
The quantum Schur tranform I. Efficient qudit circuits
Dave Bacon, Isaac Chuang, and Aram Harrow · 2007
Later among the works it cites.
de Finetti theorems for quantum states
Robert König · 2007
Later among the works it cites.
Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane
Dorit Aharonov, Itai Arad, Elad Eban, and Zeph Landau · 2008
Closest in time.
Estimating Jones and HOMFLY polynomials with one clean qubit
Stephen P. Jordan and Pawel Wocjan · 2008
Closest in time.
Estimating Jones polynomials is a complete problem for one clean qubit
Peter W. Shor and Stephen P. Jordan · 2008
Closest in time.
The Jones polynomial: quantum algorithms and applications in quantum complexity theory
Pawel Wocjan and Jon Yard · 2008
Closest in time.