Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986)
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: Hard combinatorial problems and minor embeddings on lattice graphs |
scientific article; zbMATH DE number 7629883
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hard combinatorial problems and minor embeddings on lattice graphs |
scientific article; zbMATH DE number 7629883 |
Statements
Hard combinatorial problems and minor embeddings on lattice graphs (English)
0 references
8 December 2022
0 references
quantum adiabatic optimization
0 references
minor embedding
0 references
NP-hard optimization
0 references
0 references
0.8624403476715088
0 references
0.8420495986938477
0 references
0.8291240930557251
0 references
0.8146873116493225
0 references
0.8099032640457153
0 references
