Related papers: Random entanglement percolation on realistic quant…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
Establishing long-distance quantum entanglement, i.e., entanglement transmission, in quantum networks (QN) is a key and timely challenge for developing efficient quantum communication. Traditional comprehension based on classical…
Exact computations of polarizations correlations probabilities are carried out in QED, to the leading order, for initially polarized as well as unpolarized particles. Quite generally they are found to be speed dependent and are in clear…
We discuss two sampling schemes for selecting random subnets from a network: Random sampling and connectivity dependent sampling, and investigate how the degree distribution of a node in the network is affected by the two types of sampling.…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
Directed and heterogeneous hypergraphs capture directional higher-order interactions with intrinsically asymmetric functional dependencies among nodes. As a result, damage to certain nodes can suppress entire hyperedges, whereas failure of…
A workflow for evaluation of entanglement source quality is proposed. Based on quantum state density matrices obtained from theoretical models and experimental data, we make an estimate of a potential performance of a quantum entanglement…
Percolation theory concerns the emergence of connected clusters that percolate through a networked system. Previous studies ignored the effect that a node outside the percolating cluster may actively induce its inside neighbours to exit the…
Quantum repeater networks are a fundamental of any future quantum Internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous,…
We describe a percolation problem on lattices (graphs, networks), with edge weights drawn from disorder distributions that allow for weights (or distances) of either sign, i.e. including negative weights. We are interested whether there are…
We propose a novel scheme to generate polarization entanglement from spatially-correlated photon pairs. We experimentally realized a scheme by means of a spatial correlation effect in a spontaneous parametric down-conversion and a modified…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
We consider the problem of multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. Multi-path entanglement distribution enables a network…
We introduce and analyze the entanglement properties of randomized hypergraph states, as an extended notion of the randomization procedure in the quantum logic gates for the usual graph states, recently proposed in the literature. The…
The frame of classical probability theory can be generalized by enlarging the usual family of random variables in order to encompass nondeterministic ones: this leads to a frame in which two kinds of correlations emerge: the classical…
Entanglement is not only the most intriguing feature of quantum mechanics, but also a key resource in quantum information science. The entanglement content of random pure quantum states is almost maximal; such states find applications in…
High-dimensional entangled states, such as spatially-entangled photon pairs produced by Spontaneous Parametric Down-Conversion (SPDC), are a key resource for quantum technologies. In recent years, camera-based coincidence counting…
While for standard percolation directionality is known to increase the combinatorial complexity of percolation, here we show that when connectivity is ensured by paths of length $R\geq 2$, network directionality, impeding backtracking, can…
Quantum network protocols depend on the availability of shared entanglement. Given that entanglement generation and distribution are affected by noise, characterization of the shared entangled states is essential to bound the errors of the…
Biased (degree-dependent) percolation was recently shown to provide new strategies for turning robust networks fragile and vice versa. Here we present more detailed results for biased edge percolation on scale-free networks. We assume a…