Fetching the paper…
Reading the bibliography…
We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters.
Relative distance—an error measure in round-off error analysis
Abraham Ziv · 1982
Earlier work this paper cites.
The complexity of counting cuts and of computing the probability that a graph is connected
J. Scott Provan and Michael O. Ball · 1983
Earlier work this paper cites.
NP is as easy as detecting unique solutions
Leslie G. Valiant and Vijay V. Vazirani · 1986
Earlier work this paper cites.
A spanning tree expansion of the Jones polynomial
Morwen B. Thistlethwaite · 1987
Earlier work this paper cites.
On the computational complexity of the Jones and Tutte polynomials
F. Jaeger, D. L. Vertigan, and D. J. A. Welsh · 1990
Earlier work this paper cites.
Polynomial-time approximation algorithms for the Ising model
Mark Jerrum and Alistair Sinclair · 1993
Earlier work this paper cites.
Topological quantum computation
Michael H. Freedman, Alexei Kitaev, Michael J. Larsen, and Zhenghan Wang · 2000
Earlier work this paper cites.
A modular functor which is universal for quantum computation
Michael H. Freedman, Michael Larsen, and Zhenghan Wang · 2002
Earlier work this paper cites.
Approximation by Algebraic Numbers
Y. Bugeaud · 2004
Earlier work this paper cites.
Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences)
Michael A. Nielsen and Isaac L. Chuang · 2004
Earlier work this paper cites.
Quantum computing, postselection, and probabilistic polynomial-time
Scott Aaronson · 2005
Cited alongside, same era.
Approximate counting and quantum computation
M. Bordewich, M. Freedman, L. Lovász, and D. Welsh · 2005
Cited alongside, same era.
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
Alan D. Sokal · 2005
Cited alongside, same era.
Inapproximability of the Tutte polynomial
Leslie Ann Goldberg and Mark Jerrum · 2008
Cited alongside, same era.
Temporally unstructured quantum computation
Dan J. Shepherd and Michael J. Bremner · 2009
Cited alongside, same era.
Classical Ising model test for quantum circuits
Joseph Geraci and Daniel A Lidar · 2010
Cited alongside, same era.
Inapproximability of the Tutte polynomial of a planar graph
Leslie Ann Goldberg and Mark Jerrum · 2012
Later among the works it cites.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2013
Later among the works it cites.
Quantum commuting circuits and complexity of Ising partition functions
Keisuke Fujii and Tomoyuki Morimae · 2013
Later among the works it cites.
The complexity of complex weighted Boolean #CSP
Jin-Yi Cai, Pinyan Lu, and Mingji Xia · 2014
Closest in time.
The complexity of computing the sign of the Tutte polynomial
Leslie Ann Goldberg and Mark Jerrum · 2014
Closest in time.
Low depth quantum circuits for Ising models
S. Iblisdir, M. Cirio, O. Kerans, and G. K. Brennen · 2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dan Shepherd · 2010
Cited alongside, same era.
The BQP-hardness of approximating the Jones polynomial
Dorit Aharonov and Itai Arad · 2011
Cited alongside, same era.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J. Bremner, Richard Jozsa, and Dan J. Shepherd · 2011
Cited alongside, same era.
Quantum algorithms for classical lattice models
G. De las Cuevas, W. Dür, M. Van den Nest, and M. A. Martin-Delgado · 2011
Cited alongside, same era.
Classical simulation complexity of extended Clifford circuits
Richard Jozsa and Marrten Van den Nest · 2014
Closest in time.
A quantum algorithm for additive approximation of Ising partition functions
A. Matsuo, K. Fujii, and N. Imoto · 2014
Closest in time.
How hard is it to approximate the Jones polynomial?
Greg Kuperberg · 2015
Closest in time.