.png){kind=icon}
返回
A Quantum Algorithm for the Sub-graph Isomorphism Problem
.png){kind=icon}
OA
AI
DOI：10.1145/3569095.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Optimization
quantum computing
期刊
A
IF:
6.8
论文数:
539
被引数:
508
机构
引用论文
分享收藏分享收藏Stochastic gradient descent for hybrid quantum-classical optimization混合量子-经典优化的随机梯度下降.png)
QUANTUMOAAI
QUANTUMIF5.4
OAAI分享收藏Experimental quantum annealing: case study involving the graph isomorphism problemSCIENTIFIC REPORTS
OAAI
SCIENTIFIC REPORTSIF3.9
OAAI分享收藏Mapping landscape connectivity as a driver of species richness under tectonic and climatic forcingOAAI
OAAI分享收藏
查看更多内容