{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:53:45Z","timestamp":1760122425795},"reference-count":21,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1093\/logcom\/exv008","type":"journal-article","created":{"date-parts":[[2015,2,28]],"date-time":"2015-02-28T02:04:51Z","timestamp":1425089091000},"page":"1-19","source":"Crossref","is-referenced-by-count":7,"title":["Universality of quantum Turing machines with deterministic control"],"prefix":"10.1093","volume":"27","author":[{"given":"P.","family":"Mateus","sequence":"first","affiliation":[]},{"given":"A.","family":"Sernadas","sequence":"additional","affiliation":[]},{"given":"A.","family":"Souto","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2015,2,26]]},"reference":[{"key":"2017012307250551000_27.1.1.1","doi-asserted-by":"publisher","DOI":"10.2178\/bsl.1903020"},{"key":"2017012307250551000_27.1.1.2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"2017012307250551000_27.1.1.3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1765"},{"key":"2017012307250551000_27.1.1.4","unstructured":"P. Boykin, T. Mor, M. Pulver, V. Roychowdhury and F. Vatan. On universal and fault-tolerant quantum computing. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 486\u2013494, 1999."},{"key":"2017012307250551000_27.1.1.5","unstructured":"R. Canetti, I. Damg\u00e5rd, S. Dziembowski, Y. Ishai and T. Malkin. On adaptive vs. non-adaptive security of multiparty protocols. In B. Pfitzmann, editor In Proceedings of Advances in Cryptology - EUROCRYPT 2001, vol. 2045 of Lecture Notes in Computer Science, pp. 262\u2013279. Springer, 2001."},{"key":"2017012307250551000_27.1.1.6","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"2017012307250551000_27.1.1.7","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"2017012307250551000_27.1.1.8","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/34\/35\/312"},{"key":"2017012307250551000_27.1.1.9","doi-asserted-by":"crossref","unstructured":"L. Grover. A fast quantum mechanical algorithm for database search. In G. Miller, editor Proceedings of the 28th annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM, 1996.","DOI":"10.1145\/237814.237866"},{"key":"2017012307250551000_27.1.1.10","doi-asserted-by":"publisher","DOI":"10.1145\/321356.321362"},{"key":"2017012307250551000_27.1.1.11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.95.200503"},{"key":"2017012307250551000_27.1.1.12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.913263"},{"key":"2017012307250551000_27.1.1.13","unstructured":"Nielsen M. Chuang I. Quantum Computation and Quantum Information. Cambridge University Press; 2000."},{"key":"2017012307250551000_27.1.1.14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0304-3975(01)00111-6","article-title":"Computational complexity of uniform quantum circuit families and quantum turing machines","volume":"276","author":"Nishimura","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"2017012307250551000_27.1.1.15","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-008-0091-8"},{"key":"2017012307250551000_27.1.1.16","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.09.026"},{"key":"2017012307250551000_27.1.1.17","doi-asserted-by":"crossref","unstructured":"Rozenberg G. Salomaa A. The Secret Number. An Exposition of Chaitin's Theory. World Scientific Publications Company; 2007. p. 175-215.","DOI":"10.1142\/9789812770837_0011"},{"key":"2017012307250551000_27.1.1.18","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144598347011"},{"key":"2017012307250551000_27.1.1.19","doi-asserted-by":"publisher","DOI":"10.1109\/18.945258"},{"key":"2017012307250551000_27.1.1.20","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1007\/s00037-003-0177-8","article-title":"On the complexity of simulating space-bounded quantum computations","volume":"12","author":"Watrous","year":"2004","journal-title":"Computational Complexity"},{"key":"2017012307250551000_27.1.1.21","doi-asserted-by":"crossref","first-page":"031123","DOI":"10.1103\/PhysRevE.74.031123","article-title":"Ground state overlap and quantum phase transitions","volume":"74","author":"Zanardi","year":"2006","journal-title":"Physical Review E"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/27\/1\/1\/9688079\/exv008.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T11:08:53Z","timestamp":1566385733000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exv008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,26]]},"references-count":21,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,23]]},"published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1093\/logcom\/exv008"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exv008","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,26]]}}}