Fetching the paper…
Reading the bibliography…
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and characterize their computational complexity.
Chen-Ning Yang · 1967
Earlier work this paper cites.
Partition function of the eight-vertex lattice model
Rodney J Baxter · 1972
Earlier work this paper cites.
The complexity of coloring circular arcs and chords
Michael R Garey, David S Johnson, Gary L Miller, and Christos H Papadimitriou · 1980
Earlier work this paper cites.
The representation theory of the symmetric group
Gordon James and Adalbert Kerber · 1981
Earlier work this paper cites.
Pp is as hard as the polynomial-time hierarchy
Seinosuke Toda · 1991
Earlier work this paper cites.
A linear-time algorithm for edge-disjoint paths in planar graphs
Dorothea Wagner and Karsten Weihe · 1995
Earlier work this paper cites.
Power of one bit of quantum information
Emanuel Knill and Raymond Laflamme · 1998
Earlier work this paper cites.
Complexity limitations on quantum computation
Lance Fortnow and John D. Rogers · 1999
Earlier work this paper cites.
Universal fault-tolerant computation on decoherence-free subspaces
D Bacon, J Kempe, DA Lidar, and KB Whaley · 2000
Earlier work this paper cites.
Universal quantum computation with the exchange interaction
David P DiVincenzo, Dave Bacon, Julia Kempe, Guido Burkard, and K Birgitta Whaley · 2000
Earlier work this paper cites.
Efficient linear optics quantum computation
E Knill, R Laflamme, and G Milburn · 2000
Earlier work this paper cites.
Reversible space equals deterministic space
Klaus-Jörn Lange, Pierre McKenzie, and Alain Tapp · 2000
Earlier work this paper cites.
Encoded universality in physical implementations of a quantum computer
D Bacon, J Kempe, DP DiVincenzo, DA Lidar, and KB Whaley · 2001
Earlier work this paper cites.
Encoding a qubit in an oscillator
Daniel Gottesman, Alexei Kitaev, and John Preskill · 2001
Earlier work this paper cites.
Theory of decoherence-free fault-tolerant universal quantum computation
Julia Kempe, Dave Bacon, Daniel A Lidar, and K Birgitta Whaley · 2001
Cited alongside, same era.
Encoded universality from a single physical interaction
Julia Kempe, David Bacon, David P DiVincenzo, and K Brigitta Whaley · 2001
Cited alongside, same era.
A scheme for efficient quantum computation with linear optics
Emanuel Knill, Raymond Laflamme, and Gerald J Milburn · 2001
Cited alongside, same era.
Exact gate sequences for universal quantum computation using the xy interaction alone
Julia Kempe and K Birgitta Whaley · 2002
Cited alongside, same era.
Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games
Barbara M Terhal and David P DiVincenzo · 2002
Cited alongside, same era.
Power of anisotropic exchange interactions: Universality and efficient codes for quantum computing
A polynomial quantum algorithm for approximating the Jones polynomial
Dorit Aharonov, Vaughan Jones, and Zeph Landau · 2009
Later among the works it cites.
Computational complexity: a modern approach
Sanjeev Arora and Boaz Barak · 2009
Later among the works it cites.
Measurement-based quantum computation
HJ Briegel, DE Browne, W Dür, R Raussendorf, and Maarten Van den Nest · 2009
Later among the works it cites.
Permutational quantum computing
Stephen P Jordan · 2009
Later among the works it cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J. Bremner, Richard Jozsa, and Dan J. Shepherd · 2010
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L-A Wu and DA Lidar · 2002
Cited alongside, same era.
Topological quantum computation
Michael Freedman, Alexei Kitaev, Michael Larsen, and Zhenghan Wang · 2003
Cited alongside, same era.
The capacity of hybrid quantum memory
Greg Kuperberg · 2003
Cited alongside, same era.
Quantum computation by measurements
Debbie W Leung · 2004
Cited alongside, same era.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Cited alongside, same era.
The solovay-kitaev algorithm
Christopher M. Dawson and Michael A. Nielsen · 2006
Cited alongside, same era.
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 · 2007
Cited alongside, same era.
Scott Aaronson and Alex Arkhipov · 2011
Later among the works it cites.
The bqp-hardness of approximating the Jones polynomial
Dorit Aharonov and Itai Arad · 2011
Later among the works it cites.
Universal quantum computation and leakage reduction in the 3-qubit decoherence free subsystem
Bryan H Fong and Stephen M Wandzura · 2011
Later among the works it cites.
Denseness and Zariski denseness of Jones braid representations
Greg Kuperberg · 2011
Later among the works it cites.
Review of ads/cft integrability, chapter iii. 1: Bethe ansätze and the r-matrix formalism
Matthias Staudacher · 2012
Later among the works it cites.
Classical simulation of yang-baxter gates
Gorjan Alagic, Aniruddha Bapat, and Stephen Jordan · 2014
Later among the works it cites.
Universality of single quantum gates
Bela Bauer, Claire Levaillant, and Michael Freedman · 2014
Later among the works it cites.
Hardness of classically simulating the one-clean-qubit model
Tomoyuki Morimae, Keisuke Fujii, and Joseph F. Fitzsimons · 2014
Later among the works it cites.