{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T13:10:47Z","timestamp":1748437847976,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031457272"},{"type":"electronic","value":"9783031457289"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45728-9_7","type":"book-chapter","created":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T09:05:25Z","timestamp":1697015125000},"page":"105-124","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Operating with\u00a0Quantum Integers: An Efficient \u2018Multiples of\u2019 Oracle"],"prefix":"10.1007","author":[{"given":"Javier","family":"Sanchez-Rivero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Talav\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Garcia-Alonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Ruiz-Cort\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Manuel","family":"Murillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,12]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"Beauregard, S.: Circuit for shor\u2019s algorithm using 2n+3 qubits (2002). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.48550\/ARXIV.QUANT-PH\/0205095, https:\/\/2.zoppoz.workers.dev:443\/https\/arxiv.org\/abs\/quant-ph\/0205095","DOI":"10.48550\/ARXIV.QUANT-PH\/0205095"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bichsel, B., Baader, M., Gehr, T., Vechev, M.: SILQ: a high-level quantum language with safe uncomputation and intuitive semantics. In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 286\u2013300. PLDI 2020, Association for Computing Machinery, New York, NY, USA (2020). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/3385412.3386007","DOI":"10.1145\/3385412.3386007"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Chivers, I., Sleightholme, J., Chivers, I., Sleightholme, J.: An introduction to algorithms and the big o notation. Introduction to Programming with Fortran: With Coverage of Fortran 90, 95, 2003, 2008 and 77, pp. 359\u2013364 (2015)","DOI":"10.1007\/978-3-319-17701-4_23"},{"key":"7_CR5","unstructured":"Classiq: Classiq arithmetic oracle. https:\/\/2.zoppoz.workers.dev:443\/https\/docs.classiq.io\/0-13\/user-guide\/builtin-functions\/arithmetic\/arithmetic-expression.html"},{"key":"7_CR6","unstructured":"Coppersmith, D.: An approximate Fourier transform useful in quantum factoring. arXiv preprint quant-ph\/0201067 (2002)"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Draper, T.G.: Addition on a quantum computer (2000). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.48550\/ARXIV.QUANT-PH\/0008033, https:\/\/2.zoppoz.workers.dev:443\/https\/arxiv.org\/abs\/quant-ph\/0008033","DOI":"10.48550\/ARXIV.QUANT-PH\/0008033"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: A scalable quantum programming language. SIGPLAN Not. 48(6), 333\u2013342 (2013). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1145\/2499370.2462177","DOI":"10.1145\/2499370.2462177"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search (1996). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.48550\/ARXIV.QUANT-PH\/9605043, https:\/\/2.zoppoz.workers.dev:443\/https\/arxiv.org\/abs\/quant-ph\/9605043","DOI":"10.48550\/ARXIV.QUANT-PH\/9605043"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329\u20134332 (1998). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1103\/physrevlett.80.4329","DOI":"10.1103\/physrevlett.80.4329"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1103\/PhysRevLett.103.150502, https:\/\/2.zoppoz.workers.dev:443\/https\/link.aps.org\/doi\/10.1103\/PhysRevLett.103.150502","DOI":"10.1103\/PhysRevLett.103.150502"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Hidary, J.D., Hidary, J.D.: A brief history of quantum computing. Quant. Comput. Appl. Approach. 15\u201321 (2021)","DOI":"10.1007\/978-3-030-83274-2_2"},{"key":"7_CR13","unstructured":"Kay, A.: Tutorial on the quantikz package. arXiv preprint arXiv:1809.03842 (2018)"},{"issue":"05","key":"7_CR14","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1142\/S0129054103002023","volume":"14","author":"A Klappenecker","year":"2003","unstructured":"Klappenecker, A., Roetteler, M.: Quantum software reusability. Int. J. Found. Comput. Sci. 14(05), 777\u2013796 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-14082-3_19","volume-title":"Quantum Technology and Optimization Problems","author":"F Leymann","year":"2019","unstructured":"Leymann, F.: Towards a pattern language for quantum algorithms. In: Feld, S., Linnhoff-Popien, C. (eds.) QTOP 2019. LNCS, vol. 11413, pp. 218\u2013230. Springer, Cham (2019). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-030-14082-3_19"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Montanaro, A.: Quantum algorithms: an overview. npj Quant. Inf. 2(1), 1\u20138 (2016)","DOI":"10.1038\/npjqi.2015.23"},{"key":"7_CR17","unstructured":"National Academies of Sciences, Engineering, and Medicine and others: Quantum computing: progress and prospects (2019)"},{"key":"7_CR18","first-page":"60","volume":"54","author":"MA Nielsen","year":"2002","unstructured":"Nielsen, M.A., Chuang, I.: Quantum computation and quantum information. Phys. Today. 54, 60 (2002)","journal-title":"Phys. Today."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Sanchez-Rivero, J., Talav\u00e1n, D., Garcia-Alonso, J., Ruiz-Cort\u00e9s, A., Murillo, J.M.: Automatic generation of an efficient less-than oracle for quantum amplitude amplification (2023). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.48550\/ARXIV.2303.07120, https:\/\/2.zoppoz.workers.dev:443\/https\/arxiv.org\/abs\/2303.07120","DOI":"10.48550\/ARXIV.2303.07120"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Sanchez-Rivero, J., Talav\u00e1n, D., Garcia-Alonso, J., Ruiz-Cort\u00e9s, A., Murillo, J.M.: Some initial guidelines for building reusable quantum oracles (2023). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.48550\/arXiv.2303.14959","DOI":"10.48550\/arXiv.2303.14959"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"da Silva, A.J., Park, D.K.: Linear-depth quantum circuits for multiqubit controlled gates. Phys. Rev. A. 106, 042602 (2022). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1103\/PhysRevA.106.042602, https:\/\/2.zoppoz.workers.dev:443\/https\/link.aps.org\/doi\/10.1103\/PhysRevA.106.042602","DOI":"10.1103\/PhysRevA.106.042602"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Qiskit, A., et al.: An open-source framework for quantum computing (2021). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Zhao, J.: Quantum software engineering: Landscapes and horizons (2021). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.48550\/ARXIV.2007.07047, https:\/\/2.zoppoz.workers.dev:443\/https\/arxiv.org\/abs\/2007.07047","DOI":"10.48550\/ARXIV.2007.07047"}],"container-title":["Communications in Computer and Information Science","Service-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45728-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T09:14:40Z","timestamp":1697015680000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-031-45728-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031457272","9783031457289"],"references-count":24,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-031-45728-9_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The code used for this paper can be found in the following repository:","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Repository"}},{"value":"SummerSOC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Symposium and Summer School on Service-Oriented Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heraklion, Crete","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"summersoc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.summersoc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"27","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Full paper: 6 (16-21 pages),  Short paper: 2 (9-10 pages)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}