Efficient entanglement measure for graph states
From MaRDI portal
Publication:2010967
DOI10.1007/S10773-019-04214-4zbMATH Open1468.81015arXiv1809.02019OpenAlexW3101850048MaRDI QIDQ2010967FDOQ2010967
Ahmad Akhound, Saeed Haddadi, Mohammad Ali Chaman Motlagh
Publication date: 28 November 2019
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1809.02019
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
- Transforming graph states using single-qubit operations
- Title not available (Why is that?)
- Quantum cryptography based on Bell’s theorem
- Title not available (Why is that?)
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Title not available (Why is that?)
- Entanglement and nonclassical properties of hypergraph states
- Multiparty entanglement in graph states
- Lower bound of concurrence for qubit systems
- Quantum teleportation under the effect of dissipative environment and Hamiltonian XY model
- Two-colorable graph states with maximal Schmidt measure
- Investigation of preparation up to six and \(N\)-atom graph states
- Direct evaluation of pure graph state entanglement
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Entanglement in eight-qubit graph states
- Duality quantum simulation of the Yang-Baxter equation
- From graph states to two-graph states
- A lower bound of concurrence for multipartite quantum systems
- A bonding model of entanglement for N-qubit graph states
- Estimation on Geometric Measure of Quantum Coherence
- Thermal entanglement properties in two qubits one-axis spin squeezing model with an external magnetic field
- A brief overview of bipartite and multipartite entanglement measures
- Locally inequivalent four-qubit hypergraph states
- DeterminingX-chains in graph states
- Thermal quantum correlations in a two-dimensional spin star model
- Generalized graph states based on Hadamard matrices
Cited In (7)
- Non-classical correlations in a Heisenberg spin model with Heitler-London approach
- Bipartite entanglement of decohered mixed states generated from maximally entangled cluster states
- Which Graph States are Useful for Quantum Information Processing?
- Quantum classifier with entangled subgraph states
- Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
- Shor–Laflamme distributions of graph states and noise robustness of entanglement
- Evaluation of entanglement measures for hypergraph states up to four qubits
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)
