ﻻ يوجد ملخص باللغة العربية
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.
Kernel methods are powerful for machine learning, as they can represent data in feature spaces that similarities between samples may be faithfully captured. Recently, it is realized that machine learning enhanced by quantum computing is closely relat
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph into Hamil
We propose a novel protocol for the creation of macroscopic quantum superposition (MQS) states based on a measurement of a non-monotonous function of a quantum collective variable. The main advantage of this protocol is that it does not require switc
Let $H$ be a fixed $k$-vertex graph with $m$ edges and minimum degree $d >0$. We use the learning graph framework of Belovs to show that the bounded-error quantum query complexity of determining if an $n$-vertex graph contains $H$ as a subgraph is $O
What gravitational field is generated by a massive quantum system in a spatial superposition? Despite decades of intensive theoretical and experimental research, we still do not know the answer. On the experimental side, the difficulty lies in the fa