{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T22:12:51Z","timestamp":1777414371372,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00325-5","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:25:18Z","timestamp":1034007918000},"page":"457-471","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":51,"title":["Expressiveness of matchgates"],"prefix":"10.1016","volume":"289","author":[{"given":"Leslie G.","family":"Valiant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0304-3975(01)00325-5_BIB1","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","article-title":"Elementary gates for quantum computation","volume":"52","author":"Barenco","year":"1995","journal-title":"Phys. Rev. A"},{"key":"10.1016\/S0304-3975(01)00325-5_BIB2","series-title":"Combinatorial Matrix Theory","author":"Brualdi","year":"1991"},{"key":"10.1016\/S0304-3975(01)00325-5_BIB3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1098\/rspa.1989.0099","article-title":"Quantum computational networks","volume":"425","author":"Deutsch","year":"1989","journal-title":"Proc. R. Soc. Lond. A"},{"key":"10.1016\/S0304-3975(01)00325-5_BIB4","series-title":"Matrices and Matroids for Systems Analysis","author":"Murota","year":"2000"},{"key":"10.1016\/S0304-3975(01)00325-5_BIB5","series-title":"Quantum Computation and Quantum Information","author":"Nielsen","year":"2000"},{"key":"10.1016\/S0304-3975(01)00325-5_BIB6","series-title":"Models of Computation","author":"Savage","year":"1998"},{"issue":"5","key":"10.1016\/S0304-3975(01)00325-5_BIB7","doi-asserted-by":"crossref","first-page":"1489","DOI":"10.1137\/S0097539795293172","article-title":"Algorithms for quantum computation: discrete logarithms and factoring","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/S0304-3975(01)00325-5_BIB8","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/3149.3158","article-title":"A complexity theory based on boolean algebra","volume":"32","author":"Skyum","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00325-5_BIB9","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, Quantum circuits that can be simulated classically in polynomial time, SIAM J. Computing, to appear; Extended abstract in Proc. 33rd ACM Symp. on Theory of Computing, ACM Press, New York, 2001 pp. 114\u2013123.","DOI":"10.1145\/380752.380785"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:17Z","timestamp":1759625537000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003255"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00325-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Expressiveness of matchgates","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00325-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}