{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T08:08:52Z","timestamp":1774339732328,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642231773","type":"print"},{"value":"9783642231780","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23178-0_1","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T03:15:58Z","timestamp":1315624558000},"page":"1-12","source":"Crossref","is-referenced-by-count":6,"title":["Classical and Quantum Parallelism in the Quantum Fingerprinting Method"],"prefix":"10.1007","author":[{"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Vasiliev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-44669-9_8","volume-title":"Fundamentals of Computation Theory","author":"F. Ablayev","year":"2001","unstructured":"Ablayev, F., Gainutdinova, A., Karpinski, M.: On computational power of quantum branching programs. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol.\u00a02138, pp. 59\u201370. Springer, Heidelberg (2001), \n                    \n                      http:\/\/arxiv.org\/abs\/quant-ph\/0302022"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.9.1","volume":"9","author":"F. Ablayev","year":"2009","unstructured":"Ablayev, F., Vasiliev, A.: Algorithms for quantum branching programs based on fingerprinting. EPTCS\u00a09, 1\u201311 (2009), \n                    \n                      http:\/\/arxiv.org\/abs\/0911.2317","journal-title":"EPTCS"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4204\/EPTCS.52.1","volume":"52","author":"F. Ablayev","year":"2011","unstructured":"Ablayev, F., Vasiliev, A.: On computational power of quantum read-once branching programs. Electronic Proceedings in Theoretical Computer Science\u00a052, 1\u201312 (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1103.2809v1","journal-title":"Electronic Proceedings in Theoretical Computer Science"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1023\/A:1016632423579","volume":"17","author":"V. Agrawal","year":"1998","unstructured":"Agrawal, V., Lee, D., Wozniakowski, H.: Numerical computation of characteristic polynomials of boolean functions and its applications. Numerical Algorithms\u00a017, 261\u2013278 (1998), \n                    \n                      http:\/\/dx.doi.org\/10.1023\/A:1016632423579","journal-title":"Numerical Algorithms"},{"issue":"16","key":"1_CR5","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett.\u00a087(16), 167902 (2001), \n                    \n                      www.arXiv.org\/quant-ph\/0102001v1","journal-title":"Phys. Rev. Lett."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1098\/rspa.1989.0099","volume":"425","author":"D. Deutsch","year":"1989","unstructured":"Deutsch, D.: Quantum computational networks. Royal Society of London Proceedings Series A\u00a0425, 73\u201390 (1989), \n                    \n                      http:\/\/dx.doi.org\/10.1098\/rspa.1989.0099","journal-title":"Royal Society of London Proceedings Series A"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF00464357","volume":"1","author":"J. Jain","year":"1992","unstructured":"Jain, J., Abraham, J.A., Bitner, J., Fussell, D.S.: Probabilistic verification of boolean functions. Formal Methods in System Design\u00a01, 61\u2013115 (1992)","journal-title":"Formal Methods in System Design"},{"key":"1_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-44968-X_46","volume-title":"Computing and Combinatorics","author":"M. Nakanishi","year":"2000","unstructured":"Nakanishi, M., Hamaguchi, K., Kashiwabara, T.: Ordered quantum branching programs are more powerful than ordered probabilistic branching programs under a bounded-width restriction. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 467\u2013476. Springer, Heidelberg (2000)"},{"key":"1_CR10","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 1st edn. Cambridge University Press, Cambridge (2000), \n                    \n                      http:\/\/www.worldcat.org\/isbn\/521635039","edition":"1"},{"issue":"1-3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2004.12.031","volume":"334","author":"M. Sauerhoff","year":"2005","unstructured":"Sauerhoff, M., Sieling, D.: Quantum branching programs and space-bounded nonuniform quantum complexity. Theoretical Computer Science\u00a0334(1-3), 177\u2013225 (2005), \n                    \n                      http:\/\/arxiv.org\/abs\/quant-ph\/0403164","journal-title":"Theoretical Computer Science"},{"key":"1_CR12","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams","author":"I. Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams. SIAM Monographs on Discrete Mathematics and Applications. SIAM Press, Philadelphia (2000)"},{"key":"1_CR13","unstructured":"de Wolf, R.: Quantum Computing and Communication Complexity. Ph.D. thesis, University of Amsterdam (2001)"},{"key":"1_CR14","first-page":"352","volume-title":"Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science","author":"A.C.C. Yao","year":"1993","unstructured":"Yao, A.C.C.: Quantum circuit complexity. In: Proceedings of Thirty-fourth IEEE Symposium on Foundations of Computer Science, pp. 352\u2013361. IEEE Computer Society, Palo Alto (1993)"}],"container-title":["Lecture Notes in Computer Science","Parallel Computing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23178-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T02:34:04Z","timestamp":1554258844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23178-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642231773","9783642231780"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23178-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}