Abstract Entanglement is not only important for understanding the fundamental properties of many-body systems, but also the crucial resource enabling quantum advantages in practical information processing tasks. Although previous works on quantum networks focus on discrete-variable systems, light—as the only traveling carrier of quantum information in a network—is bosonic and thus requires a continuous-variable description. We extend the study to continuous-variable quantum networks. By mapping the ensemble-averaged entanglement dynamics on an arbitrary network to a random-walk process on a graph, we are able to exactly solve the entanglement dynamics. We identify squeezing as the source of entanglement generation, which triggers a diffusive spread of entanglement with a "parabolic light cone”. A surprising linear superposition law in the entanglement growth is predicted by the theory and numerically verified, despite the nonlinear nature of the entanglement dynamics. The equilibrium entanglement distribution (Page curves) is exactly solved and has various shapes depending on the average squeezing density and strength.
Abstract Entanglement is not only important for understanding the fundamental properties of many-body systems, but also the crucial resource enabling quantum advantages in practical information processing tasks. Although previous works on quantum networks focus on discrete-variable systems, light—as the only traveling carrier of quantum information in a network—is bosonic and thus requires a continuous-variable description. We extend the study to continuous-variable quantum networks. By mapping the ensemble-averaged entanglement dynamics on an arbitrary network to a random-walk process on a graph, we are able to exactly solve the entanglement dynamics. We identify squeezing as the source of entanglement generation, which triggers a diffusive spread of entanglement with a "parabolic light cone”. A surprising linear superposition law in the entanglement growth is predicted by the theory and numerically verified, despite the nonlinear nature of the entanglement dynamics. The equilibrium entanglement distribution (Page curves) is exactly solved and has various shapes depending on the average squeezing density and strength.
Quantum networks enable forms of nonlocality beyond the standard Bell scenario, with a multitude of potential applications. Continuous-variable (CV) platforms are particularly attractive for large-scale networks, offering deterministic entanglement generation and favorable prospects for long-distance distribution. Here, we present a formalism to study CV network nonlocality using pseudospin measurements. Considering the linear chain and star configurations, we derive the maximal violations of the corresponding network locality inequalities for arbitrary two-mode states. Using two-mode squeezed vacuum states, we show that the strength of nonlocality in the star configuration remains independent of the network size. Moreover, the nonlocal correlations persist even at arbitrarily high temperatures provided the squeezing exceeds a critical threshold. Further, we demonstrate non-Gaussianity as an enhancer of network nonlocality through illustrations of various classes of non-Gaussian resources. Remarkably, a coherent superposition of single-photon subtractions across modes achieves maximal violation for arbitrarily small squeezing. Finally, we provide schematics of an experimentally feasible implementation of CV network nonlocality based on the isomorphism between pseudospin and spatial parity observables.
Abstract Quantum network scales the advantages of quantum communication protocols to more than two detached users, which offers great potential to realize the quantum internet. Here, a fully connected continuous‐variable (CV) quantum teleportation network architecture is presented, in which a squeezed state of light distributes each pair of entangled sideband modes to each communication link that bridges any pair of users. The quantum teleportation scheme is similar to standard two‐party ones for each communication link, without sacrificing communication capability and reliability. The demonstration based on CV‐entangled sideband modes opens an innovative possibility to implement many tasks of deterministic quantum information processing.
Quantum networks (QNs) have been predominantly driven by discrete-variable (DV) architectures. Yet, optical platforms naturally generate Gaussian states—the common states of continuous-variable (CV) systems, making CV-based QNs an attractive route toward scalable, chip-integrated quantum computation and communication. To bridge the gap between well-studied DV entanglement percolation theories and their CV counterpart, we introduce a Gaussian-to-Gaussian entanglement distribution scheme that deterministically transports two-mode squeezed vacuum states across large CV networks. Analysis of the scheme’s collective behavior using statistical-physics methods reveals a new form of entanglement percolation—negativity percolation theory (NegPT)—characterized by a bounded entanglement measure called the ratio negativity. We discover that NegPT exhibits a mixed-order phase transition, marked simultaneously by both an abrupt change in global entanglement and a long-range correlation between nodes. This distinctive behavior places CV-based QNs in a new universality class, fundamentally distinct from DV systems. Additionally, the abruptness of this transition introduces a critical vulnerability of CV-based QNs: conventional feedback mechanism becomes inherently unstable near the threshold, highlighting practical implications for stabilizing large-scale CV-based QNs. Our results unify statistical models for CV-based entanglement distribution and uncover previously unexplored critical phenomena unique to CV systems, providing valuable insights and guidelines essential for developing robust, feedback-stabilized QNs.
Complex networks structures have been extensively used for describing complex natural and technological systems, like the Internet or social networks. More recently, complex network theory has been applied to quantum systems, where complex network topologies may emerge in multiparty quantum states and quantum algorithms have been studied in complex graph structures. In this work, we study multimode Continuous Variables entangled states, named cluster states, where the entanglement structure is arranged in typical real-world complex networks shapes. Cluster states are a resource for measurement-based quantum information protocols, where the quality of a cluster is assessed in terms of the minimal amount of noise it introduces in the computation. We study optimal graph states that can be obtained with experimentally realistic quantum resources, when optimized via analytical procedure. We show that denser and regular graphs allow for better optimization. In the spirit of quantum routing, we also show the reshaping of entanglement connections in small networks via linear optics operations based on numerical optimization.
The characterization of ensembles of many-qubit random states and their realization via quantum circuits are crucial tasks in quantum-information theory. In this work, we study the ensembles generated by quantum circuits that randomly permute the computational basis, thus acting classically on the corresponding states. We focus on the averaged entanglement and present two main results. First, we derive generically tight upper bounds on the entanglement that can be generated by applying permutation circuits to arbitrary initial states. We show that the late-time “entanglement Page curves” are bounded in terms of the initial state participation entropies and their overlap with the “maximally antilocalized” state. Generally speaking, this result states that the quantum correlations generated by classical circuits are bounded in terms of some quantum property of the initial state (namely, the degree to which it can be written as a superposition of classical states). Second, comparing the averaged Rényi-2 entropies generated by ( 1 ) an infinitely deep random circuit of two-qubit gates and ( 2 ) global random permutations, we show that the two quantities are different for finite N but the corresponding Page curves coincide in the thermodynamic limit. We also discuss how these conclusions are modified by additional random phases or considering circuits of k -local gates with k ≥ 3 . Our results are exact and highlight the implications of classical features on entanglement generation in many-body systems.
Entanglement dynamics plays a crucial role in the development of scalable quantum information processing architectures. Quantum networks, composed of interconnected quantum nodes, offer promising avenues for the distribution and manipulation of quantum information over long distances. In this paper, we investigate the dynamics of entanglement in quantum networks and explore strategies for achieving scalable quantum information processing. the generation, distribution, and preservation of entanglement in various network topologies and investigate the impact of noise and decoherence on entanglement dynamics. Furthermore, we discuss potential applications of entanglement in quantum communication, cryptography, and computation, highlighting the importance of understanding and controlling entanglement dynamics for realizing practical quantum technologies. Through theoretical analysis and numerical simulations, we provide insights into the challenges and opportunities associated with entanglement dynamics in quantum networks, paving the way towards scalable quantum information processing architectures.