{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T15:22:51Z","timestamp":1771514571756,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T00:00:00Z","timestamp":1505260800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00037-017-0162-2","type":"journal-article","created":{"date-parts":[[2017,9,13]],"date-time":"2017-09-13T05:52:15Z","timestamp":1505281935000},"page":"765-833","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["The Complexity of Approximating complex-valued Ising and Tutte partition functions"],"prefix":"10.1007","volume":"26","author":[{"given":"Leslie Ann","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heng","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,13]]},"reference":[{"issue":"2063","key":"162_CR1","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1098\/rspa.2005.1546","volume":"461","author":"Scott Aaronson","year":"2005","unstructured":"Aaronson Scott (2005) Quantum computing, postselection, and probabilistic polynomial-time. Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 461(2063): 3473\u20133482","journal-title":"Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci."},{"key":"162_CR2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.4086\/toc.2013.v009a004","volume":"9","author":"Scott Aaronson","year":"2013","unstructured":"Aaronson Scott, Arkhipov Alex (2013) The Computational Complexity of Linear Optics. Theory of Computing 9: 143\u2013252","journal-title":"Theory of Computing"},{"key":"162_CR3","unstructured":"Dorit Aharonov & Itai Arad (2011). The BQP-hardness of approximating the Jones polynomial. New Journal of Physics 13(3), 035 019."},{"issue":"5\u20136","key":"162_CR4","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1017\/S0963548305007005","volume":"14","author":"M. Bordewich","year":"2005","unstructured":"Bordewich M., Freedman M., Lov\u00e1sz L., Welsh D. (2005) Approximate Counting and Quantum Computation. Combin. Probab. Comput. 14(5\u20136): 737\u2013754","journal-title":"Combin. Probab. Comput."},{"key":"162_CR5","unstructured":"Michael J. Bremner, Richard Jozsa & Dan J. Shepherd (2011). Classical Simulation of Commuting Quantum Computations implies Collapse of the Polynomial Hierarchy. Proc. R. Soc. A 467(2126), 459\u2013472."},{"key":"162_CR6","doi-asserted-by":"crossref","unstructured":"Y. Bugeaud (2004). Approximation by Algebraic Numbers. Cambridge Tracts in Mathematics. Cambridge University Press. ISBN 9781139455671.","DOI":"10.1017\/CBO9780511542886"},{"issue":"1","key":"162_CR7","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.jcss.2013.07.003","volume":"80","author":"Jin-Yi Cai","year":"2014","unstructured":"Cai Jin-Yi, Lu Pinyan, Xia Mingji (2014) The complexity of complex weighted Boolean #CSP. J. Comput. Syst. Sci. 80(1): 217\u2013236","journal-title":"J. Comput. Syst. Sci."},{"key":"162_CR8","doi-asserted-by":"crossref","unstructured":"G. De las Cuevas, W. D\u00fcr, M. Van den Nest & M. A. Martin-Delgado (2011). Quantum algorithms for classical lattice models. New Journal of Physics 13(9), 093 021.","DOI":"10.1088\/1367-2630\/13\/9\/093021"},{"key":"162_CR9","doi-asserted-by":"crossref","unstructured":"Michael H. Freedman, Alexei Kitaev, Michael J. Larsen & Zhenghan Wang (2003). Topological quantum computation. Bull. Amer. Math. Soc. (N.S.) 40(1), 31\u201338.","DOI":"10.1090\/S0273-0979-02-00964-3"},{"issue":"3","key":"162_CR10","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s002200200645","volume":"227","author":"Michael H. Freedman","year":"2002","unstructured":"H. Freedman Michael, Larsen Michael, Wang Zhenghan (2002) A modular functor which is universal for quantum computation. Comm. Math. Phys. 227(3): 605\u2013622","journal-title":"Math. Phys."},{"key":"162_CR11","unstructured":"Keisuke Fujii & Tomoyuki Morimae (2013). Quantum Commuting Circuits and Complexity of Ising Partition Functions. CoRR arXiv:1311.2128 ."},{"key":"162_CR12","unstructured":"Joseph Geraci & Daniel A Lidar (2010). Classical Ising model test for quantum circuits. New Journal of Physics 12(7), 075 026."},{"issue":"7","key":"162_CR13","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1016\/j.ic.2008.04.003","volume":"206","author":"Leslie Ann Goldberg","year":"2008","unstructured":"Ann Goldberg Leslie, Jerrum Mark (2008) Inapproximability of the Tutte polynomial. Inf. Comput. 206(7): 908\u2013929","journal-title":"Inf. Comput."},{"issue":"4","key":"162_CR14","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s00037-012-0046-4","volume":"21","author":"Leslie Ann Goldberg","year":"2012","unstructured":"Ann Goldberg Leslie, Jerrum Mark (2012) Inapproximability of the Tutte polynomial of a planar graph. Computational Complexity 21(4): 605\u2013642","journal-title":"Computational Complexity"},{"issue":"6","key":"162_CR15","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1137\/12088330X","volume":"43","author":"Leslie Ann Goldberg","year":"2014","unstructured":"Ann Goldberg Leslie, Jerrum Mark (2014) The Complexity of Computing the Sign of the Tutte Polynomial. SIAM J. Comput. 43(6): 1921\u20131952","journal-title":"SIAM J. Comput."},{"issue":"205","key":"162_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/j.aop.2013.11.001","volume":"340","author":"S. Iblisdir","year":"2014","unstructured":"Iblisdir S., Cirio M., Kerans O., Brennen G. K. (2014) Low depth quantum circuits for Ising models. Annals of Physics 340(205): 205\u2013251","journal-title":"Annals of Physics"},{"issue":"1","key":"162_CR17","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1017\/S0305004100068936","volume":"108","author":"F. Jaeger","year":"1990","unstructured":"Jaeger F., Vertigan D. L., Welsh D. J. A. (1990) On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Cambridge Philos. Soc. 108(1): 35\u201353","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"5","key":"162_CR18","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1137\/0222066","volume":"22","author":"Mark Jerrum","year":"1993","unstructured":"Jerrum Mark, Sinclair Alistair (1993) Polynomial-Time Approximation Algorithms for the Ising Model. SIAM J. Comput. 22(5): 1087\u20131116","journal-title":"SIAM J. Comput."},{"issue":"7&8","key":"162_CR19","first-page":"633","volume":"14","author":"Richard Jozsa","year":"2014","unstructured":"Jozsa Richard, Van den Nest Marrten (2014) Classical Simulation Complexity of Extended Clifford Circuits. Quantum Info. Comput. 14(7&8): 633\u2013648","journal-title":"Quantum Info. Comput."},{"key":"162_CR20","doi-asserted-by":"crossref","first-page":"183","DOI":"10.4086\/toc.2015.v011a006","volume":"11","author":"Greg Kuperberg","year":"2015","unstructured":"Kuperberg Greg (2015) How Hard Is It to Approximate the Jones Polynomial?. Theory of Computing 11: 183\u2013219","journal-title":"Theory of Computing"},{"key":"162_CR21","doi-asserted-by":"crossref","unstructured":"A. Matsuo, K. Fujii & N. Imoto (2014). A quantum algorithm for additive approximation of Ising partition functions. Phys. Rev. A 90, 022 304.","DOI":"10.1103\/PhysRevA.90.022304"},{"key":"162_CR22","unstructured":"Michael A. Nielsen & Isaac L. Chuang (2004). Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences). Cambridge University Press, 1st edition. ISBN 0521635039."},{"issue":"4","key":"162_CR23","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1137\/0212053","volume":"12","author":"J. Scott Provan","year":"1983","unstructured":"Scott Provan J., O. Ball Michael (1983) The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected. SIAM J. Comput. 12(4): 777\u2013788","journal-title":"SIAM J. Comput."},{"key":"162_CR24","unstructured":"Dan Shepherd (2010). Binary Matroids and Quantum Probability Distributions. CoRR arXiv:1005.1744 ."},{"key":"162_CR25","doi-asserted-by":"crossref","unstructured":"Dan J. Shepherd & Michael J. Bremner (2009). Temporally Unstructured Quantum Computation. Proc. R. Soc. A 465(2105), 1413\u20131439.","DOI":"10.1098\/rspa.2008.0443"},{"key":"162_CR26","doi-asserted-by":"crossref","unstructured":"Alan D. Sokal (2005). The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In Surveys in combinatorics 2005, volume 327 of London Math. Soc. Lecture Note Ser., 173\u2013226. Cambridge Univ. Press, Cambridge.","DOI":"10.1017\/CBO9780511734885.009"},{"issue":"3","key":"162_CR27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0040-9383(87)90003-6","volume":"26","author":"Morwen B. Thistlethwaite","year":"1987","unstructured":"B. Thistlethwaite Morwen (1987) A spanning tree expansion of the Jones polynomial. Topology 26(3): 297\u2013309","journal-title":"Topology"},{"issue":"3","key":"162_CR28","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","volume":"47","author":"Leslie G. Valiant","year":"1986","unstructured":"G. Valiant Leslie, V. Vazirani Vijay (1986) NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3): 85\u201393","journal-title":"Theor. Comput. Sci."},{"issue":"160","key":"162_CR29","first-page":"563","volume":"39","author":"Abraham Ziv","year":"1982","unstructured":"Ziv Abraham (1982) Relative distance\u2014an error measure in round-off error analysis. Math. Comp. 39(160): 563\u2013569","journal-title":"Math. Comp."}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-017-0162-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-017-0162-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-017-0162-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T07:56:19Z","timestamp":1570089379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-017-0162-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,13]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["162"],"URL":"https:\/\/doi.org\/10.1007\/s00037-017-0162-2","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,13]]}}}