{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T10:10:05Z","timestamp":1748340605821,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Theoretical Physics"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1021031915281","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:20:13Z","timestamp":1048206013000},"page":"1627-1639","source":"Crossref","is-referenced-by-count":8,"title":["Quantum Pushdown Automata"],"prefix":"10.1007","volume":"41","author":[{"given":"Daowen","family":"Qiu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"452093_CR1","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"P. Benioff","year":"1980","unstructured":"Benioff, P. (1980). The computer as a physical system: Amicroscopic quantum mechanical Hamiltonian model of computers as represented byTuring machines. Journal of Statistical Physics\n22, 563\u2013591.","journal-title":"Journal of Statistical Physics"},{"key":"452093_CR2","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E. and Vazirani, U. (1997). Quantum complexity theory. SIAM Journal on Computing\n26, 1411\u20131473.","journal-title":"SIAM Journal on Computing"},{"key":"452093_CR3","first-page":"97","volume":"400","author":"D. Deutsh","year":"1985","unstructured":"Deutsh, D. (1985). Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A\n400, 97\u2013117.","journal-title":"Proceedings of the Royal Society of London A"},{"key":"452093_CR4","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R. P. Feynman","year":"1982","unstructured":"Feynman, R. P. (1982). Simulting physics with computers. International Journal of Theoretical Physics\n21, 467\u2013488.","journal-title":"International Journal of Theoretical Physics"},{"key":"452093_CR5","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF01886518","volume":"16","author":"R. P. Feynman","year":"1986","unstructured":"Feynman, R. P. (1986). Quantum mechanical computers. Foundation of Physics\n16, 507\u2013531.","journal-title":"Foundation of Physics"},{"key":"452093_CR6","first-page":"336","volume-title":"Lecture Notes in Computer Science, Vol. 1963","author":"M. Golovkins","year":"2000","unstructured":"Golovkins, M. (2000). Quantum pushdown automata. In Lecture Notes in Computer Science, Vol. 1963, Spring-Verlag, Berlin, pp. 336\u2013346."},{"key":"452093_CR7","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J. (1999). Quantum Computing, McGraw-Hill, London."},{"key":"452093_CR8","doi-asserted-by":"crossref","first-page":"2261","DOI":"10.1023\/A:1026663432352","volume":"38","author":"S. Gudder","year":"1999","unstructured":"Gudder, S. (1999). Quantum automata: An overview. International Journal of Theoretical Physics\n38, 2261\u20132282.","journal-title":"International Journal of Theoretical Physics"},{"key":"452093_CR9","doi-asserted-by":"crossref","first-page":"2151","DOI":"10.1023\/A:1003692611402","volume":"39","author":"S. Gudder","year":"2000","unstructured":"Gudder, S. (2000). Quantum computers. International Journal of Theoretical Physics\n39, 2151\u20132177.","journal-title":"International Journal of Theoretical Physics"},{"key":"452093_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"Hopcroft, J. E. and Ullman, J. D. (1979). Introduction to Automata Theory, Languages, and Computation, Addision-Wesley, New York."},{"key":"452093_CR11","first-page":"66","volume-title":"Proceedings of 38th Symposium on Foundations of Computer Science","author":"A. Kondacs","year":"1997","unstructured":"Kondacs, A. and Watrous, J. (1997). On the power of finite state automata. In Proceedings of 38th Symposium on Foundations of Computer Science, IEEE Press, Piscataway, New Jersey. pp. 66\u201375."},{"key":"452093_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0304-3975(98)00059-0","volume":"207","author":"I. I. Macarie","year":"1998","unstructured":"Macarie, I. I. and Ogihara, M. (1998). Properties of probabilistic pushdown automata. Theoretical Computer Science\n207, 117\u2013130.","journal-title":"Theoretical Computer Science"},{"key":"452093_CR13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore, C. and Crutchfield, J. P. (2000). Quantum automata and quantum grammars. Theoretical Computer Science\n237, 275\u2013306.","journal-title":"Theoretical Computer Science"},{"key":"452093_CR14","volume-title":"Quantum Computation and Quantum Information","author":"M. A. Nielsen","year":"2000","unstructured":"Nielsen, M. A. and Chuang, I. L. (2000). Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK."},{"key":"452093_CR15","first-page":"164","volume":"404","author":"A. K. Pati","year":"2000","unstructured":"Pati, A. K. and Braunstein, S. L. (2000). Impossibility of deleting an unknown quantum states. Nature (London) 404, 164\u2013165.","journal-title":"Nature"},{"key":"452093_CR16","volume-title":"Introduction to Probabilistic Automatas","author":"A. Paz","year":"1971","unstructured":"Paz, A. (1971). Introduction to Probabilistic Automatas, Academic Press, New York."},{"key":"452093_CR17","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1023\/A:1015731405826","volume":"41","author":"D. W. Qiu","year":"2002","unstructured":"Qiu, D. W. (2002). Characterization of sequential quantum machines. International Journal of Theoretical Physics\n41, 811\u2013822.","journal-title":"International Journal of Theoretical Physics"},{"key":"452093_CR18","unstructured":"Qiu, D. W. and Ying, M. S. (manuscript submitted for publication). Characterizations of quantum automata."},{"key":"452093_CR19","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/SFCS.1994.365700","volume-title":"Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe","author":"P. W. Shor","year":"1994","unstructured":"Shor, P. W. (1994). Polynomial-time algorithm for prime factorization and discrete logarithms on quantum computer. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, IEEE Computer Society Press, Silver Spring, MO, pp. 124\u2013134."},{"key":"452093_CR20","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W. K. Wootters","year":"1982","unstructured":"Wootters, W. K. and Zurek, W. H. (1982). A single quantum cannot be cloned. Nature (London) 299, 802\u2013803.","journal-title":"Nature"},{"key":"452093_CR21","first-page":"352","volume-title":"Proceedings of 34th Symposium on Foundations of Computer","author":"A. C. Yao","year":"1993","unstructured":"Yao, A. C. (1993). Quantum circuit complexity. In Proceedings of 34th Symposium on Foundations of Computer, IEEE Press, Piscataway, New Jersey. pp. 352\u2013361"}],"container-title":["International Journal of Theoretical Physics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021031915281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021031915281\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021031915281.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T09:41:10Z","timestamp":1748338870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021031915281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":21,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["452093"],"URL":"https:\/\/doi.org\/10.1023\/a:1021031915281","relation":{},"ISSN":["0020-7748","1572-9575"],"issn-type":[{"type":"print","value":"0020-7748"},{"type":"electronic","value":"1572-9575"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}