Quantum invariants for the graph isomorphism problem
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 s...
| Autores: | , , , , , , |
|---|---|
| Tipo de documento: | artigo |
| Data de publicação: | 2022 |
| País: | España |
| Recursos: | Universidad Complutense de Madrid (UCM) |
| Repositório: | Docta Complutense |
| Idioma: | inglês |
| OAI Identifier: | oai:docta.ucm.es:20.500.14352/72679 |
| Acesso em linha: | https://hdl.handle.net/20.500.14352/72679 |
| Access Level: | Acceso aberto |
| Palavra-chave: | 510.52 Cibernética matemática 1207.03 Cibernética |
| Resumo: | 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. |
|---|