Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911302457229312 |
|---|---|
| author | Wilkening, Sören Ziegler, Timo Hess, Maximilian |
| author_facet | Wilkening, Sören Ziegler, Timo Hess, Maximilian |
| contents | In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introduced method as a framework that enables performance improvements through circuit optimization and machine learning techniques. Comparisons with state-of-the-art classical solvers further demonstrate the algorithm's potential to achieve a quantum advantage in terms of speed, given appropriate quantum hardware. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_05205 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems Wilkening, Sören Ziegler, Timo Hess, Maximilian Quantum Physics In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introduced method as a framework that enables performance improvements through circuit optimization and machine learning techniques. Comparisons with state-of-the-art classical solvers further demonstrate the algorithm's potential to achieve a quantum advantage in terms of speed, given appropriate quantum hardware. |
| title | Constraint-oriented biased quantum search for linear constrained combinatorial optimization problems |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2512.05205 |