1. Aharonov, D., Arad, I., Eban, E. & Landau, Z. Polynomial quantum algorithms for additive approximations of the Potts model and other points of the Tutte plane. Preprint at https://arxiv.org/abs/quant-ph/0702008 (2007).
2. Shepherd, D. Binary matroids and quantum probability distributions. Preprint at https://arxiv.org/abs/1005.1744 (2010).
3. Fenner, S., Green, F., Homer, S. & Pruim, R. Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy. Proc. Math. Phys. Eng. Sci. 455, 3953–3966 (1999).
4. Markov, I. L. & Shi, Y. Simulating quantum computation by contracting tensor networks. SIAM J. Comput. 38, 963–981 (2008).
5. Shepherd, D. & Bremner, M. J. Temporally unstructured quantum computation. Proc. Math. Phys. Eng. Sci. 465, 1413–1439 (2009).