On The Variational Perspectives To The Graph Isomorphism Problem

• URL: http://arxiv.org/abs/2111.09821v1
• Date: Thu, 18 Nov 2021 17:43:21 GMT
• Title: On The Variational Perspectives To The Graph Isomorphism Problem
• Authors: Turbasu Chatterjee, Shah Ishmam Mohtashim and Akash Kundu
• Abstract summary: This paper studies the Graph Isomorphism Problem from a variational algorithmic perspective. This study presents the results of the algorithms and the variations that occur therein for graphs of four and five nodes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper studies the Graph Isomorphism Problem from a variational algorithmic perspective, specifically studying the Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Graph Isomorphism Problem and subsequent execution using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). This study presents the results of these algorithms and the variations that occur therein for graphs of four and five nodes. The main findings of this paper include the clustering in the energy landscape for the QAOA in isomorphic graphs having an equal number of nodes and edges. This trend found in the QAOA study was further reinforced by studying the ground state energy reduction using VQEs. Furthermore, this paper examines the trend under which isomorphic pairs of graphs vary in the ground state energies, with varying edges and nodes.

Related papers

• Detecting Homeomorphic 3-manifolds via Graph Neural Networks [0.0]
  We study the homeomorphism problem for a class of graph-manifolds using Graph Neural Network techniques. We train and benchmark a variety of network architectures within a supervised learning setting by testing different combinations of two convolutional layers.
  arXiv  Detail & Related papers  (2024-09-01T12:58:09Z)
• Quantum walk informed variational algorithm design [0.0]
  We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) We develop algorithms for unconstrained and constrained novel optimisations. We show significantly improved convergence over preexisting QVAs.
  arXiv  Detail & Related papers  (2024-06-17T15:04:26Z)
• The graph alignment problem: fundamental limits and efficient algorithms [0.9246334723892301]
  The noisy version of the graph isomorphism problem aims to find a matching between the nodes of two graphs which preserves most of the edges. This thesis focuses on understanding the fundamental information-theoretical limits for this problem, as well as designing and analyzing algorithms that are able to recover the underlying alignment in the data.
  arXiv  Detail & Related papers  (2024-04-18T15:31:13Z)
• Degree-based stratification of nodes in Graph Neural Networks [66.17149106033126]
  We modify the Graph Neural Network (GNN) architecture so that the weight matrices are learned, separately, for the nodes in each group. This simple-to-implement modification seems to improve performance across datasets and GNN methods.
  arXiv  Detail & Related papers  (2023-12-16T14:09:23Z)
• Discrete Graph Auto-Encoder [52.50288418639075]
  We introduce a new framework named Discrete Graph Auto-Encoder (DGAE) We first use a permutation-equivariant auto-encoder to convert graphs into sets of discrete latent node representations. In the second step, we sort the sets of discrete latent representations and learn their distribution with a specifically designed auto-regressive model.
  arXiv  Detail & Related papers  (2023-06-13T12:40:39Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• A Quantum Algorithm for the Sub-Graph Isomorphism Problem [3.04585143845864]
  We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. We show that the method can be applied to realistic sub-graph isomorphism problem instances in the medium term.
  arXiv  Detail & Related papers  (2021-11-18T14:47:10Z)
• Joint Network Topology Inference via Structured Fusion Regularization [70.30364652829164]
  Joint network topology inference represents a canonical problem of learning multiple graph Laplacian matrices from heterogeneous graph signals. We propose a general graph estimator based on a novel structured fusion regularization. We show that the proposed graph estimator enjoys both high computational efficiency and rigorous theoretical guarantee.
  arXiv  Detail & Related papers  (2021-03-05T04:42:32Z)
• Dirichlet Graph Variational Autoencoder [65.94744123832338]
  We present Dirichlet Graph Variational Autoencoder (DGVAE) with graph cluster memberships as latent factors. Motivated by the low pass characteristics in balanced graph cut, we propose a new variant of GNN named Heatts to encode the input graph into cluster memberships.
  arXiv  Detail & Related papers  (2020-10-09T07:35:26Z)
• Permutation Invariant Graph Generation via Score-Based Generative Modeling [114.12935776726606]
  We propose a permutation invariant approach to modeling graphs, using the recent framework of score-based generative modeling. In particular, we design a permutation equivariant, multi-channel graph neural network to model the gradient of the data distribution at the input graph. For graph generation, we find that our learning approach achieves better or comparable results to existing models on benchmark datasets.
  arXiv  Detail & Related papers  (2020-03-02T03:06:14Z)
• Approximate Graph Spectral Decomposition with the Variational Quantum Eigensolver [1.0152838128195465]
  Spectral graph theory studies the relationships between the eigenvectors and eigenvalues of Laplacian and adjacency matrices and their associated graphs. The Variational Quantum Eigensolver (VQE) algorithm was proposed as a hybrid quantum/classical algorithm. In this paper, we will expand upon the VQE algorithm to analyze the spectra of directed and undirected graphs.
  arXiv  Detail & Related papers  (2019-12-27T23:27:38Z)

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.