{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:32:30Z","timestamp":1767137550337,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030801182","type":"print"},{"value":"9783030801199","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:00:00Z","timestamp":1626134400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-80119-9_9","type":"book-chapter","created":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T15:14:28Z","timestamp":1626102868000},"page":"188-203","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computer Scientist\u2019s and Programmer\u2019s View on Quantum Algorithms: Mapping Functions\u2019 APIs and Inputs to Oracles"],"prefix":"10.1007","author":[{"given":"Ilie-Daniel","family":"Gheorghe-Pop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolay","family":"Tcholtchev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Ritter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Hauswirth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,13]]},"reference":[{"key":"9_CR1","unstructured":"QOSF Learning Resources on Quantum Computing: https:\/\/qosf.org\/learn_quantum\/. Accessed 20 Oct 2020"},{"key":"9_CR2","unstructured":"Haney, B., Quantum Patents (March 16, 2020). 27 B.U. J. Sci. Tech. L. (2020). (Forthcoming). Available at SSRN: https:\/\/ssrn.com\/abstract=3554925"},{"key":"9_CR3","unstructured":"IBM Quantum Roadmap: https:\/\/www.ibm.com\/blogs\/research\/2020\/09\/ibm-quantum-roadmap\/. Accessed 20 Oct 2020"},{"key":"9_CR4","unstructured":"Manin, Yu.I.: Computable and Noncomputable Sov. Radio (1980)"},{"issue":"5","key":"9_CR5","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/bf01011339","volume":"22","author":"P Benioff","year":"1980","unstructured":"Benioff, P.: The computer as a physical system: a microscopic quantum mechanical hamiltonian model of computers as represented by turing machines. J. Stat. Phys. 22(5), 563\u2013591 (1980). https:\/\/doi.org\/10.1007\/bf01011339","journal-title":"J. Stat. Phys."},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theore. Phys. 21, Nos. 6\/7 (1982)","DOI":"10.1007\/BF02650179"},{"issue":"23","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1103\/PhysRevLett.48.1581","volume":"48","author":"P Benioff","year":"1982","unstructured":"Benioff, P.: Quantum mechanical models of turing machines that dissipate no energy. Phys. Rev. Lett. 48(23), 1581\u20131585 (1982)","journal-title":"Phys. Rev. Lett."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Deutsch, D., Jozsa, R.: Rapid solutions of problems by quantum computation. Proc. R. Soc. London, 439, 53\u2013558 (1992). https:\/\/doi.org\/10.1098\/rspa.1992.0167","DOI":"10.1098\/rspa.1992.0167"},{"issue":"1969","key":"9_CR9","doi-asserted-by":"publisher","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. London 454(1969), 339\u2013354 (1998). https:\/\/doi.org\/10.1098\/rspa.1998.0164","journal-title":"Proc. R. Soc. London"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings, 28th Annual ACM Symposium on the Theory of Computing, p. 212, May 1996","DOI":"10.1145\/237814.237866"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Chuang, I.L., Gershenfeld, N., Kubinec, M.: Experimental implementation of fast quantum searching. Phys. Rev. Lett. 80 (15), 3408\u20133411 (1998). https:\/\/doi.org\/10.1103\/PhysRevLett.80.3408","DOI":"10.1103\/PhysRevLett.80.3408"},{"issue":"6964","key":"9_CR12","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1038\/nature02054","volume":"426","author":"JL O\u2019Brien","year":"2003","unstructured":"O\u2019Brien, J.L., Pryde, G.J., White, A.G., Ralph, T.C., Branning, D.: Demonstration of an all-optical quantum controlled-NOT gate. Nature 426(6964), 264\u2013267 (2003). https:\/\/doi.org\/10.1038\/nature02054","journal-title":"Nature"},{"issue":"6918","key":"9_CR13","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1038\/nature01336","volume":"421","author":"S Gulde","year":"2003","unstructured":"Gulde, S., et al.: Implementation of the Deutsch-Jozsa algorithm on an ion-trap quantum computer. Nature 421(6918), 48\u201350 (2003). https:\/\/doi.org\/10.1038\/nature01336","journal-title":"Nature"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Clarke, J., Wilhelm, F.K.: Superconducting quantum bits. Nature. 453(7198), 1031\u20131042 (2008). https:\/\/doi.org\/10.1038\/nature07128","DOI":"10.1038\/nature07128"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Last, T., et.al.: Quantum Inspire: QuTech\u2019s platform for co-development and collaboration in quantum computing. In: Proceedings SPIE 11324, Novel Patterning Technologies for Semiconductors, MEMS\/NEMS and MOEMS 2020, 113240J (2020). https:\/\/doi.org\/10.1117\/12.2551853","DOI":"10.1117\/12.2551853"},{"key":"9_CR16","unstructured":"IBM Q-Experience: https:\/\/www.ibm.com\/quantum-computing\/. 15 July 2020"},{"key":"9_CR17","unstructured":"Rigetti: https:\/\/rigetti.com\/. 15 July 2020"},{"key":"9_CR18","unstructured":"D-Wave: https:\/\/www.dwavesys.com\/services. Accessed 15 July 2020"},{"key":"9_CR19","unstructured":"Bristol QCloud, Available: http:\/\/www.bristol.ac.uk\/physics\/research\/quantum\/engagement\/qcloud\/. Accessed 15 Sept 2020"},{"key":"9_CR20","unstructured":"Quantum Playground: http:\/\/www.quantumplayground.net\/. Accessed 15 Sept 2020"},{"key":"9_CR21","unstructured":"Amazon Braket: https:\/\/aws.amazon.com\/braket\/. Accessed 15 Sept 2020"},{"key":"9_CR22","unstructured":"List of open source QC Software: https:\/\/github.com\/qosf\/awesome-quantum-software. Accessed 15 Sept 2020"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-45724-2_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Jaques","year":"2020","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing grover oracles for quantum key search on AES and LowMC. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 280\u2013310. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_10"},{"key":"9_CR24","unstructured":"Gilliam, A., Woerner, S., Gonciulea, C.: Grover Adaptive Search for Constrained Polynomial Binary Optimization, arXiv e-prints (2019)"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1137\/040605072","volume":"15","author":"W Baritompa","year":"2005","unstructured":"Baritompa, W., Bulger, D., Wood, G.: Grover\u2019s quantum algorithm applied to global optimization. SIAM J. Optim. 15, 1170\u20131184 (2005). https:\/\/doi.org\/10.1137\/040605072","journal-title":"SIAM J. Optim."},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Borujeni, S.E., Harikrishnakumar, R., Nannapaneni, S.: Quantum Grover search-based optimization for innovative material discovery. In: 2019 IEEE International Conference on Big Data (Big Data), Los Angeles, CA, USA, pp. 4486\u20134489 (2019). https:\/\/doi.org\/10.1109\/BigData47090.2019.9006454","DOI":"10.1109\/BigData47090.2019.9006454"},{"key":"9_CR27","unstructured":"Gilliam, A., Pistoia, M., Gonciulea, C.: Optimizing Quantum Search Using a Generalized Version of Grover\u2019s Algorithm, arXiv e-prints (2020)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Huang, H., Wu, D., Fan, D., Zhu, X.: Superconducting Quantum Computing: A Review (2020). arXiv:2006.10433","DOI":"10.1007\/s11432-020-2881-9"},{"key":"9_CR29","unstructured":"Venturelli, D., Kondratyev, A.: Reverse Quantum Annealing Approach to Portfolio Optimization Problems, Papers, arXiv.org (2018). https:\/\/EconPapers.repec.org\/RePEc:arx:papers:1810.08584"},{"issue":"3","key":"9_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-019-2206-9","volume":"18","author":"TD Kieu","year":"2019","unstructured":"Kieu, T.D.: The travelling salesman problem and adiabatic quantum computation: an algorithm. Quantum Inf. Process. 18(3), 1\u201319 (2019). https:\/\/doi.org\/10.1007\/s11128-019-2206-9","journal-title":"Quantum Inf. Process."},{"key":"9_CR31","unstructured":"Elfving, V.E.: How will quantum computers provide an industrially relevant computational advantage in quantum chemistry? arXiv e-prints (2020)"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-25385-0_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Dagdelen, \u00d6., Fischlin, M., Lehmann, A., Schaffner, C., Zhandry, M.: Random oracles in a quantum world. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 41\u201369. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_3"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Deutsch, D.: Quantum theory, the church\u2013turing principle and the universal quantum computer. In: Proc. R. Soc. London. A. Math. Phys. Sci. 400(1818), 97\u2013117 (1985)","DOI":"10.1098\/rspa.1985.0070"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Richard, J.: Characterizing classes of functions computable by quantum parallelism. Proc. R. Soc. London. Ser. Math. Phys. Sci. 435(1895), 563\u2013574 (1991)","DOI":"10.1098\/rspa.1991.0161"},{"key":"9_CR35","unstructured":"Kiss, A., Varga, K.: Comparing two quantum oracles using the Deutsch-Jozsa algorithm. Ann. Univ. Sci. Budapest., Sect. Comp. 50 199\u2013217 (2020)"},{"key":"9_CR36","first-page":"3177","volume":"13","author":"T Salman","year":"2012","unstructured":"Salman, T., Baram, Y.: Quantum set intersection and its applicationto associative memory. J. Mach. Learn. Res. 13, 3177\u20133206 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Nagata, K., Nakamura, T.: The Deutsch-Jozsa algorithm can be used for quantum key distribution. Open Access Libr. J. 2, e1798 (2015)","DOI":"10.4236\/oalib.1101798"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Alexandru, C.-M., Bridgett-Tomkinson, E., Linden, N., MacManus, J., Montanaro, A., Morris, H. Quantum speedups of some general-purpose numerical optimisation algorithms. Quant. Sci. Technol. 5(4) (2020). https:\/\/doi.org\/10.1088\/2058-9565\/abb003","DOI":"10.1088\/2058-9565\/abb003"},{"key":"9_CR39","unstructured":"Mosca, M.: Quantum Algorithms, arXiv:0808.0369, submitted: Mon, 4 August 2008. https:\/\/arxiv.org\/abs\/0808.0369"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-90-313-8424-2_10","volume-title":"36 zieke kinderen","author":"G de Jonge","year":"2012","unstructured":"de Jonge, G., Sprij, A.: 10. In: 36 zieke kinderen, pp. 39\u201342. Bohn Stafleu van Loghum, Houten (2012). https:\/\/doi.org\/10.1007\/978-90-313-8424-2_10"},{"key":"9_CR41","unstructured":"Nannicini, G.: Quantum Computing, Lecture 5 (2019). https:\/\/researcher.watson.ibm.com\/researcher\/files\/us-nannicini\/8100_lecture_5.pdf"},{"key":"9_CR42","doi-asserted-by":"publisher","first-page":"1918","DOI":"10.1038\/s41467-017-01904-7","volume":"8","author":"C Figgatt","year":"2017","unstructured":"Figgatt, C., Maslov, D., Landsman, K.A., et al.: Complete 3-Qubit grover search on a programmable quantum computer. Nat Commun 8, 1918 (2017). https:\/\/doi.org\/10.1038\/s41467-017-01904-7","journal-title":"Nat Commun"},{"key":"9_CR43","unstructured":"Str\u00f6mberg, P., Blomkvist Karlsson, V.: 4-qubit Grover\u2019s algorithm implemented for the ibmqx5 architecture (Dissertation) (2018). http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:kth:diva-229797"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Mandviwalla, A., Ohshiro, K., Ji, B.: Implementing Grover\u2019s algorithm on the IBM quantum computers. In: 2018 IEEE International Conference on Big Data (Big Data), Seattle, WA, USA, pp. 2531\u20132537 (2018). https:\/\/doi.org\/10.1109\/BigData.2018.8622457","DOI":"10.1109\/BigData.2018.8622457"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Wang, P., Liu, G., Liu, L.: A generic variable inputs quantum algorithm for 3-sat problem. In: 2020 IEEE International Conference on Advances in Electrical Engineering and Computer Applications (AEECA), Dalian, China, pp. 308\u2013312 (2020). https:\/\/doi.org\/10.1109\/AEECA49918.2020.9213471","DOI":"10.1109\/AEECA49918.2020.9213471"},{"key":"9_CR46","unstructured":"Gilliam, A., Pistoia, M., Gonciulea, C.: Canonical Construction of Quantum Oracles, arXiv:2006.10656 (2020)"},{"key":"9_CR47","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1109\/ISMVL.2011.29","volume":"2011","author":"S Dhawan","year":"2011","unstructured":"Dhawan, S., Perkowski, M., comparison of influence of two data-encoding methods for grover algorithm on quantum costs. In: 41st IEEE International Symposium on Multiple-Valued Logic. Tuusula 2011, 176\u2013181 (2011). https:\/\/doi.org\/10.1109\/ISMVL.2011.29","journal-title":"Tuusula"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Tsai, E., Perkowski, M.: A Quantum Algorithm for Automata Encoding. https:\/\/doi.org\/10.2298\/FUEE2002169T","DOI":"10.2298\/FUEE2002169T"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Gheorghe-Pop, I.D., Tcholtchev, N., Ritter, T., Hauswirth, M.: Quantum devops: towards reliable and applicable NISQ quantum computing (forthcoming). In:12 IEEE GLOBECOM 2020","DOI":"10.1109\/GCWkshps50303.2020.9367411"},{"key":"9_CR50","unstructured":"Bertels, K., Almudever, C.G., Hogaboam, J.W., Ashraf, I., Guerreschi, G. G., Khammassi, N.: (2018\u201305\u201324). cQASM v1.0: Towards a Common Quantum Assembly Language. arXiv:1805.09607v1 (2010)"}],"updated-by":[{"DOI":"10.1007\/978-3-030-80119-9_79","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T00:00:00Z","timestamp":1629331200000}}],"container-title":["Lecture Notes in Networks and Systems","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80119-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T19:35:52Z","timestamp":1725392152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80119-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,13]]},"ISBN":["9783030801182","9783030801199"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80119-9_9","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,13]]},"assertion":[{"value":"13 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}