{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:27:55Z","timestamp":1770539275580,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,5,5]],"date-time":"2015-05-05T00:00:00Z","timestamp":1430784000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"crossref","award":["N66001-09-1-2025"],"award-info":[{"award-number":["N66001-09-1-2025"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s11128-015-1003-3","type":"journal-article","created":{"date-parts":[[2015,5,4]],"date-time":"2015-05-04T04:24:43Z","timestamp":1430713483000},"page":"2307-2321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A quantum algorithm for Viterbi decoding of classical convolutional codes"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2501-6239","authenticated-orcid":false,"given":"Jon R.","family":"Grice","sequence":"first","affiliation":[]},{"given":"David A.","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,5]]},"reference":[{"issue":"3","key":"1003_CR1","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1109\/PROC.1973.9030","volume":"61","author":"GD Forney Jr","year":"1973","unstructured":"Forney Jr, G.D.: The Viterbi algorithm. Proc. IEEE 61(3), 268\u2013278 (1973)","journal-title":"Proc. IEEE"},{"key":"1003_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church\u2013Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A 400, 97 (1985)","journal-title":"Proc. R. Soc. Lond. A"},{"key":"1003_CR3","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. In: IBM Research Report RC 19642 (1994)"},{"key":"1003_CR4","unstructured":"Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Trans. Inf. Theory 13(2), 260\u2013269 (1967)"},{"key":"1003_CR5","unstructured":"Barg, A., Zhou, S.: A quantum decoding algorithm of the simplex code. In: Proceedings of the 36th Annual Allerton Conference (1998)"},{"issue":"11","key":"1003_CR6","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.ipl.2012.03.002","volume":"112","author":"A Montanaro","year":"2012","unstructured":"Montanaro, A.: The quantum query complexity of learning multilinear polynomials. Inf. Process. Lett. 112(11), 438\u2013442 (2012)","journal-title":"Inf. Process. Lett."},{"key":"1003_CR7","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1103\/PhysRevA.58.905","volume":"58","author":"HF Chau","year":"1998","unstructured":"Chau, H.F.: Quantum convolutional error-correcting codes. Phys. Rev. A 58, 905 (1998)","journal-title":"Phys. Rev. A"},{"key":"1003_CR8","doi-asserted-by":"publisher","first-page":"177902","DOI":"10.1103\/PhysRevLett.91.177902","volume":"91","author":"H Ollivier","year":"2003","unstructured":"Ollivier, H., Tillich, J.-P.: Description of a quantum convolutional code. Phys. Rev. Lett. 91, 177902 (2003)","journal-title":"Phys. Rev. Lett."},{"key":"1003_CR9","unstructured":"Rahhal, J., Abu-Al-Nadi, D., Hawa, M.: Evolutional Computation in Coded Communications: An Implementation of Viterbi Algorithm. In: IEEE Congress on Evolutionary Computation (2007)"},{"key":"1003_CR10","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC) (1996)","DOI":"10.1145\/237814.237866"},{"key":"1003_CR11","unstructured":"Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum. \n                    arXiv:9607014v2\n                    \n                   (1996)"},{"key":"1003_CR12","unstructured":"Meyer, D.A., Pommersheim, J.: Single-query learning from Abelian and non-Abelian Hamming distance oracles. Chic. J. Theor. Comput. Sci. (2010). \n                    http:\/\/cjtcs.cs.uchicago.edu\/articles\/2010\/13\/cj10-13-1.pdf"},{"key":"1003_CR13","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"1003_CR14","first-page":"701","volume":"57a","author":"M Zubairy","year":"2002","unstructured":"Zubairy, M., Diao, Z., Chen, G.: A quantum circuit design for Grover\u2019s algorithm. Z. Naturforsch 57a, 701\u2013708 (2002)","journal-title":"Z. Naturforsch"},{"key":"1003_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800467","volume-title":"Algebraic Codes for Data Transmission","author":"RE Blahut","year":"2003","unstructured":"Blahut, R.E.: Algebraic Codes for Data Transmission. Cambridge University Press, Cambridge (2003)"},{"issue":"1","key":"1003_CR16","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1093\/biomet\/66.1.171","volume":"66","author":"J Ramey","year":"1979","unstructured":"Ramey, J., Alam, K.: A sequential procedure for selecting the most probable multinomial event. Biometrika 66(1), 171\u2013173 (1979)","journal-title":"Biometrika"},{"key":"1003_CR17","doi-asserted-by":"publisher","first-page":"100","DOI":"10.7208\/chicago\/9780226288567.001.0001","volume-title":"Perspectives in Computation, Chapter 13","author":"R Geroch","year":"2009","unstructured":"Geroch, R.: Perspectives in Computation, Chapter 13, pp. 100\u2013101. The University of Chicago Press, Chicago (2009)"},{"key":"1003_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-070-4","volume-title":"The Algorithm Design Manual","author":"S Skiena","year":"2008","unstructured":"Skiena, S.: The Algorithm Design Manual. Springer, Berlin (2008)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-1003-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-015-1003-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-1003-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-1003-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T16:04:11Z","timestamp":1589731451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-015-1003-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,5]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1003"],"URL":"https:\/\/doi.org\/10.1007\/s11128-015-1003-3","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,5]]},"assertion":[{"value":"3 June 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 May 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}