{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:05:35Z","timestamp":1761674735503},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s0020-0190(00)00222-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"173-179","source":"Crossref","is-referenced-by-count":22,"title":["Quantum computing and quadratically signed weight enumerators"],"prefix":"10.1016","volume":"79","author":[{"given":"E.","family":"Knill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Laflamme","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00222-2_BIB001","series-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science","first-page":"124","article-title":"Algorithms for quantum computation: Discrete logarithms and factoring","author":"Shor","year":"1994"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB002","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00222-2_BIB003","series-title":"Proceedings of the Symposium on the Foundations of Computer Science","first-page":"56","article-title":"Fault-tolerant quantum computation","author":"Shor","year":"1996"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB004","first-page":"53","article-title":"Quantum computations: algorithms and error correction","volume":"52","author":"Kitaev","year":"1997","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB005","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1126\/science.279.5349.342","article-title":"Resilient quantum computation","volume":"279","author":"Knill","year":"1998","journal-title":"Science"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB006","series-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computation (STOC)","first-page":"176","article-title":"Fault-tolerant quantum computation with constant error","author":"Aharonov","year":"1996"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB007","author":"Aharonov"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB008","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","article-title":"Quantum complexity theory","volume":"26","author":"Bernstein","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00222-2_BIB009","doi-asserted-by":"crossref","first-page":"5672","DOI":"10.1103\/PhysRevLett.81.5672","article-title":"On the power of one bit of quantum information","volume":"81","author":"Knill","year":"1998","journal-title":"Phys. Rev. Lett."},{"key":"10.1016\/S0020-0190(00)00222-2_BIB010","series-title":"Annual Reviews of Computational Physics VI","article-title":"Quantum computation","author":"Aharonov","year":"1999"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB011","author":"Cleve"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB012","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(88)90030-2","article-title":"Promise problems complete for complexity classes","volume":"78","author":"Selman","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0020-0190(00)00222-2_BIB013","series-title":"Complexity Theory: Current Research","first-page":"101","article-title":"Promises and fault-tolerant database access","author":"Cay","year":"1993"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB014","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB015","first-page":"53","article-title":"Bycycle dimension and special points of the Tutte polynomial","volume":"220","author":"Vertigan","year":"1992","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB016","doi-asserted-by":"crossref","first-page":"1524","DOI":"10.1137\/S0097539795293639","article-title":"Quantum computability","volume":"26","author":"Adleman","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00222-2_BIB017","unstructured":"R. Solovay, A. Yao, Manuscript, 1996"},{"key":"10.1016\/S0020-0190(00)00222-2_BIB018","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/0218053","article-title":"Time\/space trade-offs for reversible computation","volume":"18","author":"Bennett","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00222-2_BIB019","unstructured":"R.M. Solovay, Private communication, 1998"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000002222?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000002222?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:22:17Z","timestamp":1556158937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000002222"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0020019000002222"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00222-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}