Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Characterization of QUBO reformulations for the maximum k-colorable subgraph problem |
scientific article; zbMATH DE number 7625440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem |
scientific article; zbMATH DE number 7625440 |
Statements
Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (English)
0 references
29 November 2022
0 references
quantum computing
0 references
NISQ devices
0 references
QUBO reformulations
0 references
combinatorial optimization
0 references
Chimera versus Pegasus D-wave annealer
0 references
0 references
0 references
0 references
0 references
0 references
0.780879020690918
0 references
0.778212308883667
0 references
0.7586238980293274
0 references
0.7537116408348083
0 references
0.7328190207481384
0 references
