Fingerprint
Dive into the research topics of 'Transforming graph states to Bell-pairs is NP-Complete'. Together they form a unique fingerprint.- Sort by
- Weight
- Alphabetically
Transforming graph states to Bell-pairs is NP-Complete
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Research output: Contribution to journal › Article › Scientific › peer-review
2
Citations
(Scopus)
101
Downloads
(Pure)