Related papers: Bell pair extraction using graph foliage technique…
We investigate the exploitation of various combinatorial properties of graphs and set systems to study several issues in quantum information theory. We characterize the combinatorics of distributed EPR pairs for preparing multi-partite…
If a photon interacts with a member of an entangled photon pair via a so-called Bell-state measurement (BSM), its state is teleported over principally arbitrary distances onto the second member of the pair. Starting in 1997, this puzzling…
Exchanging particles on graphs, or more concretely on networks of quantum wires, has been proposed as a means to perform fault tolerant quantum computation. This was inspired by braiding of anyons in planar systems. However, exchanges on a…
Quantum networking allows the transmission of information in ways unavailable in the classical world. Single packets of information can now be split and transmitted in a coherent way over different routes. This aggregation allows…
The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph…
Quantum correlations arising in Bell experiments, involving a physical source that emits a quantum state to a number of observers, have been intensively studied over the last decades. Much less is known about the nature of quantum…
A quantum protocol for sharing an arbitrary two-qubit state between N parties is introduced. Any of the members, can retrieve the state, only with collaboration of the other parties. We will show that in terms of resources, i.e. the number…
The problem of characterizing classical and quantum correlations in networks is considered. Contrary to the usual Bell scenario, where distant observers share a physical system emitted by one common source, a network features several…
Distributed quantum computing is motivated by the difficulty in building large-scale, individual quantum computers. To solve that problem, a large quantum circuit is partitioned and distributed to small quantum computers for execution.…
Quantum networks with bipartite resources and shared randomness present the simplest infrastructure for implementing a future quantum internet. Here, we shall investigate which kinds of entanglement can or cannot be generated from this kind…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
The correlations in quantum networks have attracted strong interest with new types of violations of the locality. The standard Bell inequalities cannot characterize the multipartite correlations that are generated by multiple sources. The…
Multipartite entangled states, particularly Greenberger--Horne--Zeilinger (GHZ) and other graph states, are important resources in multiparty quantum network protocols and measurement-based quantum computing. We consider the problem of…
Quantum nonlocality in networks featuring multiple independent sources underpins large-scale quantum communication and poses fundamental challenges for its characterization. In this work, we construct a family of explicit nonlinear Bell…
This article explores the application of coding techniques for fault-tolerant quantum computation and extends their usage to fault-tolerant quantum communication. We review repeater-based quantum networks, emphasizing the roles of coding…
Quantum networks will allow to implement communication tasks beyond the reach of their classical counterparts. A pressing and necessary issue for the design of quantum network protocols is the quantification of the rates at which these…
Quantum networks distributed over distances greater than a few kilometers will be limited by the time required for information to propagate between nodes. We analyze protocols that are able to circumvent this bottleneck by employing…
We consider a heterogeneous network of quantum computing modules, sparsely connected via Bell states. Operations across these connections constitute a computational bottleneck and they are likely to add more noise to the computation than…
Distinguishing sets of quantum states shared by two parties using only local operations and classical communication measurements is a fundamental topic in quantum communication and quantum information theory. We introduce a graph-theoretic…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…