275 citations · 1.1k across the 16 of their papers we have counts for
6 papers · 1 filter
Mapping graph state orbits under local complementation
Jeremy C. Adcock, Sam Morley-Short, Axel Dahlberg +1
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all…
Distributed Routing in a Quantum Internet
Kaushik Chakraborty, Filip Rozpedek, Axel Dahlberg +1
We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operati…
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…
A Link Layer Protocol for Quantum Networks
Axel Dahlberg, Matthew Skrzypczyk, Tim Coopmans +9
Quantum communication brings radically new capabilities that are provably impossible to attain in any classical network. Here, we take the first step from a physics experiment to a…