Related papers: Long Distance Entanglement Generation in 2D Networ…
An example is given of an interaction that produces an infinite amount of entanglement in an infinitely short time, but only a finite amount in longer times. The interaction arises from a standard Kerr nonlinearity and a 50/50 beamsplitter,…
Entanglement distribution is a critical technique that enables numerous quantum applications. Most fiber-based long-distance experiments reported to date have utilized photon pair sources generated in bulk optical crystals, with the…
Chiral quantum networks provide a promising route for realising quantum information processing and quantum communication. Here, we describe how two distant quantum nodes of chiral quantum network become dynamically entangled by a photon…
We generally investigate necessary conditions for the generation of the long-distance entanglement. We consider a quantum system in which a system mediates the indirect interaction between two spins, which we refer to as probe spins. First,…
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 propose a scheme for fault-tolerant long-range entanglement generation at the ends of a rectangular array of qubits of length $R$ and a square cross section of size $d\times d$ with $d=O(\log R)$. Up to an efficiently computable Pauli…
In this work, we construct small sets of bipartite orthogonal pure states that cannot be perfectly distinguished by local operations and classical communication (LOCC). We mention that not all the states within the constructed sets are…
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…
The existence of a maximally entangled pure state is a cornerstone result of entanglement theory that has paramount consequences in quantum information theory. A natural generalization of this property is to consider whether a notion of…
Multipartite entanglement is of important resources for quantum communication and quantum computation. Our goal in this paper is to characterize general multipartite entangled states according to shallow quantum circuits. We firstly prove…
Entangled states shared among distant nodes are frequently used in quantum network applications. When quantum resources are abundant, entangled states can be continuously distributed across the network, allowing nodes to consume them…
Quantum networks enable a number of important applications such as quantum key distribution. The basic function of a quantum network is to enable long-distance quantum entanglement between two remote communication parties. This work focuses…
We study the limits of bipartite entanglement distribution using a chain of quantum repeaters that have quantum memories. To generate end-to-end entanglement, each node can attempt the generation of an entangled link with a neighbor, or…
Designing algorithms that generate networks with a given degree sequence while varying both subgraph composition and distribution of subgraphs around nodes is an important but challenging research problem. Current algorithms lack control of…
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in…
Beyond future applications, quantum networks open interesting fundamental perspectives, notably novel forms of quantum correlations. In this work we discuss quantum correlations in networks from the perspective of the underlying quantum…
Entanglement is essential in quantum information science. Typically, the inevitable coupling between quantum systems and environment inhibits entanglement from being created between long-distance subsystems and being maintained for a long…
In this work, we propose a deep learning-based approach for quantum entanglement and discord classification using convolutional autoencoders. We train models to distinguish entangled from separable bipartite states for $d \times d$ systems…
Entanglement detection in high dimensional systems is a NP-hard problem since it is lacking an efficient way. Given a bipartite quantum state of interest free entanglement can be detected efficiently by the PPT-criterion (Peres-Horodecki…
We study the problem of entangling two spins at the distant ends of a spin chain by exploiting the nonequilibrium dynamics of the system after a sudden global quench. As initial states we consider a canted/spiral order product state of the…