Efficient entanglement measure for graph states
From MaRDI portal
Publication:2010967
Abstract: In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring entanglement quantity in the multi-qubit graph states.
Recommendations
- Evaluation of entanglement measures for hypergraph states up to four qubits
- Highly efficient estimation of entanglement measures for large experimentally created graph states via simple measurements
- Multiparty entanglement in graph states
- Direct evaluation of pure graph state entanglement
- A new multipartite entanglement measure for arbitrary n-qudit pure states
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- A bonding model of entanglement for N-qubit graph states
- A brief overview of bipartite and multipartite entanglement measures
- A lower bound of concurrence for multipartite quantum systems
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- DeterminingX-chains in graph states
- Direct evaluation of pure graph state entanglement
- Duality quantum simulation of the Yang-Baxter equation
- Entanglement and nonclassical properties of hypergraph states
- Entanglement in eight-qubit graph states
- Estimation on geometric measure of quantum coherence
- From graph states to two-graph states
- Generalized graph states based on Hadamard matrices
- Graph theory
- Investigation of preparation up to six and \(N\)-atom graph states
- Locally inequivalent four-qubit hypergraph states
- Lower bound of concurrence for qubit systems
- Multiparty entanglement in graph states
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Quantum cryptography based on Bell’s theorem
- Quantum teleportation under the effect of dissipative environment and Hamiltonian XY model
- Thermal entanglement properties in two qubits one-axis spin squeezing model with an external magnetic field
- Thermal quantum correlations in a two-dimensional spin star model
- Transforming graph states using single-qubit operations
- Two-colorable graph states with maximal Schmidt measure
Cited in
(12)- Multiparty entanglement in graph states
- Shor–Laflamme distributions of graph states and noise robustness of entanglement
- Evaluation of entanglement measures for hypergraph states up to four qubits
- Quantum classifier with entangled subgraph states
- Concurrence and three-tangle of the graph
- Direct evaluation of pure graph state entanglement
- Bipartite entanglement of decohered mixed states generated from maximally entangled cluster states
- Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
- Entanglement in eight-qubit graph states
- Which Graph States are Useful for Quantum Information Processing?
- Non-classical correlations in a Heisenberg spin model with Heitler-London approach
- Highly efficient estimation of entanglement measures for large experimentally created graph states via simple measurements
This page was built for publication: Efficient entanglement measure for graph states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010967)
