Fetching the paper…
Reading the bibliography…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters.
The unsolvability of the problem of homeomorphism
Andrei Andreevich Markov · 1958
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.
Alternant molecular orbital method
Ruben Pauncz · 1967
Earlier work this paper cites.
Semiclassical limit of Racah coefficients
G. Ponzano and T. Regge · 1968
Earlier work this paper cites.
Angular momentum: an approach to combinatorial space-time
Roger Penrose · 1971
Earlier work this paper cites.
The collected papers of Alfred Young 1873-1940
G. de B. Robinson, editor · 1977
Earlier work this paper cites.
A recursive formula for Young’s orthogonal representation
Sten Rettrup · 1977
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.
Über die bistellare äquivalenz simplizialer sphären und polytope
Udo Pachner · 1981
Earlier work this paper cites.
Topological quantum field theories
Michael Atiyah · 1988
Earlier work this paper cites.
Quantum computational networks
David Deutsch · 1989
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.
Quantum Theory: Concepts and Methods
Asher Peres · 1993
Earlier work this paper cites.
Modern Quantum Mechanics
J. J. Sakurai · 1994
Earlier work this paper cites.
The orthogonal and the natural representation for symmetric groups
Wei Wu and Qianer Zhang · 1994
Earlier work this paper cites.
The Symmetric Group in Quantum Chemistry
Ruben Pauncz · 1995
Cited alongside, same era.
Invariants of three-dimensional manifolds
S. Gelfand and D. Kazhdan · 1996
Cited alongside, same era.
Quantum algorithms revisited
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca · 1998
Cited alongside, same era.
Power of one bit of quantum information
E. Knill and R. Laflamme · 1998
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael A. Nielsen and Isaac L. Chuang · 2000
Cited alongside, same era.
An introduction to spin foam models of BF theory and quantum gravity
John C. Baez · 2001
Cited alongside, same era.
A one way quantum computer
Robert Raussendorf and Hans J. Briegel · 2001
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov, Vaughan Jones, and Zeph Landau · 2006
Later among the works it cites.
Computing with highly mixed states
Andris Ambainis, Leonard Schulman, and Umesh Vazirani · 2006
Later among the works it cites.
Computation with unitaries and one pure qubit
Dan Shepherd · 2006
Later among the works it cites.
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev · 2007
Later among the works it cites.
The quantum Schur transform: I. efficient qudit circuits
Dave Bacon, Isaac L. Chuang, and Aram W. Harrow · 2007
Later among the works it cites.
q-deformed spin networks, knot polynomials, and anyonic topological quantum computation
Louis H. Kauffman and Samuel J. Lomonaco Jr · 2007
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Simulation of topological field theories by quantum computers
Michael Freedman, Alexei Kitaev, and Zhenghan Wang · 2002
Cited alongside, same era.
A modular functor which is universal for quantum computation
Michael Freedman, Michael Larsen, and Zhenghan Wang · 2002
Cited alongside, same era.
Irreversible Quantum Dynamics
Daniel A. Lidar and K. Birgitta Whaley · 2003
Cited alongside, same era.
Scalable superconducting architecture for adiabatic quantum computation
William M. Kaminsky, Seth Lloyd, and Terry P. Orlando · 2004
Cited alongside, same era.
Generic quantum Fourier transforms
Cristopher Moore, Daniel Rockmore, and Alexander Russell · 2004
Cited alongside, same era.
Later among the works it cites.
John W. Barrett and Ileana Naish-Guzman · 2008
Later among the works it cites.
Universal computation by quantum walk
Andrew M. Childs · 2008
Later among the works it cites.
A quantum algorithm for the Hamiltonian NAND tree
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2008
Later among the works it cites.
The Princeton Companion to Mathematics
Timothy Gowers, June Barrow-Green, and Imre Leader, editors · 2008
Later among the works it cites.
Fast quantum algorithms for approximating some irreducible representations of groups
Stephen P. Jordan · 2008
Later among the works it cites.
Quantum Computation Beyond the Circuit Model
Stephen P. Jordan · 2008
Later among the works it cites.
Estimating Jones polynomials is a complete problem for one clean qubit
Peter W. Shor and Stephen P. Jordan · 2008
Later among the works it cites.
Efficient quantum circuits for arbitrary sparse unitaries
Stephen P. Jordan and Pawel Wocjan · 2009
Closest in time.
Estimating Jones and HOMFLY polynomials with one clean qubit
Stephen P. Jordan and Pawel Wocjan · 2009
Closest in time.