Classification of 4-qubit entangled graph states according to bipartite entanglement, multipartite entanglement and non-local properties
DOI10.1007/s10773-016-3104-xzbMath1358.81022OpenAlexW2470017982MaRDI QIDQ517655
Mojtaba Jafarpour, Leila Assadi
Publication date: 24 March 2017
Published in: International Journal of Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10773-016-3104-x
concurrencenon-localitybipartite entanglementmultipartite entanglement4-qubit graph stateentangled graph
Quantum coherence, entanglement, quantum correlations (81P40) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum tasks using six qubit cluster states
- Cluster-state quantum computation
- Two-colorable graph states with maximal Schmidt measure
- Investigation of preparation up to six and \(N\)-atom graph states
- Bell inequality, Bell states and maximally entangled states for \(n\) qubits
- Separability of mixed states: necessary and sufficient conditions.
- A characterization of global entanglement
- Bell’s Theorem for GeneralN-Qubit States
- Quantum Computation and Quantum Information
- Nonlocality of cluster states of qubits
- Multiparty entanglement in graph states
- AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES
- Extreme quantum entanglement in a superposition of macroscopically distinct states
- Global entanglement in multiparticle systems
- Direct evaluation of pure graph state entanglement
- Efficient one-way quantum computations for quantum error correction
This page was built for publication: Classification of 4-qubit entangled graph states according to bipartite entanglement, multipartite entanglement and non-local properties
