| Naslov: | Quantum computing and the stable set problem |
|---|
| Avtorji: | ID Krpan, Aljaž (Avtor)
ID Povh, Janez (Avtor)
ID Pucher, Dunja (Avtor) |
|---|
| Datoteke: |  URL - Izvorni URL, za dostop obiščite https://www.tandfonline.com/doi/full/10.1080/10556788.2025.2490639
 PDF - Predstavitvena datoteka, prenos (2,71 MB)
MD5: FFA08541E4615E24ADFBC1D222DDDF75
|
|---|
| Jezik: | Angleški jezik |
|---|
| Tipologija: | 1.01 - Izvirni znanstveni članek |
|---|
| Organizacija: |  RUDOLFOVO - Rudolfovo – Znanstveno in tehnološko središče Novo mesto
|
|---|
| Povzetek: | Given an undirected graph, the stable set problem asks to determine the cardinality of the largest subset of pairwise non-adjacent vertices. This value is called the stability number of the graph, and its computation is an NP-hard problem. In this paper, we solve the stable set problem using the D-Wave quantum annealer. By formulating the problem as a quadratic unconstrained binary optimization problem with the penalty method, we show its optimal value equals the graph's stability number for specific penalty values. However, D-Wave's quantum annealer is a heuristic, so the solutions may be far from the optimum and may not represent stable sets. To address these, we introduce a post-processing procedure that identifies samples that could lead to improved solutions. Additionally, we propose a partitioning method to handle larger instances that cannot be embedded on D-Wave's quantum processing unit. Finally, we investigate how different penalty parameter values affect the solutions' quality. Extensive computational results show that the post-processing procedure significantly improves the solution quality, while the partitioning method successfully extends our approach to medium-size instances. |
|---|
| Ključne besede: | stable set problem, quantum annealing, graph partitioning, D-Wave |
|---|
| Status publikacije: | V tisku |
|---|
| Verzija publikacije: | Objavljena publikacija |
|---|
| Poslano v recenzijo: | 22.05.2025 |
|---|
| Datum sprejetja članka: | 12.03.2025 |
|---|
| Datum objave: | 21.05.2025 |
|---|
| Založnik: | Taylor & Francis Group |
|---|
| Leto izida: | 2025 |
|---|
| Št. strani: | str. 837-870 |
|---|
| Številčenje: | Vol. 40, iss. 4 |
|---|
| PID: | 20.500.12556/DiRROS-23885  |
|---|
| UDK: | 51 |
|---|
| ISSN pri članku: | Y506-0494 |
|---|
| DOI: | 10.1080/10556788.2025.2490639 |
|---|
| COBISS.SI-ID: | 253384707 |
|---|
| Avtorske pravice: | © 2025 The Author(s) |
|---|
| Opomba: | Nasl. z nasl. zaslona;
Opis vira z dne 16. 10. 2025;
|
|---|
| Datum objave v DiRROS: | 13.11.2025 |
|---|
| Število ogledov: | 186 |
|---|
| Število prenosov: | 94 |
|---|
| Metapodatki: |    |
|---|
|
:
|
Kopiraj citat |
|---|
| | | | Objavi na: |  |
|---|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |
