{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T23:10:04Z","timestamp":1768777804774,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,5,27]],"date-time":"2006-05-27T00:00:00Z","timestamp":1148688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s11128-006-0023-4","type":"journal-article","created":{"date-parts":[[2006,5,26]],"date-time":"2006-05-26T09:02:11Z","timestamp":1148634131000},"page":"161-177","source":"Crossref","is-referenced-by-count":43,"title":["On the Role of Hadamard Gates in Quantum Circuits"],"prefix":"10.1007","volume":"5","author":[{"given":"D. J.","family":"Shepherd","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,27]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"S. Aaronson and D. Gottesman, Phys. Rev. A 70, 052328 (2004).","DOI":"10.1103\/PhysRevA.70.052328"},{"key":"23_CR2","unstructured":"D. Aharonov, A Simple Proof that Toffoli and Hadamard are Quantum Universal (quant-ph\/0301040)."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"A. Ambainis, J. Comp. Syst. Sci. 64, (2002).","DOI":"10.1006\/jcss.2002.1826"},{"key":"23_CR4","unstructured":"A. Y. Kitaev, (quant-ph\/9511026)."},{"key":"23_CR5","volume-title":"Quantum Computation and Quantum Information","author":"M. Nielsen","year":"2000","unstructured":"Nielsen M. and Chuang I. (2000). Quantum Computation and Quantum Information. Cambridge University Press, Cambridge"},{"key":"23_CR6","volume-title":"Computational Complexity, Ch 15","author":"C. Papadimitriou","year":"1994","unstructured":"Papadimitriou C. (1994). Computational Complexity, Ch 15. Addison Wesley, New York"},{"key":"23_CR7","unstructured":"Y. Shi, Quantum and Classical Tradeoffs (quant-ph\/0312213) To appear in Theoretical Computer Science (2005)."},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C. Zalka","year":"1999","unstructured":"Zalka C. (1999). Phys. Rev. A 60:2746\u20132751","journal-title":"Phys. Rev. A"},{"key":"23_CR9","unstructured":"http:\/\/qwiki.caltech.edu\/wiki\/Complexity_Zoo"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-006-0023-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-006-0023-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-006-0023-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:36:25Z","timestamp":1559360185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-006-0023-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,27]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["23"],"URL":"https:\/\/doi.org\/10.1007\/s11128-006-0023-4","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,27]]}}}