{"id":"https://openalex.org/W7130405866","doi":"https://doi.org/10.48550/arxiv.2602.15049","title":"Quantum Optimization for Access Point Selection Under Budget Constraint","display_name":"Quantum Optimization for Access Point Selection Under Budget Constraint","publication_year":2026,"publication_date":"2026-02-09","ids":{"openalex":"https://openalex.org/W7130405866","doi":"https://doi.org/10.48550/arxiv.2602.15049"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2602.15049","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15049","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2602.15049","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126337686","display_name":"Mohamed Khalil Brik","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brik, Mohamed Khalil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102921321","display_name":"Ahmed Shokry","orcid":"https://orcid.org/0000-0003-3753-8886"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shokry, Ahmed","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Youssef, Moustafa","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Youssef, Moustafa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.8482999801635742,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10326","display_name":"Indoor and Outdoor Localization Technologies","score":0.8482999801635742,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.08760000020265579,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.007799999788403511,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5870000123977661},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5838000178337097},{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"Quantum annealing","score":0.5236999988555908},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.48260000348091125},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.4814000129699707},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.46720001101493835},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.45829999446868896},{"id":"https://openalex.org/keywords/selection-algorithm","display_name":"Selection algorithm","score":0.42750000953674316},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4221999943256378}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6567999720573425},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6212999820709229},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5870000123977661},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5838000178337097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5259000062942505},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.5236999988555908},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.48260000348091125},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.4814000129699707},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.46720001101493835},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.45829999446868896},{"id":"https://openalex.org/C2775973920","wikidata":"https://www.wikidata.org/wiki/Q3252726","display_name":"Selection algorithm","level":3,"score":0.42750000953674316},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4221999943256378},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36899998784065247},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.36629998683929443},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.36489999294281006},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.34929999709129333},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.34790000319480896},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.34139999747276306},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2921000123023987},{"id":"https://openalex.org/C179957908","wikidata":"https://www.wikidata.org/wiki/Q907206","display_name":"POVM","level":5,"score":0.28859999775886536},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.26170000433921814},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.258899986743927}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2602.15049","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15049","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2602.15049","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.15049","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.6436774730682373,"display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimal":[0],"Access":[1],"Point":[2],"(AP)":[3],"selection":[4,30,51,80,156,211,231],"is":[5,13],"crucial":[6],"for":[7,93,233],"accurate":[8],"indoor":[9,41],"localization,":[10,198],"yet":[11],"it":[12,91,119],"constrained":[14],"by":[15,139,189],"budget,":[16],"creating":[17],"a":[18,48,54,73,83,106,121,143,168,174],"trade-off":[19],"between":[20],"localization":[21,146,187],"accuracy":[22,160],"and":[23,117,161,213],"deployment":[24],"cost.":[25],"Classical":[26],"approaches":[27],"to":[28,63,192],"AP":[29,155,210],"are":[31],"often":[32],"computationally":[33],"expensive,":[34],"hindering":[35],"their":[36],"application":[37],"in":[38,120,158],"large-scale":[39,234],"3D":[40,123,145,235],"environments.":[42],"In":[43],"this":[44],"paper,":[45],"we":[46],"introduce":[47],"quantum":[49,61,94,115,151,200,229],"APs":[50,70,79,138,220,230],"algorithm":[52,59,116,232],"under":[53],"budget":[55],"constraint.":[56],"The":[57,97],"proposed":[58,98,114,130,150,228],"leverages":[60],"annealing":[62,95],"identify":[64],"the":[65,78,113,129,134,149,185,193,199,208,216,224,227],"most":[66],"effective":[67],"subset":[68],"of":[69,136,170,176,219,226],"allowed":[71],"within":[72],"given":[74],"budget.":[75],"We":[76,111],"formulate":[77],"problem":[81],"as":[82],"quadratic":[84],"unconstrained":[85],"binary":[86],"optimization":[87],"(QUBO)":[88],"problem,":[89],"making":[90],"suitable":[92],"solvers.":[96],"technique":[99,166],"can":[100,132],"drastically":[101],"reduce":[102,133],"infrastructure":[103],"requirements":[104],"with":[105],"negligible":[107],"impact":[108],"on":[109],"performance.":[110],"implement":[112],"deploy":[118],"realistic":[122],"testbed.":[124],"Our":[125],"results":[126],"show":[127],"that":[128],"approach":[131,152,201],"number":[135],"required":[137],"96.1%":[140],"while":[141,183],"maintaining":[142],"comparable":[144],"accuracy.":[147],"Furthermore,":[148],"outperforms":[153],"classical":[154,181,194,209],"algorithms":[157],"both":[159,207],"computational":[162],"speed.":[163],"Specifically,":[164],"our":[165],"achieves":[167,202],"time":[169],"0.20":[171],"seconds,":[172],"representing":[173],"speedup":[175],"61":[177],"times":[178],"over":[179],"its":[180],"counterpart,":[182],"reducing":[184],"mean":[186],"error":[188],"10%":[190],"compared":[191],"counterpart.":[195],"For":[196],"floor":[197,204],"73%":[203],"accuracy,":[205],"outperforming":[206],"(58.6%)":[212],"even":[214],"using":[215],"complete":[217],"set":[218],"(70.4%).":[221],"This":[222],"highlights":[223],"promise":[225],"localization.":[236]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-02-19T00:00:00"}