A Quantum Algorithm for the Sub-Graph Isomorphism Problem
From MaRDI portal
Publication:6383388
arXiv2111.09732MaRDI QIDQ6383388
Author name not available (Why is that?)
Publication date: 18 November 2021
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.
Has companion code repository: https://github.com/qiskit-community/subgraph-isomorphism
This page was built for publication: A Quantum Algorithm for the Sub-Graph Isomorphism Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6383388)