A Quantum Algorithm for the Sub-Graph Isomorphism Problem - Archive ouverte HAL Access content directly
Journal Articles ACM Transactions on Quantum Computing Year : 2023

A Quantum Algorithm for the Sub-Graph Isomorphism Problem

Nicola Mariella
  • Function : Author
Andrea Simonetto

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.

Dates and versions

hal-03436336 , version 1 (19-11-2021)

Identifiers

Cite

Nicola Mariella, Andrea Simonetto. A Quantum Algorithm for the Sub-Graph Isomorphism Problem. ACM Transactions on Quantum Computing, 2023, 4 (2), ⟨10.1145/3569095⟩. ⟨hal-03436336⟩
51 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More