QUBO formulations for the graph isomorphism problem and related problems.
Theoretical Computer Science(2017)
摘要
We present and compare various methods to construct efficient QUBO formulations for the Graph Isomorphism Problem—one of a very few problems in NP that is neither known to be solvable in polynomial time nor NP-complete—and two related Subgraph Isomorphism Problems that are NP-hard. Experimental results on two QUBO formulations of the Graph Isomorphism Problem suggest that our direct formulation is more practical than the others with respect to running on the D-Wave architecture.
更多查看译文
关键词
Adiabatic quantum computing,Quadratic unconstrained binary optimization,Chimera graph,Graph isomorphism problem,Subgraph isomorphism problem
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要