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

Axel Dahlberg, Jonas Helsen, Stephanie Wehner (2019)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2019-07-23

a service of  Schloss Dagstuhl - Leibniz Center for Informatics