Fetching the paper…
Reading the bibliography…
We classify two-qubit commuting Hamiltonians in terms of their computational complexity.
La théorie des groupes finis et continus et l’analysis situs
E. Cartan · 1930
Earlier work this paper cites.
The geometry of discrete groups
A. F. Beardon · 1983
Earlier work this paper cites.
The complexity of approximate counting
L. Stockmeyer · 1983
Earlier work this paper cites.
PP is as hard as the polynomial-time hierarchy
S. Toda · 1991
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
P. W. Shor · 1994
Earlier work this paper cites.
Universality in quantum computation
D. Deutsch, A. Barenco and A. Ekert · 1995
Earlier work this paper cites.
Almost any quantum logic gate is universal
S. Lloyd · 1995
Earlier work this paper cites.
Threshold Computation and Cryptographic Security
Y. Han, L. A. Hemaspaandra, and T. Thierauf · 1997
Earlier work this paper cites.
Power of One Bit of Quantum Information
E. Knill and R. Laflamme · 1998
Earlier work this paper cites.
On the universality of almost every quantum logic gate
N. Weaver · 2000
Earlier work this paper cites.
A practical scheme for quantum computation with any two-qubit entangling gate
M. J. Bremner, C. M. Dawson, J. L. Dodd, A. Gilchrist, A. W. Harrow, D. Mortimer, M. A. Nielsen, and T. J. Osborne · 2002
Earlier work this paper cites.
Universal quantum computation and simulation using any entangling Hamiltonian and local unitaries
J. L. Dodd, M. A. Nielsen, M. J. Bremner, and R. T. Thew · 2002
Earlier work this paper cites.
Classical simulation of noninteracting-fermion quantum circuits
B. M. Terhal and D. P. DiVincenzo · 2002
Earlier work this paper cites.
Quantum circuits that can be simulated classically in polynomial time
L. Valiant · 2002
Cited alongside, same era.
Lie Groups, Lie Algebras, and Representations: An Elementary Introduction
B. Hall · 2003
Cited alongside, same era.
Polynomial time and extravagant models, in The tale of one-way functions
L. A. Levin · 2003
Cited alongside, same era.
Quantum computing, postselection, and probabilistic polynomial-time
S. Aaronson · 2005
Cited alongside, same era.
The Solovay-Kitaev algorithm
C. M. Dawson and M. A. Nielsen · 2006
Cited alongside, same era.
Polynomial Quantum Algorithms for Additive approximations of the Potts model and other Points of the Tutte Plane
D. Aharonov, I. Arad, E. Eban, and Z. Landau · 2007
Cited alongside, same era.
The BQP-hardness of approximating the Jones Polynomial
D. Aharonov and I. Arad · 2011
Later among the works it cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
M. J. Bremner, R. Jozsa, and D. J. Shepherd · 2011
Later among the works it cites.
Characterization of universal two-qubit Hamiltonians
A. M. Childs, D. Leung, L. Mančinska, and M. Ozols · 2011
Later among the works it cites.
How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
G. Kalai · 2011
Later among the works it cites.
The Computational Complexity of Linear Optics
S. Aaronson and A. Arkhipov · 2013
Later among the works it cites.
Commuting quantum circuits: efficient classical simulations versus hardness results
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
P. Aliferis, F. Brito, D. P. DiVincenzo, J. Preskill, M. Steffen, and B. M. Terhal · 2009
Cited alongside, same era.
Computational Complexity: A Modern Approach
S. Arora and B. Barak · 2009
Cited alongside, same era.
Quantum Complexity: restrictions on algorithms and architectures
D. Shepherd · 2009
Cited alongside, same era.
Temporally unstructured quantum computation
D. Shepherd and M. J. Bremner · 2009
Cited alongside, same era.
Permutational quantum computing
S. P. Jordan · 2010
Cited alongside, same era.
Binary Matroids and Quantum Probability Distributions
D. Shepherd · 2010
Cited alongside, same era.
X. Ni and M. Van den Nest · 2013
Later among the works it cites.
Complexity classification of local Hamiltonian problems
T. Cubitt and A. Montanaro · 2014
Later among the works it cites.
Impossibility of Classically Simulating One-Clean-Qubit Computation
K. Fujii, H. Kobayashi, T. Morimae, H. Nishimura, S. Tamate, and S. Tani · 2014
Later among the works it cites.
On the hardness of classically simulating the one clean qubit model
T. Morimae, K. Fujii, and J. F. Fitzsimons · 2014
Later among the works it cites.
Commuting Quantum Circuits with Few Outputs are Unlikely to be Classically Simulatable
Y. Takahashi, S. Tani, T. Yamazaki, and K. Tanaka · 2014
Later among the works it cites.
Average-case complexity versus approximate simulation of commuting quantum computations
M. J. Bremner, A. Montanaro, and D. J. Shepherd · 2015
Later among the works it cites.
The Power of Quantum Fourier Sampling
B. Fefferman and C. Umans · 2015
Later among the works it cites.