Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
arXiv:2407.09990 · doi:10.1016/j.physleta.2024.129815
Abstract
We consider quantum graph states that can be mapped to directed weighted graphs, also known as directed networks. The geometric measure of entanglement of the states is calculated for the quantum graph states corresponding to arbitrary graphs. We find relationships between the entanglement and the properties of the corresponding graphs. Namely, we obtain that the geometric measure of entanglement of a qubit with other qubits in the graph state is related to the weights of ingoing and outgoing arcs with respect to the vertex representing the qubit, outdegree and indegree of the corresponding vertex in the graph. For unweighted and undirected graphs, the entanglement depends on the degree of the corresponding vertex. Quantum protocol for quantifying of the entanglement of the quantum graph states is constructed. As an example, a quantum graph state corresponding to a chain is examined, and the entanglement of the state is calculated on AerSimulator.
References in corpus (9)
- Experimental quantum teleportation
- Multi-party entanglement in graph states
- Chip-to-chip quantum teleportation and multi-photon entanglement in silicon
- Bell Inequalities for Graph States
- Experimental demonstration of a graph state quantum error-correction code
- Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
- Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
- Unveiling the geometric meaning of quantum entanglement: discrete and continuous variable systems
- Correlations and projective measurements in maximally entangled multipartite states