2022/09/29 by Hernan I. de la Cruz, Fernando L. Pelayo, de la Cruz, Hernán I. +11
Computer Science · #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Graph Theory and Algorithms #Quantum Computing Algorithms and Architecture
paper · pdf · doi:10.48550/arxiv.2209.14914
openalex publication_date 2022/09/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Graph Isomorphism is such an important problem in computer science, that it has been widely studied over the last decades. It is well known that it belongs to NP class, but is not NP-complete. It is thought to be of comparable difficulty to integer factorisation. The best known proved algorithm to solve this problem in general, was proposed by László Babai and Eugene Luks in 1983. Recently, there has been some research in the topic by using quantum computing, that also leads the present piece of research. In fact, we present a quantum computing algorithm that defines an invariant over Graph Isomorphism characterisation. This quantum algorithm is able to distinguish more non-isomorphic graphs than most of the known invariants so far. The proof of correctness and some hints illustrating the extent and reason of the improvement are also included in this paper.