{"id":"https://openalex.org/W4414209488","doi":"https://doi.org/10.1145/3731545.3744149","title":"Scaling Grover\u2019s Search for Large Solution Spaces","display_name":"Scaling Grover\u2019s Search for Large Solution Spaces","publication_year":2025,"publication_date":"2025-07-20","ids":{"openalex":"https://openalex.org/W4414209488","doi":"https://doi.org/10.1145/3731545.3744149"},"language":"en","primary_location":{"id":"doi:10.1145/3731545.3744149","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731545.3744149","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3731545.3744149","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105877451","display_name":"Simone Faro","orcid":"https://orcid.org/0000-0001-5937-5796"},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Simone Faro","raw_affiliation_strings":["University of Catania, catania, Italy"],"raw_orcid":"https://orcid.org/0000-0001-5937-5796","affiliations":[{"raw_affiliation_string":"University of Catania, catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004198996","display_name":"Francesco Pio Marino","orcid":"https://orcid.org/0000-0003-4722-9542"},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]},{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]}],"countries":["FR","IT"],"is_corresponding":false,"raw_author_name":"Francesco Pio Marino","raw_affiliation_strings":["University of Catania, catania, Italy","University of Rouen, rouen, France"],"raw_orcid":"https://orcid.org/0000-0003-4722-9542","affiliations":[{"raw_affiliation_string":"University of Catania, catania, Italy","institution_ids":["https://openalex.org/I39063666"]},{"raw_affiliation_string":"University of Rouen, rouen, France","institution_ids":["https://openalex.org/I62396329"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10622","display_name":"Quantum Mechanics and Applications","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.695900022983551},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.589900016784668},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5568000078201294},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5356000065803528},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.48809999227523804},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.47940000891685486},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.45190000534057617},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4431000053882599},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.4293000102043152}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.695900022983551},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.589900016784668},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5568000078201294},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5386000275611877},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5356000065803528},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.48809999227523804},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.47940000891685486},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4706000089645386},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.45190000534057617},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4431000053882599},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.4293000102043152},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.4088999927043915},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.4050000011920929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38609999418258667},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.3580000102519989},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3555000126361847},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3278999924659729},{"id":"https://openalex.org/C58849907","wikidata":"https://www.wikidata.org/wiki/Q2118982","display_name":"Quantum gate","level":4,"score":0.31690001487731934},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2969000041484833},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28769999742507935},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.2797999978065491},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.27219998836517334},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.2653000056743622},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3731545.3744149","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731545.3744149","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3731545.3744149","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3731545.3744149","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th International Symposium on High-Performance Parallel and Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2084652510","https://openalex.org/W2121124751","https://openalex.org/W2121981260","https://openalex.org/W2122780600","https://openalex.org/W2126338609","https://openalex.org/W2952684570","https://openalex.org/W2980483094","https://openalex.org/W2990961515","https://openalex.org/W3201503951","https://openalex.org/W4383901229","https://openalex.org/W4388492126","https://openalex.org/W4396571119","https://openalex.org/W4401914693","https://openalex.org/W4402191280","https://openalex.org/W4404145815"],"related_works":[],"abstract_inverted_index":{"Grover's":[0,69,183],"algorithm":[1,70,205],"offers":[2],"a":[3,47,54,123,164],"celebrated":[4],"quadratic":[5],"speedup":[6],"for":[7,141,160],"unstructured":[8],"search":[9,36],"problems,":[10],"positioning":[11],"it":[12],"among":[13],"the":[14,26,34,58,64,78,88,105,110,118,129,133,137,188,203,214],"foundational":[15],"tools":[16],"of":[17,28,33,57,66,68,80,150,217],"quantum":[18,179,218],"computing.":[19],"However,":[20],"its":[21],"effectiveness":[22],"critically":[23],"deteriorates":[24],"when":[25],"number":[27,79],"valid":[29],"solutions":[30,81,116],"exceeds":[31],"half":[32],"total":[35],"space.":[37],"In":[38],"this":[39,43,151],"work,":[40],"we":[41],"address":[42],"limitation":[44],"by":[45],"introducing":[46],"novel":[48],"and":[49,108,181,194],"efficient":[50],"technique":[51],"based":[52],"on":[53,177],"virtual":[55],"expansion":[56],"input":[59,106],"domain.":[60],"Our":[61],"approach":[62,200],"extends":[63],"range":[65],"applicability":[67],"to":[71,104,112,175],"high-density":[72],"solution":[73,130,210],"spaces,":[74],"including":[75],"those":[76,115],"where":[77,117],"is":[82,121,173],"greater":[83],"than":[84],"N/2,":[85],"without":[86],"increasing":[87],"actual":[89],"circuit":[90],"depth":[91],"or":[92],"memory":[93],"footprint.":[94],"The":[95,170],"core":[96],"idea":[97],"consists":[98],"in":[99,122,132,167,187,206],"appending":[100],"one":[101],"auxiliary":[102,119,156],"qubit":[103,120],"register":[107],"modifying":[109],"oracle":[111],"mark":[113],"only":[114],"fixed":[124],"state.":[125],"This":[126],"effectively":[127],"reduces":[128],"density":[131],"extended":[134],"space,":[135],"restoring":[136],"geometric":[138],"conditions":[139],"required":[140],"successful":[142],"amplitude":[143],"amplification.":[144],"We":[145],"further":[146],"analyze":[147],"an":[148],"extension":[149],"strategy":[152],"involving":[153],"log":[154],"n":[155],"qubits,":[157],"which":[158],"allows":[159],"tunable":[161],"robustness":[162],"at":[163],"moderate":[165],"increase":[166],"computational":[168],"cost.":[169],"proposed":[171],"method":[172],"simple":[174],"implement":[176],"existing":[178],"hardware":[180],"maintains":[182],"optimal":[184],"asymptotic":[185],"complexity":[186],"expanded":[189],"regime.":[190],"Both":[191],"theoretical":[192],"analysis":[193],"empirical":[195],"simulations":[196],"confirm":[197],"that":[198],"our":[199],"reliably":[201],"outperforms":[202],"standard":[204],"scenarios":[207],"with":[208],"high":[209],"density,":[211],"thus":[212],"broadening":[213],"practical":[215],"utility":[216],"search.":[219]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}