Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
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.
Sai Zeng, Angran Xiao, et al.
CAD Computer Aided Design
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory