"Transforming graph states to Bell-pairs is NP-Complete."

Axel Dahlberg, Jonas Helsen, Stephanie Wehner (2020)

Details and statistics

DOI: 10.22331/Q-2020-10-22-348

access: open

type: Journal Article

metadata version: 2021-09-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics