Quantum networks are an integral component in performing efficient computation and communication tasks that are not accessible using classical systems. A key aspect in designing an effective and scalable quantum network is generating entanglement between its nodes, which is robust against defects in the network. We consider an isotropic quantum network of spin-1/2 particles with a finite fraction of defects, where the corresponding wave function of the network is rotationally invariant under the action of local unitaries. By using quantum information-theoretic concepts like strong subadditivity of von Neumann entropy and approximate quantum telecloning, we prove analytically that in the presence of defects, caused by loss of a finite fraction of spins, the network, composed of a fixed numbers of lattice sites, sustains genuine multisite entanglement and at the same time may exhibit finite moderate-range bipartite entanglement, in contrast to the network with no defects.
We consider a class of large superposed states, obtained from dimer coverings on spin-1/2 isotropic lattices, whose potential usefulness ranges from organic molecules to quantum computation. We show that they are genuinely multiparty entangled, irrespective of the geometry and dimension of the isotropic lattice. We then present an efficient method to characterize the genuine multisite entanglement in the case of isotropic square spin-1/2 lattices, with short-range dimer coverings. We use this iterative analytical method to calculate the multisite entanglement of finite-sized lattices, which through finite-size scaling, enables us to obtain the estimate of the multisite entanglement of the infinite square lattice. The method can be a useful tool to investigate other single- and multisite properties of such states.
Quantum networks are under current active investigation for the implementation of quantum communication tasks. With this motivation in mind, we study the entanglement properties of the multipartite states underlying these networks. We show that, in sharp contrast to the case of pure states, genuine multipartite entanglement is severely affected by the presence of noise depending on the network topology: the amount of connectivity determines whether genuine multipartite entanglement is robust for any system size or whether it is completely washed out under the slightest form of noise for a sufficiently large number of parties. The impossibility to obtain genuine multipartite entanglement in some networks implies some fundamental limitations for their applications. In addition, the family of states considered in this work proves very useful to find new examples of states with interesting properties. We show this by constructing states of any number of parties that display superactivation of genuine multipartite nonlocality.
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 matter qubits at different nodes, flexibly enabling the creation of remote entanglement between them. Multipartite entanglement among multiple nodes will be crucial for many proposed quantum network applications, including quantum computational tasks and quantum metrology. To date, experimental efforts have primarily focused on generating bipartite entanglement between nodes, which is widely regarded as the fundamental quantum resource for quantum networks. However, relying exclusively on bipartite entanglement to form more complex multipartite entanglement introduces several challenges. These include the need for ancillary qubits, extensive local entangling operations which increases the preparation latency, and increasingly stringent requirements on coherence times as the number of nodes grows. Here, we analyse various schemes that achieve multipartite entanglement between nodes in a single step, bypassing the need for multiple rounds of bipartite entanglement. We demonstrate that different schemes can produce distinct multipartite entangled states, with varying fidelity and generation rates. Additionally, we discuss the applicability of these schemes across different experimental platforms, highlighting their primary advantages and disadvantages.
Single defect centers in diamond have emerged as a powerful platform for quantum optics experiments and quantum information processing tasks. Connecting spatially separated nodes via optical photons into a quantum network will enable distributed quantum computing and long-range quantum communication. Initial experiments on trapped atoms and ions as well as defects in diamond have demonstrated entanglement between two nodes over several meters. To realize multi-node networks, additional quantum bit systems that store quantum states while new entanglement links are established are highly desirable. Such memories allow for entanglement distillation, purification and quantum repeater protocols that extend the size, speed and distance of the network. However, to be effective, the memory must be robust against the entanglement generation protocol, which typically must be repeated many times. Here we evaluate the prospects of using carbon nuclear spins in diamond as quantum memories that are compatible with quantum networks based on single nitrogen vacancy (NV) defects in diamond. We present a theoretical framework to describe the dephasing of the nuclear spins under repeated generation of NV spin-photon entanglement and show that quantum states can be stored during hundreds of repetitions using typical experimental coupling parameters. This result demonstrates that nuclear spins with weak hyperfine couplings are promising quantum memories for quantum networks.
Simple physical interactions between spin-
1∕2 particles may result in quantum states that exhibit exotic correlations that are difficult to find if one simply explores state spaces of multipartite systems. In particular, we present a detailed investigation of the well-known Ising model of a chain (ring) of spin-
1∕2 particles (qubits) in a transverse magnetic field. We present explicit expressions for eigenstates of the model Hamiltonian for arbitrary number of spin-
1∕2 particles in the chain in the standard (computer) basis, and we investigate quantum entanglement between individual qubits. We analyze bipartite as well as multipartite entanglement in the ground state of the model. In particular, we show that bipartite entanglement between pairs of qubits of the Ising chain (measured in terms of a concurrence) as a function of the parameter $\ensuremath{\lambda}$ has a maximum around the point $\ensuremath{\lambda}=1$, and it monotonically decreases for large values of $\ensuremath{\lambda}$. We prove that in the limit $\ensuremath{\lambda}\ensuremath{\rightarrow}\ensuremath{\infty}$ this state is locally unitary equivalent to an
N-partite Greenberger-Horn-Zeilinger state. We also analyze a very specific eigenstate of the Ising Hamiltonian with a zero eigenenergy (we denote this eigenstate as the
X-state). This
X-state exhibits the ``extreme'' entanglement in a sense that an arbitrary subset
A of $k\ensuremath{\leqslant}n$ qubits in the Ising chain composed of
N=2n+1 qubits is maximally entangled with the remaining qubits (set
B) in the chain. In addition, we prove that by performing a local operation just on the subset
B, one can transform the
X-state into a direct product of
k singlets shared by the parties
A and
B. This property of the
X-state can be utilized for new secure multipartite communication protocols.
The study of entanglement in multipartite quantum states plays a major role in quantum information theory and genuine multipartite entanglement signals one of its strongest forms for applications. However, its characterization for general (mixed) states is a highly nontrivial problem. We introduce a particularly simple subclass of multipartite states, which we term pair-entangled network (PEN) states, as those that can be created by distributing exclusively bipartite entanglement in a connected network. We show that genuine multipartite entanglement in a PEN state depends on both the level of noise and the network topology and, in sharp contrast to the case of pure states, it is not guaranteed by the mere distribution of mixed bipartite entangled states. Our main result is a markedly drastic feature of this phenomenon: the amount of connectivity in the network determines whether genuine multipartite entanglement is robust to noise for any system size or whether it is completely washed out under the slightest form of noise for a sufficiently large number of parties. This latter case implies fundamental limitations for the application of certain networks in realistic scenarios, where the presence of some form of noise is unavoidable. To illustrate the applicability of PEN states to study the complex phenomenology behind multipartite entanglement, we also use them to prove superactivation of genuine multipartite nonlocality for any number of parties.