Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
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.
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research
B.K. Boguraev, Mary S. Neff
HICSS 2000