.png){kind=icon}
Return
A Quantum Algorithm for the Sub-graph Isomorphism Problem
.png){kind=icon}
OA
AI
DOI：10.1145/3569095.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Optimization
quantum computing
Journal
A
IF:
6.8
Papers:
540
Citations:
508
Organization
Cited Papers
ShareSaveShareSaveShareSaveShareSaveExperimental quantum annealing: case study involving the graph isomorphism problem.png)
SCIENTIFIC REPORTS
OAAI
SCIENTIFIC REPORTSIF3.9
OAAIShareSaveMapping landscape connectivity as a driver of species richness under tectonic and climatic forcingOAAI
OAAIShareSave
View more