{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T00:54:59Z","timestamp":1778547299788,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T00:00:00Z","timestamp":1427760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s11128-015-0976-2","type":"journal-article","created":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T00:31:08Z","timestamp":1427761868000},"page":"1777-1785","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A different Deutsch\u2013Jozsa"],"prefix":"10.1007","volume":"14","author":[{"given":"Debajyoti","family":"Bera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,31]]},"reference":[{"key":"976_CR1","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In:Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp.212\u2013219. ACM Press, New York (1996). doi: 10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"976_CR2","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484 (1997). doi: 10.1137\/S0097539795293172","journal-title":"SIAM J. Comput."},{"key":"976_CR3","unstructured":"Jordan, S.: Quantum Algorithm Zoo. http:\/\/math.nist.gov\/quantum\/zoo\/"},{"issue":"1818","key":"976_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. A Math. Phys. Eng. Sci. 400(1818), 97 (1985). doi: 10.1098\/rspa.1985.0070","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"issue":"1907","key":"976_CR5","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. A Math. Phys. Eng. Sci. 439(1907), 553 (1992). doi: 10.1098\/rspa.1992.0167","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"key":"976_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P.: An exact quantum polynomial-time algorithm for Simon\u2019s problem. In: Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems. IEEE Computing Society (1997), pp. 12\u201323. doi: 10.1109\/ISTCS.1997.595153","DOI":"10.1109\/ISTCS.1997.595153"},{"issue":"19","key":"976_CR7","doi-asserted-by":"crossref","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"L Grover","year":"1998","unstructured":"Grover, L.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329 (1998). doi: 10.1103\/PhysRevLett.80.4329","journal-title":"Phys. Rev. Lett."},{"key":"976_CR8","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information (Cambridge Series on Information and the Natural Sciences), 1st edn. Cambridge University Press, (2004). doi: 10.1017\/CBO9780511976667","DOI":"10.1017\/CBO9780511976667"},{"issue":"1969","key":"976_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R Cleve","year":"1998","unstructured":"Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. A Math. Phys. Eng. Sci. 454(1969), 339 (1998). doi: 10.1098\/rspa.1998.0164","journal-title":"Proc. R. Soc. A Math. Phys. Eng. Sci."},{"key":"976_CR10","doi-asserted-by":"crossref","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume, AMS Contemporary Mathematics Series, vol. 305. American Mathematical Society (2002) doi: 10.1090\/conm\/305","DOI":"10.1090\/conm\/305"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-0976-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-015-0976-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-015-0976-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:39:21Z","timestamp":1559374761000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-015-0976-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,31]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["976"],"URL":"https:\/\/doi.org\/10.1007\/s11128-015-0976-2","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,31]]}}}