{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T09:05:11Z","timestamp":1770714311822,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T00:00:00Z","timestamp":1708732800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T00:00:00Z","timestamp":1708732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s42484-024-00148-1","type":"journal-article","created":{"date-parts":[[2024,2,24]],"date-time":"2024-02-24T15:02:54Z","timestamp":1708786974000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Grover\u2019s search with learning oracle for constrained binary optimization problems"],"prefix":"10.1007","volume":"6","author":[{"given":"Hiroshi","family":"Ohno","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,24]]},"reference":[{"issue":"6","key":"148_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1038\/s43588-021-00084-1","volume":"1","author":"A Abbas","year":"2021","unstructured":"Abbas A, Sutter D, Zoufal C, Lucchi A, Figalli A, Woerner S (2021) The power of quantum neural networks. Nat Comput Sci 1(6):403\u2013409. https:\/\/doi.org\/10.1038\/s43588-021-00084-1","journal-title":"Nat Comput Sci"},{"key":"148_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18853-4","author":"A Al-Rabadi","year":"2004","unstructured":"Al-Rabadi A (2004) Reversible logic synthesis: from fundamentals to quantum computing. Springer-Verlag. https:\/\/doi.org\/10.1007\/978-3-642-18853-4","journal-title":"Springer-Verlag"},{"key":"148_CR3","doi-asserted-by":"publisher","unstructured":"Arrasmith A, Cerezo M, Czarnik P, Cincio L, Coles PJ (2021) Effect of barren plateaus on gradient-free optimization. Quantum 5:558. https:\/\/doi.org\/10.22331\/q-2021-10-05-558","DOI":"10.22331\/q-2021-10-05-558"},{"key":"148_CR4","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1142\/9789814282673_0010","volume-title":"Theory of randomized search heuristics: foundations and recent developments, chap 10","author":"A Auger","year":"2011","unstructured":"Auger A, Hansen N (2011) Theory of evolution strategies: a new perspective. In: Auger A, Doerr B (eds) Theory of randomized search heuristics: foundations and recent developments, chap 10. World Scientific Publishing, pp 289\u2013325"},{"key":"148_CR5","unstructured":"Berezniuk O, Figalli A, Ghigliazza R, Musaelian K (2020) A scale-dependent notion of effective dimension. arXiv:2001.10872"},{"key":"148_CR6","doi-asserted-by":"publisher","unstructured":"Bhuvaneswari S, Deepakraj R, Urooj S, Sharma N, Pathak N (2023) Computational analysis: unveiling the quantum algorithms for protein analysis and predictions. IEEE Access 1. https:\/\/doi.org\/10.1109\/ACCESS.2023.3310812","DOI":"10.1109\/ACCESS.2023.3310812"},{"issue":"2","key":"148_CR7","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1109\/TKDE.2007.190689","volume":"20","author":"U Brandes","year":"2008","unstructured":"Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z, Wagner D (2008) On modularity clustering. IEEE Trans Knowl Data Eng 20(2):172\u2013188. https:\/\/doi.org\/10.1109\/TKDE.2007.190689","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"5300","key":"148_CR8","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1126\/science.275.5300.627","volume":"275","author":"G Brassard","year":"1997","unstructured":"Brassard G (1997) Searching a quantum phone book. Science 275(5300):627\u2013628. https:\/\/doi.org\/10.1126\/science.275.5300.627","journal-title":"Science"},{"key":"148_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard G, H\u00f8yer P, Mosca M, Tapp A (2002) Quantum amplitude amplification and estimation. Contemp Math 305:53\u201374","journal-title":"Contemp Math"},{"issue":"3","key":"148_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1023\/A:1023061218864","volume":"116","author":"D Bulger","year":"2003","unstructured":"Bulger D, Baritompa WP, Wood GR (2003) Implementing pure adaptive search with Grover\u2019s quantum algorithm. J Optim Theory Appl 116(3):517\u2013529. https:\/\/doi.org\/10.1023\/A:1023061218864","journal-title":"J Optim Theory Appl"},{"key":"148_CR11","doi-asserted-by":"publisher","unstructured":"Chan E, Yeung DY (2011) A convex formulation of modularity maximization for community detection. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, pp 2218\u20132225. https:\/\/doi.org\/10.5591\/978-1-57735-516-8\/IJCAI11-370","DOI":"10.5591\/978-1-57735-516-8\/IJCAI11-370"},{"key":"148_CR12","doi-asserted-by":"publisher","first-page":"012324","DOI":"10.1103\/PhysRevA.98.012324","volume":"98","author":"PL Dallaire-Demers","year":"2018","unstructured":"Dallaire-Demers PL, Killoran N (2018) Quantum generative adversarial networks. Phys Rev A 98:012324. https:\/\/doi.org\/10.1103\/PhysRevA.98.012324","journal-title":"Phys Rev A"},{"key":"148_CR13","unstructured":"D\u00fcrr C, H\u00f8yer P (1999) A quantum algorithm for finding the minimum. ArXiv e-prints quant-ph\/9607014"},{"key":"148_CR14","unstructured":"Gilliam A, Venci C, Muralidharan S, Dorum V, May E, Narasimhan R, Gonciulea C (2021b) Foundational patterns for efficient quantum computing. arXiv:1907.11513"},{"key":"148_CR15","doi-asserted-by":"publisher","unstructured":"Gilliam A, Woerner S, Gonciulea C (2021a) Grover adaptive search for constrained polynomial binary optimization. Quantum 5:428. https:\/\/doi.org\/10.22331\/q-2021-04-08-428","DOI":"10.22331\/q-2021-04-08-428"},{"key":"148_CR16","doi-asserted-by":"publisher","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the twenty-eighth annual ACM symposium on theory of computing, Association for Computing Machinery, New York, USA, STOC \u201996, pp 212\u2013219. https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"148_CR17","doi-asserted-by":"crossref","unstructured":"Monnet M, Gebran H, Matic-Flierl A, Kiwit F, Schachtner B, Bentellis A, Lorenz JM (2023) Pooling techniques in hybrid quantum-classical convolutional neural networks. arXiv:2305.05603","DOI":"10.1109\/QCE57702.2023.00074"},{"key":"148_CR18","doi-asserted-by":"publisher","first-page":"062333","DOI":"10.1103\/PhysRevA.98.062333","volume":"98","author":"MES Morales","year":"2018","unstructured":"Morales MES, Tlyachev T, Biamonte J (2018) Variational learning of Grover\u2019s quantum search algorithm. Physical Review A 98:062333. https:\/\/doi.org\/10.1103\/PhysRevA.98.062333","journal-title":"Physical Review A"},{"key":"148_CR19","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen MA, Chuang IL (2011) Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, USA","edition":"10"},{"key":"148_CR20","doi-asserted-by":"publisher","unstructured":"Olivier T (2011) Lower Bounds for Evolution Strategies, chap\u00a011. World Scientific Publishing, pp 327\u2013354. https:\/\/doi.org\/10.1142\/9789814282673_0011","DOI":"10.1142\/9789814282673_0011"},{"key":"148_CR21","doi-asserted-by":"publisher","first-page":"040316","DOI":"10.1103\/PRXQuantum.2.040316","volume":"2","author":"C Ortiz Marrero","year":"2021","unstructured":"Ortiz Marrero C, Kieferov\u00e1 M, Wiebe N (2021) Entanglement-induced barren plateaus. PRX. Quantum 2:040316. https:\/\/doi.org\/10.1103\/PRXQuantum.2.040316","journal-title":"Quantum"},{"key":"148_CR22","doi-asserted-by":"publisher","unstructured":"P\u00e9rez-Salinas A, Cervera-Lierta A, Gil-Fuster E, Latorre JI (2020) Data re-uploading for a universal quantum classifier. Quantum 4:226. https:\/\/doi.org\/10.22331\/q-2020-02-06-226","DOI":"10.22331\/q-2020-02-06-226"},{"issue":"1","key":"148_CR23","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo A, McClean J, Shadbolt P, Yung MH, Zhou XQ, Love PJ, Aspuru-Guzik A, O\u2019Brien JL (2014) A variational eigenvalue solver on a photonic quantum processor. Nat Commun 5(1):4213. https:\/\/doi.org\/10.1038\/ncomms5213","journal-title":"Nat Commun"},{"issue":"2","key":"148_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/ijoc.1050.0172","volume":"19","author":"WD Pisinger","year":"2007","unstructured":"Pisinger WD, Rasmussen AB, Sandvik R (2007) Solution of large quadratic knapsack problems through aggressive reduction. INFORMS J Comput 19(2):280\u2013290. https:\/\/doi.org\/10.1287\/ijoc.1050.0172","journal-title":"INFORMS J Comput"},{"issue":"2","key":"148_CR25","first-page":"416","volume":"11","author":"J Rissanen","year":"1996","unstructured":"Rissanen J (1996) A universal prior for integers and estimation by minimum description length. Ann Stat 11(2):416\u2013431","journal-title":"Ann Stat"},{"issue":"2","key":"148_CR26","doi-asserted-by":"publisher","first-page":"025003","DOI":"10.1088\/2058-9565\/acaf9d","volume":"8","author":"R Seidel","year":"2023","unstructured":"Seidel R, Becker CKU, Bock S, Tcholtchev N, Gheorghe-Pop ID, Hauswirth M (2023) Automatic generation of Grover quantum oracles for arbitrary data structures. Quantum Sci Technol 8(2):025003. https:\/\/doi.org\/10.1088\/2058-9565\/acaf9d","journal-title":"Quantum Sci Technol"},{"issue":"12","key":"148_CR27","doi-asserted-by":"publisher","first-page":"1900070","DOI":"10.1002\/qute.201900070","volume":"2","author":"S Sim","year":"2019","unstructured":"Sim S, Johnson PD, Aspuru-Guzik A (2019) Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Adv Quantum Technol 2(12):1900070. https:\/\/doi.org\/10.1002\/qute.201900070","journal-title":"Adv Quantum Technol"},{"key":"148_CR28","doi-asserted-by":"publisher","unstructured":"Simon D (1994) On the power of quantum computation. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp 116\u2013123. https:\/\/doi.org\/10.1109\/SFCS.1994.365701","DOI":"10.1109\/SFCS.1994.365701"},{"key":"148_CR29","doi-asserted-by":"publisher","unstructured":"Sweke R, Wilde F, Meyer J, Schuld M, Faehrmann PK, Meynard-Piganeau B, Eisert J (2020) Stochastic gradient descent for hybrid quantum-classical optimization. Quantum 4:314. https:\/\/doi.org\/10.22331\/q-2020-08-31-314","DOI":"10.22331\/q-2020-08-31-314"},{"key":"148_CR30","doi-asserted-by":"publisher","unstructured":"Wan KH, Liu F, Dahlsten O, Kim MS (2018) Learning Simon\u2019s quantum algorithm. ArXiv e-prints https:\/\/doi.org\/10.48550\/arXiv.1806.10448","DOI":"10.48550\/arXiv.1806.10448"},{"issue":"7","key":"148_CR31","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s11128-023-04010-4","volume":"22","author":"Z Wang","year":"2023","unstructured":"Wang Z, Liang K, Bao X, Wu T (2023) Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm. Quantum Inf Process 22(7):271. https:\/\/doi.org\/10.1007\/s11128-023-04010-4","journal-title":"Quantum Inf Process"},{"issue":"1","key":"148_CR32","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s11128-022-03727-y","volume":"22","author":"X Wu","year":"2023","unstructured":"Wu X, Li Q, Li Z, Yang D, Yang H, Pan W, Perkowski M, Song X (2023) Circuit optimization of Grover quantum search algorithm. Quantum Inf Process 22(1):69. https:\/\/doi.org\/10.1007\/s11128-022-03727-y","journal-title":"Quantum Inf Process"},{"key":"148_CR33","doi-asserted-by":"publisher","unstructured":"Wurtz J, Love P (2021) Maxcut quantum approximate optimization algorithm performance guarantees for $$p > 1$$. Phys Rev A 103:042612. https:\/\/doi.org\/10.1103\/PhysRevA.103.042612","DOI":"10.1103\/PhysRevA.103.042612"},{"key":"148_CR34","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","volume":"113","author":"TJ Yoder","year":"2014","unstructured":"Yoder TJ, Low GH, Chuang IL (2014) Fixed-point quantum search with an optimal number of queries. Phys Rev Lett 113:210501. https:\/\/doi.org\/10.1103\/PhysRevLett.113.210501","journal-title":"Phys Rev Lett"},{"issue":"1","key":"148_CR35","doi-asserted-by":"publisher","first-page":"3810","DOI":"10.1038\/s41598-023-30860-0","volume":"13","author":"CS Yoon","year":"2023","unstructured":"Yoon CS, Hong CH, Kang MS, Choi JW, Yang HJ (2023) Quantum asymmetric key crypto scheme using Grover iteration. Sci Rep 13(1):3810. https:\/\/doi.org\/10.1038\/s41598-023-30860-0","journal-title":"Sci Rep"},{"key":"148_CR36","doi-asserted-by":"publisher","first-page":"2867","DOI":"10.1609\/aaai.v31i1.10795","volume":"31","author":"G Yuan","year":"2017","unstructured":"Yuan G, Ghanem B (2017) An exact penalty method for binary optimization based on MPEC formulation. Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence 31:2867\u20132875. https:\/\/doi.org\/10.1609\/aaai.v31i1.10795","journal-title":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence"},{"key":"148_CR37","unstructured":"Yu Z, Chen Q, Jiao Y, Li Y, Lu X, Wang X, Yang JZ (2023) Provable advantage of parameterized quantum circuit in function approximation. arXiv:2310.07528"},{"key":"148_CR38","doi-asserted-by":"publisher","unstructured":"Zeng QW, Ge HY, Gong C, Zhou NR (2023) Conditional quantum circuit born machine based on a hybrid quantum-classical framework. Phys A Stat Mech Appl 618:128693. https:\/\/doi.org\/10.1016\/j.physa.2023.128693","DOI":"10.1016\/j.physa.2023.128693"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00148-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-024-00148-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-024-00148-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T16:20:51Z","timestamp":1719246051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-024-00148-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,24]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1007\/s42484-024-00148-1","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,24]]},"assertion":[{"value":"19 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"12"}}