Constrained-optimization Approach Delivers Superior Classical Performance for Graph Partitioning via Quantum-ready Method
Open accessAbstract
Graph partitioning is one of an important set of well-known compute-intense (NP-hard) graph problems that devolve to discrete constrained optimization. We sampled solutions to the problem via two different quantum-ready methods to understand the strengths and weaknesses of each method. First we formulated and sampled the problem as a quadratic unconstrained binary optimization (QUBO) problem, via the best known QUBO formulation, using a best-in-class QUBO sampler running purely classically. Second, we formulated the problem at a higher level, as a set of constraints and an objective function, and sampled it with a recently developed constrained-optimization sampler (which generates QUBOs and also samples them classically). We find that both approaches often deliver better partitions than the purpose-built classical graph partitioners. Further, we find that the constrained-optimization approach is often able to deliver better partitions in less time than the bespoke-QUBO approach, without specific knowledge of the graph-partitioning problem. Stepping back from graph partitioning itself, one key question is whether bespoke algorithms for high-value problems or general tools for classes of problems are more likely to deliver the power of QCs to a broad market of real-world users. We believe this early evidence, though anecdotal, supports the proposition that general tools may contribute significant benefit to a range of problems, expanding the impact of QCs on industry and society. The fact that this benefit is independent of the low-level sampler employed, whether classical software or one of a variety of QC architectures, reinforces the need for further work on high-level optimization. The commercial availability in the cloud of such software today, delivering superior classical performance for some problems, enables quantum-forward organizations to migrate to quantum-ready methods now, accelerating progress toward quantum advantage and ensuring sampler software evolves to address the problems such organizations value.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The graph partitioning problem is an example of quantum-ready approaches solved with a purely classical sampler.
“An example for the so-called quantum-ready approaches is represented by the graph partitioning problem [30] solved with a purely classical sampler.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [30]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 19 · Cited by 9
Research works printed but not linked: 1
- Peter Sanders and Christian Schultz. KaHIP v2. 00-Karlsruhe High Quality Partitioning User Guide. arXiv preprint arXiv:1311.1714, 2013. · arXiv
- Authors
- Chukwu, U., Dridi, R., Berwald, J., Booth, M., Dawson, J., Le, D., Wainger, M., & Reinhardt, S. P.
- Venue
- 2020 IEEE High Performance Extreme Computing Conference (HPEC)
- Publisher
- IEEE
- Published
- 2020-09-22
- Pages
- 1-6
- OpenAlex
- W3038100772
- Cited by
- 9
- References
- 19
- Citations by year
- 2025: 1 · 2023: 2 · 2022: 5 · 2021: 1
- FWCI
- 0.75
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE High Performance Extreme Computing Conference (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- graph partitioning, constrained optimization, QUBO formulation, NP-hard combinatorial optimization, quantum advantage
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review