## E.A. Dahlberg

18 records found

1

## Authored

We numerically study the distribution of entanglement between the Dutch cities of Delft and Eindhoven realized with a processing-node quantum repeater and determine minimal hardware requirements for verifiable blind quantum computation using color centers and trapped ions. Our ...

Quantum communication research has in recent years shifted to include multipartite networks for which questions of quantum network routing naturally emerge. To understand the potential for multipartite routing, we focus on the most promising architectures for future quantum ne ...

The past decade has seen tremendous progress in experimentally realizing the building blocks of quantum repeaters. Repeater architectures with multiplexed quantum memories have been proposed to increase entanglement distribution rates, but an open challenge is to maintain enta ...

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 subject of intense study in graph theory over the last decades and have found applications in other fi ...

## Entanglement Generation in Quantum Networks

### Towards a universal and scalable quantum internet

In order to bring quantum networks into the real world, we would like to determine the requirements of quantum network protocols including the underlying quantum hardware. Because detailed architecture proposals are generally too complex for mathematical analysis, it is natura ...

## How to transform graph states using single-qubit operations

### Computational complexity and algorithms

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 fundamental building block for a quantum internet is the distribution of Bell pairs between distan ...

We present an architecture for multiplexed quantum repeaters using local connectivity to improve fidelity in entanglement distribution. Simulations indicate our scheme achieves rates comparable to competing schemes, with fidelity improvements that increase with repeater size.< ...

Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation-the graph operation that links all local-Clifford equivalent graph states-allows us to classify all stabiliser states by their entang ...

Graph states, which include Bell states, Greenberger-Horne-Zeilinger (GHZ) states, and cluster states, form a well-known class of quantum states with applications ranging from quantum networks to error-correction. Whether two graph states are equivalent up to single-qubit Clif ...

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 quantum internet system. We propose a functional allocation of a quantum network stack, and cons ...

Stabilizer states form an important class of states in quantum information, and are of central importance in quantum error correction. Here, we provide an algorithm for deciding whether one stabilizer (target) state can be obtained from another stabilizer (source) state by sin ...