A Quantum Algorithm for the Sub-graph Isomorphism Problem

被引：2

作者：

Mariella, Nicola ^{[1
]}

Simonetto, Andrea ^{[2
,3
]}

机构：

[1] IBM Res Europe Ireland, IBM Technol Campus,Damastown Ind Pk, Mulhuddart D15 HN66, Dublin, Ireland

[2] ENSTA Paris, Inst Polytech Paris, UMA, Palaiseau, France

[3] ENSTA, Inst Polytech Paris, UMA, 828 Blvd Marechaux, F-91762 Palaiseau, France

来源：

ACM TRANSACTIONS ON QUANTUM COMPUTING | 2023年 / 4卷 / 02期

关键词：

Optimization; quantum computing; SUBGRAPH ISOMORPHISM; INTERFERENCE;

D O I：

10.1145/3569095

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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.

引用

页数：34

共 50 条

[1] An algorithm portfolio for the sub-graph isomorphism problem
Battiti, Roberto
Mascia, Franco
[J]. ENGINEERING STOCHASTIC LOCAL SEARCH ALGORITHMS: DESIGNING, IMPLEMENTING AND ANALYZING EFFECTIVE HEURISTICS, 2007, 4638 : 106 - +
[2] Product Recognition in Store Shelves as a Sub-Graph Isomorphism Problem
Tonioni, Alessio
Di Stefano, Luigi
[J]. IMAGE ANALYSIS AND PROCESSING,(ICIAP 2017), PT I, 2017, 10484 : 682 - 693
[3] A Control Task Assignment Algorithm based on sub-graph isomorphism
Yu, Feng
Li, Xixian
Zhang, Huimin
Wang, Li-e
[J]. 2020 EIGHTH INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA (CBD 2020), 2020, : 265 - 271
[4] Virtual network embedding algorithm based on improved sub-graph isomorphism search
Wei, Xiao-Hui
Zou, Lei
Li, Hong-Liang
[J]. Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2013, 43 (01): : 165 - 171
[5] Approximate Maximum Common Sub-graph Isomorphism Based on Discrete-Time Quantum Walk
Lu, Kai
Zhang, Yi
Xu, Kai
Gao, Yinghui
Wilson, Richard
[J]. 2014 22ND INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2014, : 1413 - 1418
[6] A Privacy Policy Conflict Detection Method based on Sub-graph Isomorphism
Ren, Yi
Peng, Zhiyong
Cheng, Fangquan
Guo, Sipei
[J]. MINES 2009: FIRST INTERNATIONAL CONFERENCE ON MULTIMEDIA INFORMATION NETWORKING AND SECURITY, VOL 1, PROCEEDINGS, 2009, : 107 - +
[7] Identification of application specific instructions based on sub-graph isomorphism constraints
Wolinski, Christophe
Kuchcinski, Krzysztof
[J]. 2007 IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, 2007, : 328 - +
[8] ODES: an overlapping dense sub-graph algorithm
Long, James
Hartman, Chris
[J]. BIOINFORMATICS, 2010, 26 (21) : 2788 - 2789
[9] Algorithm for detecting complete sub-graph in complex network
Dept. of Electronic Machinery and Transportation Engineering, Guilin University of Electronic Technology, Guilin 541004, China
不详
[J]. Yi Qi Yi Biao Xue Bao, 2006, SUPPL. (925-927):
[10] Quantum invariants and the graph isomorphism problem
Mills, P. W.
Rundle, R. P.
Samson, J. H.
Devitt, Simon J.
Tilma, Todd
Dwyer, V. M.
Everitt, Mark J.
[J]. PHYSICAL REVIEW A, 2019, 100 (05)

← 1 2 3 4 5 →