Transforming graph states to Bell-pairs is NP-Complete (Q6322318)
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: Transforming graph states to Bell-pairs is NP-Complete |
scientific article; zbMATH DE number 900413412
Language | Label | Description | Also known as |
---|---|---|---|
English | Transforming graph states to Bell-pairs is NP-Complete |
scientific article; zbMATH DE number 900413412 |
Statements
18 July 2019
0 references
quant-ph
0 references
cs.CC
0 references
math.CO
0 references