A Quantum Algorithm for the Sub-Graph Isomorphism Problem
Year: 2021
Type: preprint
Abstract: We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number of qubits that scales logarithmically with the number of vertices of the graphs; and (2) on a new Ansatz that can efficiently probe the permutation space. Simulations are then presented to showcase the approach on graphs up to 16 vertices, whereas, given the logarithmic scaling, the approach could be applied to realistic sub-graph isomorphism problem instances in the medium term.
Source: arXiv (Cornell University)
Authors: Mariella, Nicola, Simonetto, Andrea
Institution: Mastercard (United States)
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Enterprise Ireland
OpenAlex ID: W4226516685