Related papers: Linear programs for entanglement and key distribut…
We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement…
Entanglement distribution is essential for unlocking the potential of distributed quantum information processing. We consider an $N$-partite network where entanglement is distributed via a central source over lossy channels, and network…
We present a stack model for breaking down the complexity of entanglement-based quantum networks. More specifically, we focus on the structures and architectures of quantum networks and not on concrete physical implementations of network…
Scaling the number of entangled nodes in a quantum network is a challenge with significant implications for quantum computing, clock synchronisation, secure communications, and quantum sensing. In a quantum network, photons interact with…
In the Quantum Internet, multipartite entanglement enables a rich and dynamic overlay topology, referred to as artificial topology, upon the physical one, that can be exploited for communication purposes. In fact, the ability to extract…
A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be…
Solving linear systems of equations is ubiquitous in all areas of science and engineering. With rapidly growing data sets, such a task can be intractable for classical computers, as the best known classical algorithms require a time…
Quantum networks rely on the efficient distribution of entanglement to enable long-distance quantum communication and information processing. A key challenge in these networks is the design of routing protocols capable of maintaining high…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
Quantum networking can be realized by distributing pairs of entangled qubits between remote quantum processing nodes. Devoted communication qubits within each node can naturally interface with photons which bus quantum information between…
We investigate the optimal estimation of a quantum process that can possibly consist of multiple time steps. The estimation is implemented by a quantum network that interacts with the process by sending an input and processing the output at…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
Large-scale quantum networks with thousands of nodes require scalable network protocols and physical hardware to realize. In this work, we introduce packet switching as a new paradigm for quantum data transmission in both future and…
Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…
Small interconnected quantum processors can collaborate to tackle quantum computational problems that typically demand more capable devices. These linked processors, referred to as quantum nodes, can use shared entangled states to execute…
It is well known that quantum technology allows for an unprecedented level of data and software protection for quantum computers as well as for quantum-assisted classical computers. To exploit these properties, probabilistic one-time…
We consider the problem of generating multipartite entangled states in a quantum network upon request. We follow a top-down approach, where the required entanglement is initially present in the network in form of network states shared…
The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a…
Entanglement generation in long-distance quantum networks is a difficult process due to resource limitations and the probabilistic nature of entanglement swapping. To maximize success probability, existing quantum routing algorithms employ…
We design quantum compression algorithms for parametric families of tensor network states. We first establish an upper bound on the amount of memory needed to store an arbitrary state from a given state family. The bound is determined by…