Constraint-oriented biased quantum search for general constrained combinatorial optimization problems Article Swipe
We present a quantum algorithmic routine that extends the realm of Grover-based heuristics for tackling combinatorial optimization problems with arbitrary efficiently computable objective and constraint functions. Building on previously developed quantum methods that were primarily restricted to linear constraints, we generalize the approach to encompass a broader class of problems in discrete domains. To evaluate the potential of our algorithm, we assume the existence of sufficiently advanced logical quantum hardware. With this assumption, we demonstrate that our method has the potential to outperform state-of-the-art classical solvers and heuristics in terms of both runtime scaling and solution quality. The same may be true for more realistic implementations, as the logical quantum algorithm can achieve runtime savings of up to $10^2-10^3$.
Related Topics
Concepts
Heuristics
Quantum
Class (philosophy)
Computer science
Quantum algorithm
Mathematical optimization
Theoretical computer science
Constraint (computer-aided design)
Quantum computer
Quantum annealing
Optimization problem
Mathematics
Scaling
Combinatorial optimization
Algorithm
Constraint satisfaction problem
Adiabatic quantum computation
Combinatorial search
Quadratic unconstrained binary optimization
Metadata
- Type
- article
- Landing Page
- http://arxiv.org/abs/2512.08384
- https://arxiv.org/pdf/2512.08384
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W7114820542
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W7114820542Canonical identifier for this work in OpenAlex
- Title
-
Constraint-oriented biased quantum search for general constrained combinatorial optimization problemsWork title
- Type
-
articleOpenAlex work type
- Publication year
-
2025Year of publication
- Publication date
-
2025-12-09Full publication date if available
- Authors
-
Wilkening, SörenList of authors in order
- Landing page
-
https://arxiv.org/abs/2512.08384Publisher landing page
- PDF URL
-
https://arxiv.org/pdf/2512.08384Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://arxiv.org/pdf/2512.08384Direct OA link when available
- Concepts
-
Heuristics, Quantum, Class (philosophy), Computer science, Quantum algorithm, Mathematical optimization, Theoretical computer science, Constraint (computer-aided design), Quantum computer, Quantum annealing, Optimization problem, Mathematics, Scaling, Combinatorial optimization, Algorithm, Constraint satisfaction problem, Adiabatic quantum computation, Combinatorial search, Quadratic unconstrained binary optimizationTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W7114820542 |
|---|---|
| doi | |
| ids.openalex | https://openalex.org/W7114820542 |
| fwci | 0.0 |
| type | article |
| title | Constraint-oriented biased quantum search for general constrained combinatorial optimization problems |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T10682 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9911367893218994 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | Quantum Computing Algorithms and Architecture |
| topics[1].id | https://openalex.org/T10020 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.0008701826445758343 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Quantum Information and Cryptography |
| topics[2].id | https://openalex.org/T10720 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.0006250272854231298 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1703 |
| topics[2].subfield.display_name | Computational Theory and Mathematics |
| topics[2].display_name | Complexity and Algorithms in Graphs |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C127705205 |
| concepts[0].level | 2 |
| concepts[0].score | 0.7098698616027832 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q5748245 |
| concepts[0].display_name | Heuristics |
| concepts[1].id | https://openalex.org/C84114770 |
| concepts[1].level | 2 |
| concepts[1].score | 0.5485036373138428 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q46344 |
| concepts[1].display_name | Quantum |
| concepts[2].id | https://openalex.org/C2777212361 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5141446590423584 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q5127848 |
| concepts[2].display_name | Class (philosophy) |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.5021126866340637 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C137019171 |
| concepts[4].level | 3 |
| concepts[4].score | 0.48758435249328613 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q2623817 |
| concepts[4].display_name | Quantum algorithm |
| concepts[5].id | https://openalex.org/C126255220 |
| concepts[5].level | 1 |
| concepts[5].score | 0.4335238039493561 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[5].display_name | Mathematical optimization |
| concepts[6].id | https://openalex.org/C80444323 |
| concepts[6].level | 1 |
| concepts[6].score | 0.4276086390018463 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[6].display_name | Theoretical computer science |
| concepts[7].id | https://openalex.org/C2776036281 |
| concepts[7].level | 2 |
| concepts[7].score | 0.4251558482646942 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q48769818 |
| concepts[7].display_name | Constraint (computer-aided design) |
| concepts[8].id | https://openalex.org/C58053490 |
| concepts[8].level | 3 |
| concepts[8].score | 0.42467889189720154 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q176555 |
| concepts[8].display_name | Quantum computer |
| concepts[9].id | https://openalex.org/C90408235 |
| concepts[9].level | 4 |
| concepts[9].score | 0.41158244013786316 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q938141 |
| concepts[9].display_name | Quantum annealing |
| concepts[10].id | https://openalex.org/C137836250 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4102650284767151 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q984063 |
| concepts[10].display_name | Optimization problem |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.3937872052192688 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C99844830 |
| concepts[12].level | 2 |
| concepts[12].score | 0.37627890706062317 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q102441924 |
| concepts[12].display_name | Scaling |
| concepts[13].id | https://openalex.org/C52692508 |
| concepts[13].level | 2 |
| concepts[13].score | 0.37042003870010376 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1333872 |
| concepts[13].display_name | Combinatorial optimization |
| concepts[14].id | https://openalex.org/C11413529 |
| concepts[14].level | 1 |
| concepts[14].score | 0.3270019292831421 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[14].display_name | Algorithm |
| concepts[15].id | https://openalex.org/C199622910 |
| concepts[15].level | 3 |
| concepts[15].score | 0.3023412525653839 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q1128326 |
| concepts[15].display_name | Constraint satisfaction problem |
| concepts[16].id | https://openalex.org/C192353077 |
| concepts[16].level | 4 |
| concepts[16].score | 0.29835325479507446 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q4682635 |
| concepts[16].display_name | Adiabatic quantum computation |
| concepts[17].id | https://openalex.org/C203208320 |
| concepts[17].level | 4 |
| concepts[17].score | 0.27310484647750854 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q5150830 |
| concepts[17].display_name | Combinatorial search |
| concepts[18].id | https://openalex.org/C177179195 |
| concepts[18].level | 4 |
| concepts[18].score | 0.2512732744216919 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q7268372 |
| concepts[18].display_name | Quadratic unconstrained binary optimization |
| keywords[0].id | https://openalex.org/keywords/heuristics |
| keywords[0].score | 0.7098698616027832 |
| keywords[0].display_name | Heuristics |
| keywords[1].id | https://openalex.org/keywords/quantum |
| keywords[1].score | 0.5485036373138428 |
| keywords[1].display_name | Quantum |
| keywords[2].id | https://openalex.org/keywords/class |
| keywords[2].score | 0.5141446590423584 |
| keywords[2].display_name | Class (philosophy) |
| keywords[3].id | https://openalex.org/keywords/quantum-algorithm |
| keywords[3].score | 0.48758435249328613 |
| keywords[3].display_name | Quantum algorithm |
| keywords[4].id | https://openalex.org/keywords/constraint |
| keywords[4].score | 0.4251558482646942 |
| keywords[4].display_name | Constraint (computer-aided design) |
| keywords[5].id | https://openalex.org/keywords/quantum-computer |
| keywords[5].score | 0.42467889189720154 |
| keywords[5].display_name | Quantum computer |
| keywords[6].id | https://openalex.org/keywords/quantum-annealing |
| keywords[6].score | 0.41158244013786316 |
| keywords[6].display_name | Quantum annealing |
| language | |
| locations[0].id | pmh:oai:arXiv.org:2512.08384 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://arxiv.org/pdf/2512.08384 |
| locations[0].version | submittedVersion |
| locations[0].raw_type | text |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | False |
| locations[0].is_published | False |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | http://arxiv.org/abs/2512.08384 |
| indexed_in | arxiv |
| authorships[0].author.id | |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | Wilkening, Sören |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Wilkening, Sören |
| authorships[0].is_corresponding | True |
| has_content.pdf | True |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://arxiv.org/pdf/2512.08384 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-12-11T00:00:00 |
| display_name | Constraint-oriented biased quantum search for general constrained combinatorial optimization problems |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-12-12T23:20:42.204495 |
| primary_topic.id | https://openalex.org/T10682 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9911367893218994 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | Quantum Computing Algorithms and Architecture |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | pmh:oai:arXiv.org:2512.08384 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://arxiv.org/pdf/2512.08384 |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | text |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | http://arxiv.org/abs/2512.08384 |
| primary_location.id | pmh:oai:arXiv.org:2512.08384 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://arxiv.org/pdf/2512.08384 |
| primary_location.version | submittedVersion |
| primary_location.raw_type | text |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | http://arxiv.org/abs/2512.08384 |
| publication_date | 2025-12-09 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 2, 45 |
| abstract_inverted_index.To | 53 |
| abstract_inverted_index.We | 0 |
| abstract_inverted_index.as | 106 |
| abstract_inverted_index.be | 100 |
| abstract_inverted_index.in | 50, 88 |
| abstract_inverted_index.of | 10, 48, 57, 64, 90, 115 |
| abstract_inverted_index.on | 27 |
| abstract_inverted_index.to | 36, 43, 81, 117 |
| abstract_inverted_index.up | 116 |
| abstract_inverted_index.we | 39, 60, 73 |
| abstract_inverted_index.The | 97 |
| abstract_inverted_index.and | 23, 86, 94 |
| abstract_inverted_index.can | 111 |
| abstract_inverted_index.for | 13, 102 |
| abstract_inverted_index.has | 78 |
| abstract_inverted_index.may | 99 |
| abstract_inverted_index.our | 58, 76 |
| abstract_inverted_index.the | 8, 41, 55, 62, 79, 107 |
| abstract_inverted_index.With | 70 |
| abstract_inverted_index.both | 91 |
| abstract_inverted_index.more | 103 |
| abstract_inverted_index.same | 98 |
| abstract_inverted_index.that | 6, 32, 75 |
| abstract_inverted_index.this | 71 |
| abstract_inverted_index.true | 101 |
| abstract_inverted_index.were | 33 |
| abstract_inverted_index.with | 18 |
| abstract_inverted_index.class | 47 |
| abstract_inverted_index.realm | 9 |
| abstract_inverted_index.terms | 89 |
| abstract_inverted_index.assume | 61 |
| abstract_inverted_index.linear | 37 |
| abstract_inverted_index.method | 77 |
| abstract_inverted_index.achieve | 112 |
| abstract_inverted_index.broader | 46 |
| abstract_inverted_index.extends | 7 |
| abstract_inverted_index.logical | 67, 108 |
| abstract_inverted_index.methods | 31 |
| abstract_inverted_index.present | 1 |
| abstract_inverted_index.quantum | 3, 30, 68, 109 |
| abstract_inverted_index.routine | 5 |
| abstract_inverted_index.runtime | 92, 113 |
| abstract_inverted_index.savings | 114 |
| abstract_inverted_index.scaling | 93 |
| abstract_inverted_index.solvers | 85 |
| abstract_inverted_index.Building | 26 |
| abstract_inverted_index.advanced | 66 |
| abstract_inverted_index.approach | 42 |
| abstract_inverted_index.discrete | 51 |
| abstract_inverted_index.domains. | 52 |
| abstract_inverted_index.evaluate | 54 |
| abstract_inverted_index.problems | 17, 49 |
| abstract_inverted_index.quality. | 96 |
| abstract_inverted_index.solution | 95 |
| abstract_inverted_index.tackling | 14 |
| abstract_inverted_index.algorithm | 110 |
| abstract_inverted_index.arbitrary | 19 |
| abstract_inverted_index.classical | 84 |
| abstract_inverted_index.developed | 29 |
| abstract_inverted_index.encompass | 44 |
| abstract_inverted_index.existence | 63 |
| abstract_inverted_index.hardware. | 69 |
| abstract_inverted_index.objective | 22 |
| abstract_inverted_index.potential | 56, 80 |
| abstract_inverted_index.primarily | 34 |
| abstract_inverted_index.realistic | 104 |
| abstract_inverted_index.algorithm, | 59 |
| abstract_inverted_index.computable | 21 |
| abstract_inverted_index.constraint | 24 |
| abstract_inverted_index.functions. | 25 |
| abstract_inverted_index.generalize | 40 |
| abstract_inverted_index.heuristics | 12, 87 |
| abstract_inverted_index.outperform | 82 |
| abstract_inverted_index.previously | 28 |
| abstract_inverted_index.restricted | 35 |
| abstract_inverted_index.algorithmic | 4 |
| abstract_inverted_index.assumption, | 72 |
| abstract_inverted_index.demonstrate | 74 |
| abstract_inverted_index.efficiently | 20 |
| abstract_inverted_index.$10^2-10^3$. | 118 |
| abstract_inverted_index.Grover-based | 11 |
| abstract_inverted_index.constraints, | 38 |
| abstract_inverted_index.optimization | 16 |
| abstract_inverted_index.sufficiently | 65 |
| abstract_inverted_index.combinatorial | 15 |
| abstract_inverted_index.implementations, | 105 |
| abstract_inverted_index.state-of-the-art | 83 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 1 |
| citation_normalized_percentile.value | 0.91805922 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | True |