Multiparty entanglement in graph states
From MaRDI portal
Abstract: Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of distributed quantum systems that play a significant role in quantum error correction, multi-party quantum communication, and quantum computation within the framework of the one-way quantum computer. We characterize and quantify the genuine multi-particle entanglement of such graph states in terms of the Schmidt measure, to which we provide upper and lower bounds in graph theoretical terms. Several examples and classes of graphs will be discussed, where these bounds coincide. These examples include trees, cluster states of different dimension, graphs that occur in quantum error correction, such as the concatenated [7,1,3]-CSS code, and a graph associated with the quantum Fourier transform in the one-way computer. We also present general transformation rules for graphs when local Pauli measurements are applied, and give criteria for the equivalence of two graphs up to local unitary transformations, employing the stabilizer formalism. For graphs of up to seven vertices we provide complete characterization modulo local unitary transformations and graph isomorphies.
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- A new connection between quantum circuits, graphs and the Ising partition function
- From graph states to two-graph states
- Edge local complementation and equivalence of binary linear codes
- Two-colorable graph states with maximal Schmidt measure
- Parallelizing quantum circuits
- Scheme for implementing teleporting an arbitrary tripartite entangled state in cavity QED
- Entanglement entropy and the colored Jones polynomial
- Network-based arbitrated quantum signature scheme with graph state
- Finite correlation length implies efficient preparation of quantum thermal states
- Multipartite separability of density matrices of graphs
- Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
- Investigation of preparation up to six and \(N\)-atom graph states
- Generation of atomic momentum cluster and graph states via cavity QED
- Efficient entanglement measure for graph states
- Non-Markovian dynamics of spin squeezing
- Bipartite entanglement and hypergraph states
- Geometric properties of evolutionary graph states and their detection on a quantum computer
- Controlled quantum secure direct communication with authentication protocol based on five-particle cluster state and classical XOR operation
- Recovery from an eavesdropping attack on a qubit of a graph state
- Entanglement, complexity, and causal asymmetry in quantum theories
- Local density matrices of many-body states in the constant weight subspaces
- Evaluation of entanglement measures for hypergraph states up to four qubits
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- A note of Bell inequalities for graph states
- Quantum classifier with entangled subgraph states
- On graphs and codes preserved by edge local complementation
- Generation of cluster-type entangled coherent states via cavity QED
- Controlled simultaneously state preparation at many remote locations with a new cluster state type
- Construction of general quantum channel for quantum teleportation
- Nested quantum error correction codes via subgraphs
- Entropic measure and hypergraph states
- Quantum secret sharing with continuous variable graph state
- Information free quantum bus for generating stabiliser states
- Aperiodic propagation criteria for Boolean functions
- Recovery of quantum information from a node failure in a graph
- Zero entries in multipartite product unitary matrices
- Multipartite information of free fermions on Hamming graphs
- Twisted graph states for ancilla-driven universal quantum computation
- Reversibility in extended measurement-based quantum computation
- Remote scalable entangling of symmetric Dicke states
- Quantum patterns and types for entanglement and separability
- Entanglement and its multipartite extensions
- Graph states in phase space
- Graphical quantum error-correcting codes based on entanglement of subgraphs
- Quantum random state generation with predefined entanglement constraint
- Stabilizing entangled states with quasi-local quantum dynamical semigroups
- Macroscopic bound entanglement in thermal graph states
- Optimised resource construction for verifiable quantum computation
- Generation of graph-state entanglement with atomic ensembles via the dipole blockade mechanism
- Towards the fast scrambling conjecture
- Bound entanglement in tree graphs
- Classical spin systems and the quantum stabilizer formalism: general mappings and applications
- Colloquium: area laws for the entanglement entropy
- Entanglement in many-body systems
- Preparing highly entangled six-qubit genuine state in ion-trap system
- Local unitary versus local Clifford equivalence of stabilizer states
- Nonlocality of cluster states of qubits
- Quantum entanglement in states generated by bilocal group algebras
- Tripartite Entanglement Transformations and Tensor Rank
- Nonadditive quantum error-correcting code
- Percolation, renormalization, and quantum computing with nondeterministic gates
- General entanglement scaling laws from time evolution
- Some Ulam's reconstruction problems for quantum states
- Generation of bases with definite factorization for an n-qubit system and mutually unbiased sets construction
- Completeness of classical spin models and universal quantum computation
- Mutual information area laws for thermal free fermions
- Quantum anonymous voting with unweighted continuous-variable graph states
- Almost equivalent paradigms of contextuality
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- A combinatorial approach for studying local operations and classical communication transformations of multipartite states
- GHZ extraction yield for multipartite stabilizer states
- Hudson’s theorem for finite-dimensional quantum systems
- Which Graph States are Useful for Quantum Information Processing?
- Efficient test to demonstrate genuine three particle nonlocality
- ENTANGLEMENT AND DECOHERENCE IN SPIN GASES
- Entangled graphs
- ENTANGLEMENT GENERATION AND CONCENTRATION VIA ADIABATIC EVOLUTION WITH TRAPPED IONS
- Applications of atomic ensembles in distributed quantum computing
- An introduction to one-way quantum computing in distributed architectures
- Measurement-Based and Universal Blind Quantum Computation
- NOVEL BELL INEQUALITIES FOR n QUBITS DISTRIBUTED BETWEEN m < n PARTIES
- On polynomial invariants of several qubits
- Percolation in quantum computation and communication
- Ancilla-driven quantum computation with twisted graph states
- A complete characterization of all-versus-nothing arguments for stabilizer states
- Transforming graph states using single-qubit operations
- Bounds on absolutely maximally entangled states from shadow inequalities, and the quantum MacWilliams identity
- Entanglement in pure and thermal cluster states
- Multipartite entanglement detection for hypergraph states
- Absolutely maximally entangled states from phase states
- Unifying neural-network quantum states and correlator product states via tensor networks
- Quantum network dense coding via continuous-variable graph states
- Graph states for quantum secret sharing
- Graphical quantum low-density parity-check codes
- Classification of entanglement in symmetric states
- Error thresholds for arbitrary Pauli noise
- \(k\)-uniform maximally mixed states from multi-qudit phase states
- Operational symmetries of entangled states
- Quantum advantage for the LOCAL model in distributed computing
- Average-case quantum advantage with shallow circuits
This page was built for publication: Multiparty entanglement in graph states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114932)
