Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
Author(s): Alan BojićSubject(s): ICT Information and Communications Technologies
Published by: Fakultet organizacije i informatike, Sveučilište u Zagrebu
Keywords: quantum computing; quantum algorithm; maximum clique;
Summary/Abstract: The maximum clique in an undirected graph is the largest subset of a set of graph's vertices where each pair of elements in the subset is connected. In this paper I would like to propose an algorithm for quantum computers that finds a maximum clique in an arbitrary undirected graph. An algorithm has O(|V|2|V|/2) worst case time complexity and O(2|V|/2) best case time complexity. Algorithm's space complexity for each case is O(|V|). An algorithm is based on a version of Grover's quantum algorithm for finding element in an unsorted list in which there can be an unknown number of solutions.
Journal: Journal of Information and Organizational Sciences
- Issue Year: 36/2012
- Issue No: 2
- Page Range: 91-98
- Page Count: 8
- Language: English
