相关论文: Multi-party entanglement in graph states

Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. A versatile tool for such a task is one that scales well with the size of the system and which can be both easily…

Graph-theoretic structures play a central role in the description and analysis of quantum systems. In this work, we introduce a new class of quantum states, called $A_\alpha$-graph states, which are constructed from either unweighted or…

Entanglement is a crucial resource for quantum information processing, and so protocols to generate high fidelity entangled states on various hardware platforms are in demand. While spin chains have been extensively studied to generate…

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a…

Using the signed laplacian matrix, and weighted and hybrid graphs, we present additional ways to interpret graphs as grid states. Hybrid graphs offer the most general interpretation. Existing graphical methods that characterize entanglement…

Hypergraph states form a family of multiparticle quantum states that generalizes cluster states and graph states. We study the action and graphical representation of nonlocal unitary transformations between hypergraph states. This leads to…

Graph states and their entanglement properties are pivotal for the development of quantum computing and technologies. For qubits, local complementation, a graphical rule that connects all the equivalent states under Local Clifford (LC)…

The Schmidt measure was introduced by Eisert and Briegel for quantifying the degree of entanglement of multipartite quantum systems [Phys. Rev. A 64, 022306 (2001)]. Although generally intractable, it turns out that there is a bound on the…

We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of…

Quantum networks are important for quantum communication, enabling tasks such as quantum teleportation, quantum key distribution, quantum sensing, and quantum error correction, often utilizing graph states, a specific class of multipartite…

Given a finite group G with a bilocal representation, we investigate the bipartite entanglement in the state constructed from the group algebra of G acting on a separable reference state. We find an upper bound for the von Neumann entropy…

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…

The entanglement properties of a multiparty pure state are invariant under local unitary transformations. The stabilizer dimension of a multiparty pure state characterizes how many types of such local unitary transformations existing for…

We propose to characterize multipartite entanglement of pure states as local unitary transformations acting on some parts of a system that can be undone by local unitary transformations acting on other parts. This leads to a definition of…

The name graph state is used to describe a certain class of pure quantum state which models a physical structure on which one can perform measurement-based quantum computing, and which has a natural graphical description. We present the…

The degree to which a pure quantum state is entangled can be characterized by the distance or angle to the nearest unentangled state. This geometric measure of entanglement is explored for bi-partite and multi-partite pure and mixed states.…

Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…

Stabilizer states form a ubiquitous family of quantum states that can be graphically represented through the graph state formalism. A fundamental property of graph states is that applying a local complementation - a well-known and…

We investigate the quantum networks that their nodes are considered as quantum harmonic oscillators. The entanglement of the ground state can be used to quantify the amount of information one part of a network shares with the other part of…

The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…