Binary Matroids and Quantum Probability Distributions

Fisher, M. E. (1966). On the Dimer Solution of Planar Ising Models, J. Math. Phys. Vol. 7, No. 10, pp 1776–1781

1966

Earlier work this paper cites.

Kasteleyn, P. W. (1967). Graph theory and crystal physics, in Harary, F., Graph Theory and Theoretical Physics , New York: Academic Press, pp 43–110

1967

Earlier work this paper cites.

Vertigan, D. (2006/1989). The Computational Complexity of Tutte Invariants for Planar Graphs, Siam J. Comput. , Vol. 35, No. 3, pp 690–712

1989

Earlier work this paper cites.

Jaeger, F. & Vertigan, D. L. & Welsh, D. J. A. (1990). On the computational complexity of the Jones and Tutte polynomials, Math. Proc. Camb. Phil. Soc. 108

1990

Earlier work this paper cites.

Welsh, D. J. A., (1990). The Computational Complexity of Some Classical Problems from Statistical Physics, Disorder in physical systems pp 307–321, - Oxford University Press, USA

Original

1990

Earlier work this paper cites.

Andrzejak, A. (1995). A polynomial-time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth, Serie B Informatik

1995

Cited alongside, same era.

Vertigan, D. (1998). Bicycle Dimension and Special Points of the Tutte Polynomial, Journal of Combinatorial Theory, B 74

1998

Cited alongside, same era.

Aaronson, S. & Gottesman, D. (2004). Improved Simulation of Stabilizer Circuits, ( quant-ph/0406196 )

2004

Cited alongside, same era.

Aaronson, S. (2005). Quantum computing, postselection, and probabilistic polynomial-time, Proc. Royal Soc. A , 461 pp 3473–3483. ( quant-ph/0412187 )

2005

Cited alongside, same era.

Høyer, P. & Spalek, R. (2005). Quantum circuits with unbounded fan-out, Theory of Computing , 1, no. 5, pp 81–103. ( quant-ph/0208043 )

2005

Cited alongside, same era.

Browne, D. E. & Briegel, H. J. (2006). OneÐway Quantum Computation, Lectures on quantum information , pp 359–380. ( quant-ph/0603226 )

2006

Later among the works it cites.

Oxley, James. Matroid Theory . Oxford University Press (2006)

2006

Later among the works it cites.

DJS. & Bremner, M. J. (2008). Temporally unstructured quantum computation, Proc. Royal Soc. A 465

Original

2008

Later among the works it cites.

DJS. (2009). Quantum Complexity : restrictions on algorithms and architectures , (Ch 5) PhD thesis, University of Bristol

2009

Later among the works it cites.

Bremner, M. & Jozsa, R. & DJS. (2010). Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy. ( arXiv/1005.1407 )

Original

2010

Closest in time.