A Quantum Algorithm for the Sub-graph Isomorphism Problem-Reference-Cited by-同舟云学术

A Quantum Algorithm for the Sub-graph Isomorphism Problem

Published:2023-02-24 Issue:2 Volume:4 Page:1-34
ISSN:2643-6809
Container-title:ACM Transactions on Quantum Computing
language:en
Short-container-title:ACM Transactions on Quantum Computing

Author:

Mariella Nicola¹^ORCID,Simonetto Andrea²^ORCID

Affiliation:

1. IBM Research Europe - Ireland, Ireland

2. UMA, ENSTA Paris, Institut Polytechnique de Paris, Palaiseau, France

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.

Funder

Disruptive Technologies Innovation Fund (DTIF), by Enterprise Ireland

IBM Quantum and Mastercard Ireland

Publisher

Association for Computing Machinery (ACM)

Subject

General Medicine

Link

https://dl.acm.org/doi/pdf/10.1145/3569095

Reference43 articles.

1. Gadi Aleksandrowicz Thomas Alexander Panagiotis Barkoutsos Luciano Bello Yael Ben-Haim David Bucher Francisco Jose Cabrera-Hernández Jorge Carballo-Franquis Adrian Chen Chun-Fu Chen Jerry M. Chow Antonio D. Córcoles-Gonzales Abigail J. Cross Andrew Cross Juan Cruz-Benito Chris Culver Salvador De La Puente González Enrique De La Torre Delton Ding Eugene Dumitrescu Ivan Duran Pieter Eendebak Mark Everitt Ismael Faro Sertage Albert Frisch Andreas Fuhrer Jay Gambetta Borja Godoy Gago Juan Gomez-Mosquera Donny Greenberg Ikko Hamamura Vojtech Havlicek Joe Hellmers Łukasz Herok Hiroshi Horii Shaohan Hu Takashi Imamichi Toshinari Itoko Ali Javadi-Abhari Naoki Kanazawa Anton Karazeev Kevin Krsulich Peng Liu Yang Luh Yunho Maeng Manoel Marques Francisco Jose Martín-Fernández Douglas T. McClure David McKay Srujan Meesala Antonio Mezzacapo Nikolaj Moll Diego Moreda Rodríguez Giacomo Nannicini Paul Nation Pauline Ollitrault Lee James O’Riordan Hanhee Paik Jesús Pérez Anna Phan Marco Pistoia Viktor Prutyanov Max Reuter Julia Rice Abdón Rodríguez Davila Raymond Harry Putra Rudy Mingi Ryu Ninad Sathaye Chris Schnabel Eddie Schoute Kanav Setia Yunong Shi Adenilton Silva Yukio Siraichi Seyon Sivarajah John A. Smolin Mathias Soeken Hitomi Takahashi Ivano Tavernelli Charles Taylor Pete Taylour Kenso Trabing Matthew Treinish Wes Turner Desiree Vogt-Lee Christophe Vuillot Jonathan A. Wildstrom Jessica Wilson Erick Winston Christopher Wood Stephen Wood Stefan Wörner Ismail Yunus Akhalwaya and Christa Zoufal. 2019. Qiskit: An Open-source Framework for Quantum Computing Zenodo DOI:https://zenodo.org/record/2562111/export/hx#.Y3tNMi8w1qs

2. On convex relaxation of graph isomorphism

3. G. E. Andrews. 1994. Number Theory. Dover Publications.

4. Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results

5. Marcel Seelbach Benkner, Vladislav Golyanik, Christian Theobalt, and Michael Moeller. 2020. Adiabatic quantum graph matching with permutation matrix constraints. In International Conference on 3D Vision (3DV). 583–592.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving various NP-hard problems using exponentially fewer qubits on a quantum computer;Physical Review A;2024-05-30

2. An Overview of Data Extraction From Invoices;IEEE Access;2024