{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T23:09:21Z","timestamp":1781651361129,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540006244","type":"print"},{"value":"9783540364986","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36498-6_18","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T18:28:14Z","timestamp":1181240894000},"page":"309-323","source":"Crossref","is-referenced-by-count":11,"title":["Quantum Computing and Abstract State Machines"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antje","family":"Nowack","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2003,3,14]]},"reference":[{"key":"18_CR1","unstructured":"A. Blass and Y. Gurevich, Abstract state machines capture parallel algorithms, Tech. Rep. MSR-TR-2001-117, Microsoft Research, 2001. 310, 312, 315, 316, 318"},{"key":"18_CR2","unstructured":"J. Gruska, Quantum Computing, McGraw-Hill, 1999. 312, 320"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/343369.343384","volume":"1","author":"Y. Gurevich","year":"2000","unstructured":"Y. Gurevich, Sequential Abstract State Machines capture sequential algorithms, ACM Transactions on Computational Logic, 1 (2000), pp. 77\u2013111. 309, 310, 311, 318","journal-title":"ACM Transactions on Computational Logic"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Y. Gurevich, Logician in the land of OS: Abstract State Machines in Microsoft, in Proc. 16th IEEE Symp. on Logic in Computer Science, 2001, pp. 129\u2013136. 309","DOI":"10.1109\/LICS.2001.932489"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"M. Hirvensalo, Quantum Computing, Springer, 2001. 312, 320","DOI":"10.1007\/978-3-662-04461-2"},{"key":"18_CR6","unstructured":"M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000. 312"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"P. Shor, Polynomial-time algorithms for prime factorization and discrete loga-rithms on a quantum computer, SIAM Journal on Computing, 26 (1997), pp. 1484\u20131509. 310","journal-title":"SIAM Journal on Computing"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1038\/414883a","volume":"414","author":"L. Vandersypen","year":"2001","unstructured":"L. Vandersypen, M. Steffen, G. Breyta, C. Yannoni, M. Sherwood, and I. Chuang, Experimental realization of Shor\u2019s quantum factoring algorithm using nuclear magnetic resonance, Nature, 414 (2001), pp. 883\u2013887. 310","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Abstract State Machines 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36498-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T20:27:02Z","timestamp":1556483222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36498-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006244","9783540364986"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36498-6_18","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}