Geometric properties of evolutionary graph states and their detection on a quantum computer

• URL: http://arxiv.org/abs/2108.12909v2
• Date: Sun, 20 Mar 2022 12:12:39 GMT
• Title: Geometric properties of evolutionary graph states and their detection on a quantum computer
• Authors: Kh. P. Gnatenko, H. P. Laba, V. M. Tkachuk
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Geometric properties of evolutionary graph states of spin systems generated by the operator of evolution with Ising Hamiltonian are examined, using their relationship with fluctuations of energy. We find that the geometric characteristics of the graph states depend on properties of the corresponding graphs. Namely, it is obtained that the fluctuations of energy in graph states and therefore the velocity of quantum evolution, the curvature and the torsion of the states are related with the total number of edges, triangles and squares in the corresponding graphs. The obtained results give a possibility to quantify the number of edges, triangles and squares in a graph on a quantum devise and achieve quantum supremacy in solving this problem with the development of a multi-qubit quantum computer. 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.

Related papers

• 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)
• Gaussian Entanglement Measure: Applications to Multipartite Entanglement of Graph States and Bosonic Field Theory [50.24983453990065]
  An entanglement measure based on the Fubini-Study metric has been recently introduced by Cocchiarella and co-workers. We present the Gaussian Entanglement Measure (GEM), a generalization of geometric entanglement measure for multimode Gaussian states. By providing a computable multipartite entanglement measure for systems with a large number of degrees of freedom, we show that our definition can be used to obtain insights into a free bosonic field theory.
  arXiv  Detail & Related papers  (2024-01-31T15:50:50Z)
• A Hitchhiker's Guide to Geometric GNNs for 3D Atomic Systems [87.30652640973317]
  Recent advances in computational modelling of atomic systems represent them as geometric graphs with atoms embedded as nodes in 3D Euclidean space. Geometric Graph Neural Networks have emerged as the preferred machine learning architecture powering applications ranging from protein structure prediction to molecular simulations and material generation. This paper provides a comprehensive and self-contained overview of the field of Geometric GNNs for 3D atomic systems.
  arXiv  Detail & Related papers  (2023-12-12T18:44:19Z)
• Algebraic Geometry of Quantum Graphical Models [0.0]
  We introduce the foundations to carry out a similar study of quantum counterparts. quantum graphical models are families of quantum states satisfying certain locality or correlation conditions encoded by a graph.
  arXiv  Detail & Related papers  (2023-08-22T16:07:07Z)
• 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 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)
• Entanglement of graph states of spin system with Ising interaction and its quantifying on IBM's quantum computer [0.0]
  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.
  arXiv  Detail & Related papers  (2020-12-10T21:22:53Z)
• Exploring complex graphs using three-dimensional quantum walks of correlated photons [52.77024349608834]
  We introduce a new paradigm for the direct experimental realization of excitation dynamics associated with three-dimensional networks. This novel testbed for the experimental exploration of multi-particle quantum walks on complex, highly connected graphs paves the way towards exploiting the applicative potential of fermionic dynamics in integrated quantum photonics.
  arXiv  Detail & Related papers  (2020-07-10T09:15:44Z)
• 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.