274 citations · 932 across the 21 of their papers we have counts for
4 papers · 1 filter
Counting single-qubit Clifford equivalent graph states is #P-Complete
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Graph states, which include for example Bell states, GHZ states and cluster states, form a well-known class of quantum states with applications ranging from quantum networks to err…
Transforming graph states to Bell-pairs is NP-Complete
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One f…
The complexity of the vertex-minor problem
Axel Dahlberg, Jonas Helsen, Stephanie Wehner
A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subje…
Spectral Quantum Tomography
Jonas Helsen, Francesco Battistel, Barbara M. Terhal
We introduce spectral quantum tomography, a simple method to extract the eigenvalues of a noisy few-qubit gate, represented by a trace-preserving superoperator, in a SPAM-resistant…