Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer

Abstract

We consider graph states generated by operator of evolution with Ising Hamiltonian. The geometric measure of entanglement of a spin with other spins in the graph state is obtained analytically and quantified on IBM's quantum computer, IBM Q Valencia. The results of quantum calculations are in good agreement with the theoretical ones. We conclude that the geometric measure of entanglement of a spin with other spins in the graph state is related with degree of vertex representing the spin in the corresponding graph.

References in corpus (5)

• Multi-party entanglement in graph states
• Chip-to-chip quantum teleportation and multi-photon entanglement in silicon
• Bell Inequalities for Graph States
• Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer
• Preparation and study of the entanglement of the Schrödinger cat state on the ibmq-melbourne quantum computer

Cited by in corpus (8)

• Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer
• Geometric properties of evolutionary graph states and their detection on a quantum computer
• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
• Many-body quantum resources of graph states
• Probing mean values and correlations of high-spin systems on a quantum computer
• Entanglement in Quantum Systems Based on Directed Graphs
• Preparation of two-qubit entangled states on a spin-1/2 Ising-Heisenberg diamond spin cluster by controlling the measurement
• Studies of properties of bipartite graphs with quantum programming