Graph kernels encoding features of all subgraphs by quantum superposition

• URL: http://arxiv.org/abs/2103.16093v1
• Date: Tue, 30 Mar 2021 05:50:23 GMT
• Title: Graph kernels encoding features of all subgraphs by quantum superposition
• Authors: Kaito Kishi, Takahiko Satoh, Rudy Raymond, Naoki Yamamoto, Yasubumi Sakakibara
• Abstract summary: We propose a novel graph kernel that applies a quantum computer to measure the graph similarity taking all subgraphs into account. For the construction of the quantum kernel, we develop an efficient protocol that removes the index information of subgraphs encoded in the quantum state. A detailed numerical simulation of a bioinformatics problem is presented to demonstrate that the proposed quantum kernel achieves better classification accuracy than existing graph kernels.
• Score: 4.031373438192993
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph kernels are often used in bioinformatics and network applications to measure the similarity between graphs; therefore, they may be used to construct efficient graph classifiers. Many graph kernels have been developed thus far, but to the best of our knowledge there is no existing graph kernel that considers all subgraphs to measure similarity. We propose a novel graph kernel that applies a quantum computer to measure the graph similarity taking all subgraphs into account by fully exploiting the power of quantum superposition to encode every subgraph into a feature. For the construction of the quantum kernel, we develop an efficient protocol that removes the index information of subgraphs encoded in the quantum state. We also prove that the quantum computer requires less query complexity to construct the feature vector than the classical sampler used to approximate the same vector. A detailed numerical simulation of a bioinformatics problem is presented to demonstrate that, in many cases, the proposed quantum kernel achieves better classification accuracy than existing graph kernels.

Related papers

• General Graph Random Features [42.75616308187867]
  We propose a novel random walk-based algorithm for unbiased estimation of arbitrary functions of a weighted adjacency matrix. Our algorithm enjoys subquadratic time complexity with respect to the number of nodes, overcoming the notoriously prohibitive cubic scaling of exact graph kernel evaluation.
  arXiv  Detail & Related papers  (2023-10-07T15:47:31Z)
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations [9.32782060570252]
  We propose a novel approach for distributing graph states across a quantum network. We show that the distribution of graph states can be characterized by a system of subgraph complementations. We find a close to optimal sequence of subgraph complementation operations to distribute an arbitrary graph state.
  arXiv  Detail & Related papers  (2023-08-25T23:03:25Z)
• NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification [70.51126383984555]
  We introduce a novel all-pair message passing scheme for efficiently propagating node signals between arbitrary nodes. The efficient computation is enabled by a kernerlized Gumbel-Softmax operator. Experiments demonstrate the promising efficacy of the method in various tasks including node classification on graphs.
  arXiv  Detail & Related papers  (2023-06-14T09:21:15Z)
• Labeled Subgraph Entropy Kernel [11.812319306576816]
  We propose a novel labeled subgraph entropy graph kernel, which performs well in structural similarity assessment. We design a dynamic programming subgraph enumeration algorithm, which effectively reduces the time complexity. In order to test our method, we apply several real-world datasets and assess the effects in different tasks.
  arXiv  Detail & Related papers  (2023-03-21T12:27:21Z)
• QESK: Quantum-based Entropic Subtree Kernels for Graph Classification [11.51839867040302]
  We propose a novel graph kernel, namely the Quantum-based Entropic Subtree Kernel (QESK) for Graph Classification. We show how this AMM matrix can be employed to compute a series of entropic subtree representations associated with the classical Weisfeiler-Lehman (WL) algorithm. We show that the proposed QESK kernel can significantly outperform state-of-the-art graph kernels and graph deep learning methods for graph classification problems.
  arXiv  Detail & Related papers  (2022-12-10T07:10:03Z)
• Transductive Kernels for Gaussian Processes on Graphs [7.542220697870243]
  We present a novel kernel for graphs with node feature data for semi-supervised learning. The kernel is derived from a regularization framework by treating the graph and feature data as two spaces. We show how numerous kernel-based models on graphs are instances of our design.
  arXiv  Detail & Related papers  (2022-11-28T14:00:50Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• 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)
• Graph Kernel Neural Networks [53.91024360329517]
  We propose to use graph kernels, i.e. kernel functions that compute an inner product on graphs, to extend the standard convolution operator to the graph domain. This allows us to define an entirely structural model that does not require computing the embedding of the input graph. Our architecture allows to plug-in any type of graph kernels and has the added benefit of providing some interpretability.
  arXiv  Detail & Related papers  (2021-12-14T14:48:08Z)
• Benchmarking Small-Scale Quantum Devices on Computing Graph Edit Distance [52.77024349608834]
  Graph Edit Distance (GED) measures the degree of (dis)similarity between two graphs in terms of the operations needed to make them identical. In this paper we present a comparative study of two quantum approaches to computing GED.
  arXiv  Detail & Related papers  (2021-11-19T12:35:26Z)
• Online Dense Subgraph Discovery via Blurred-Graph Feedback [87.9850024070244]
  We introduce a novel learning problem for dense subgraph discovery. We first propose a edge-time algorithm that obtains a nearly-optimal solution with high probability. We then design a more scalable algorithm with a theoretical guarantee.
  arXiv  Detail & Related papers  (2020-06-24T11:37:33Z)

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.