Matches in SemOpenAlex for { <https://semopenalex.org/work/W2964323998> ?p ?o ?g. }
Showing items 1 to 88 of
88
with 100 items per page.
- W2964323998 abstract "In the graph isomorphism (GI) problem two $N$-vertex graphs $G$ and ${G}^{ensuremath{'}}$ are given and the task is to determine whether there exists a permutation of the vertices of $G$ that preserves adjacency and transforms $Gensuremath{rightarrow}{G}^{ensuremath{'}}$. If yes, then $G$ and ${G}^{ensuremath{'}}$ are said to be isomorphic; otherwise they are nonisomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficulty to integer factorization. In this paper we present a quantum algorithm that solves arbitrary instances of GI and which also provides an approach to determining all automorphisms of a given graph. We show how the GI problem can be converted to a combinatorial optimization problem that can be solved using adiabatic quantum evolution. We numerically simulate the algorithm's quantum dynamics and show that it correctly (i) distinguishes nonisomorphic graphs; (ii) recognizes isomorphic graphs and determines the permutation(s) that connect them; and (iii) finds the automorphism group of a given graph $G$. We then discuss the GI quantum algorithm's experimental implementation, and close by showing how it can be leveraged to give a quantum algorithm that solves arbitrary instances of the NP-complete subgraph isomorphism problem. The computational complexity of an adiabatic quantum algorithm is largely determined by the minimum energy gap $ensuremath{Delta}(N)$ separating the ground and first-excited states in the limit of large problem size $Nensuremath{gg}1$. Calculating $ensuremath{Delta}(N)$ in this limit is a fundamental open problem in adiabatic quantum computing, and so it is not possible to determine the computational complexity of adiabatic quantum algorithms in general, nor consequently, of the specific adiabatic quantum algorithms presented here. Adiabatic quantum computing has been shown to be equivalent to the circuit model of quantum computing, and so development of adiabatic quantum algorithms continues to be of great interest." @default.
- W2964323998 created "2019-07-30" @default.
- W2964323998 creator A5016482411 @default.
- W2964323998 creator A5020345036 @default.
- W2964323998 date "2014-03-04" @default.
- W2964323998 modified "2023-09-26" @default.
- W2964323998 title "Graph isomorphism and adiabatic quantum computing" @default.
- W2964323998 hasPublicationYear "2014" @default.
- W2964323998 type Work @default.
- W2964323998 sameAs 2964323998 @default.
- W2964323998 citedByCount "0" @default.
- W2964323998 crossrefType "journal-article" @default.
- W2964323998 hasAuthorship W2964323998A5016482411 @default.
- W2964323998 hasAuthorship W2964323998A5020345036 @default.
- W2964323998 hasConcept C11413529 @default.
- W2964323998 hasConcept C114614502 @default.
- W2964323998 hasConcept C115624301 @default.
- W2964323998 hasConcept C118615104 @default.
- W2964323998 hasConcept C121332964 @default.
- W2964323998 hasConcept C131992880 @default.
- W2964323998 hasConcept C132525143 @default.
- W2964323998 hasConcept C137019171 @default.
- W2964323998 hasConcept C179799912 @default.
- W2964323998 hasConcept C185592680 @default.
- W2964323998 hasConcept C192353077 @default.
- W2964323998 hasConcept C203436722 @default.
- W2964323998 hasConcept C203776342 @default.
- W2964323998 hasConcept C21308566 @default.
- W2964323998 hasConcept C24890656 @default.
- W2964323998 hasConcept C33923547 @default.
- W2964323998 hasConcept C58053490 @default.
- W2964323998 hasConcept C61665672 @default.
- W2964323998 hasConcept C62520636 @default.
- W2964323998 hasConcept C8010536 @default.
- W2964323998 hasConcept C80899671 @default.
- W2964323998 hasConcept C84114770 @default.
- W2964323998 hasConcept C92957085 @default.
- W2964323998 hasConceptScore W2964323998C11413529 @default.
- W2964323998 hasConceptScore W2964323998C114614502 @default.
- W2964323998 hasConceptScore W2964323998C115624301 @default.
- W2964323998 hasConceptScore W2964323998C118615104 @default.
- W2964323998 hasConceptScore W2964323998C121332964 @default.
- W2964323998 hasConceptScore W2964323998C131992880 @default.
- W2964323998 hasConceptScore W2964323998C132525143 @default.
- W2964323998 hasConceptScore W2964323998C137019171 @default.
- W2964323998 hasConceptScore W2964323998C179799912 @default.
- W2964323998 hasConceptScore W2964323998C185592680 @default.
- W2964323998 hasConceptScore W2964323998C192353077 @default.
- W2964323998 hasConceptScore W2964323998C203436722 @default.
- W2964323998 hasConceptScore W2964323998C203776342 @default.
- W2964323998 hasConceptScore W2964323998C21308566 @default.
- W2964323998 hasConceptScore W2964323998C24890656 @default.
- W2964323998 hasConceptScore W2964323998C33923547 @default.
- W2964323998 hasConceptScore W2964323998C58053490 @default.
- W2964323998 hasConceptScore W2964323998C61665672 @default.
- W2964323998 hasConceptScore W2964323998C62520636 @default.
- W2964323998 hasConceptScore W2964323998C8010536 @default.
- W2964323998 hasConceptScore W2964323998C80899671 @default.
- W2964323998 hasConceptScore W2964323998C84114770 @default.
- W2964323998 hasConceptScore W2964323998C92957085 @default.
- W2964323998 hasLocation W29643239981 @default.
- W2964323998 hasOpenAccess W2964323998 @default.
- W2964323998 hasPrimaryLocation W29643239981 @default.
- W2964323998 hasRelatedWork W1764304027 @default.
- W2964323998 hasRelatedWork W1809065701 @default.
- W2964323998 hasRelatedWork W2006197471 @default.
- W2964323998 hasRelatedWork W2009106180 @default.
- W2964323998 hasRelatedWork W2030719575 @default.
- W2964323998 hasRelatedWork W2050281832 @default.
- W2964323998 hasRelatedWork W2072969317 @default.
- W2964323998 hasRelatedWork W2090653164 @default.
- W2964323998 hasRelatedWork W2129874988 @default.
- W2964323998 hasRelatedWork W2138262447 @default.
- W2964323998 hasRelatedWork W2274873607 @default.
- W2964323998 hasRelatedWork W2278585988 @default.
- W2964323998 hasRelatedWork W2802608981 @default.
- W2964323998 hasRelatedWork W289478640 @default.
- W2964323998 hasRelatedWork W2895574305 @default.
- W2964323998 hasRelatedWork W3000907577 @default.
- W2964323998 hasRelatedWork W3085299273 @default.
- W2964323998 hasRelatedWork W3103677072 @default.
- W2964323998 hasRelatedWork W3127818029 @default.
- W2964323998 hasRelatedWork W3167544365 @default.
- W2964323998 hasVolume "2014" @default.
- W2964323998 isParatext "false" @default.
- W2964323998 isRetracted "false" @default.
- W2964323998 magId "2964323998" @default.
- W2964323998 workType "article" @default.