Related papers: Open-system dynamics of graph-state entanglement

A general framework is developed for separating classical and quantum correlations in a multipartite system. Entanglement is defined as the difference in the correlation information encoded by the state of a system and a suitably defined…

Topological entanglement entropy, a measure of the long-ranged entanglement, is related to the degeneracy of the ground state on a higher genus surface. The exact relation depends on the details of the topological theory. We consider a…

We describe an explicit mechanism for the emergence of a dynamical holographic bulk from the structure of entanglement in a quantum state. We start with a generic system in complete isolation, assuming it has a classical limit involving…

For carrying out many quantum information protocols entanglement must be established in advance between two distant parties. Practically, inevitable interaction of entangled subsystems with their environments during distribution and storage…

We introduce a characterization of topological order based on bulk oscillations of the entanglement entropy and the definition of an `entanglement gap', showing that it is generally applicable to pure and disordered quantum systems. Using…

In open quantum systems, we directly relate anomalies of higher-form symmetries to the long-range entanglement of any mixed state with such symmetries. First, we define equivalence classes of long-range entanglement in mixed states via…

We establish tight upper and lower bounds for the Entanglement of Formation of an arbitrary two-mode Gaussian state employing necessary properties of Gaussian channels. Both bounds are strictly given by the Entanglement of Formation of…

Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…

We associate all small subgraph counting problems with a systematic graph encoding/representation system which makes a coherent use of graphlet structures. The system can serve as a unified foundation for studying and connecting many…

Dissipation generally leads to the decoherence of a quantum state. In contrast, numerous recent proposals have illustrated that dissipation can also be tailored to stabilize many-body entangled quantum states. While the focus of these works…

Conformal field theories in curved backgrounds have been used to describe inhomogeneous one-dimensional systems, such as quantum gases in trapping potentials and non-equilibrium spin chains. This approach provided, in a elegant and simple…

Graph states are special entangled states advantageous for many quantum technologies, including quantum error correction, multiparty quantum communication and measurement-based quantum computation. Yet, their fidelity is often disrupted by…

Random quantum states and operations are of fundamental and practical interests. In this work, we investigate the entanglement properties of random hypergraph states, which generalize the notion of graph states by applying generalized…

Hypergraphs have emerged as a powerful modeling framework to represent systems with multiway interactions, that is systems where interactions may involve an arbitrary number of agents. Here we explore the properties of real-world…

Bell-network states are loop-quantum-gravity states that glue quantum polyhedra with entanglement. We present an algorithm and a code that evaluates the reduced density matrix of a Bell-network state and computes its entanglement entropy.…

We study the closest disentangled state to a given entangled state in any system (multi-party with any dimension). We obtain the set of equations the closest disentangled state must satisfy, and show that its reduction is strongly related…

We analyze the effect of decoherence, modelled by local quantum channels, on quantum critical states and we find universal properties of the resulting mixed state's entanglement, both between system and environment and within the system.…

We study robustness of genuine multipartite entanglement for a system of three qubits under collective dephasing. Using a computable entanglement monotone for multipartite systems, we found that almost every state is quite robust under this…

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…

As two of the most important entanglement measures--the entanglement of formation and the entanglement of distillation--have so far been limited to bipartite settings, the study of other entanglement measures for multipartite systems…