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

• URL: http://arxiv.org/abs/2012.05986v2
• Date: Tue, 26 Jan 2021 17:36:57 GMT
• Title: Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer
• Authors: Kh. P. Gnatenko, V. M. Tkachuk
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Simulating NMR Spectra with a Quantum Computer [49.1574468325115]
  This paper provides a formalization of the complete procedure of the simulation of a spin system's NMR spectrum. We also explain how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance.
  arXiv  Detail & Related papers  (2024-10-28T08:43:40Z)
• Relation of curvature and torsion of weighted graph states with graph properties and its studies on a quantum computer [0.0]
  The velocity of quantum evolution is determined by the sum of the weighted degrees of nodes in the graph. The curvature depends on the sum of the products of the weights of edges forming squares in graph $G(V, E)$. The torsion in addition is related to the sum of the products of the weights of edges in graph $G(V, E)$ forming triangles.
  arXiv  Detail & Related papers  (2024-08-02T18:09:15Z)
• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing [0.0]
  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.
  arXiv  Detail & Related papers  (2024-07-13T19:36:11Z)
• Geometric measure of entanglement of quantum graph states prepared with controlled phase shift operators [0.0]
  We consider graph states generated by the action of controlled phase shift operators on a separable state of a multi-qubit system. For two-qubit graph states, the geometric measure of entanglement is also quantified on IBM's simulator Qiskit Aer and quantum processor ibmq lima.
  arXiv  Detail & Related papers  (2024-01-26T16:52:22Z)
• Quantum Graph Learning: Frontiers and Outlook [14.1772249363715]
  facilitating quantum theory to enhance graph learning is in its infancy. We first look at QGL and discuss the mutualism of quantum theory and graph learning. A new taxonomy of QGL is presented, i.e., quantum computing on graphs, quantum graph representation, and quantum circuits for graph neural networks.
  arXiv  Detail & Related papers  (2023-02-02T05:53:31Z)
• Geometric phases along quantum trajectories [58.720142291102135]
  We study the distribution function of geometric phases in monitored quantum systems. For the single trajectory exhibiting no quantum jumps, a topological transition in the phase acquired after a cycle. For the same parameters, the density matrix does not show any interference.
  arXiv  Detail & Related papers  (2023-01-10T22:05:18Z)
• From Quantum Graph Computing to Quantum Graph Learning: A Survey [86.8206129053725]
  We first elaborate the correlations between quantum mechanics and graph theory to show that quantum computers are able to generate useful solutions. For its practicability and wide-applicability, we give a brief review of typical graph learning techniques. We give a snapshot of quantum graph learning where expectations serve as a catalyst for subsequent research.
  arXiv  Detail & Related papers  (2022-02-19T02:56:47Z)
• Geometric properties of evolutionary graph states and their detection on a quantum computer [0.0]
  Geometric characteristics of graph states corresponding to a chain, a triangle, and a square are detected on the basis of calculations on IBM's quantum computer ibmq-manila.
  arXiv  Detail & Related papers  (2021-08-29T20:31:37Z)
• Geometric measure of entanglement of multi-qubit graph states and its detection on a quantum computer [0.0]
  The entanglement of a qubit with other qubits is found for the graph states represented by arbitrary graphs. The geometric measure of entanglement of the graph states is quantified on the quantum computer.
  arXiv  Detail & Related papers  (2021-06-20T12:47:09Z)
• Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
  We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
  arXiv  Detail & Related papers  (2020-03-25T02:46:14Z)
• Asymptotic entropy of the Gibbs state of complex networks [68.8204255655161]
  The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph. We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature. Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random ErdHos-R'enyi graphs.
  arXiv  Detail & Related papers  (2020-03-18T18:01:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.