Approaching unstructured search from function bilateral symmetry detection - A quantum algorithm
Quantum Physics
2016-04-12 v3 Data Structures and Algorithms
Abstract
Detection of symmetry is vital to problem solving. Most of the problems of computer vision and computer graphics and machine intelligence in general, can be reduced to symmetry detection problem. Unstructured search problem can also be looked upon from symmetry detection point of view. Unstructured search can be thought as searching a binary string satisfying some search condition in an unsorted list of binary strings. In this paper unstructured search problem is reduced to function bilateral symmetry detection problem with polynomial overhead in terms of the size of the input. Keywords: Unstructured Search, Quantum algorithm, Function bilateral symmetry detection, Decision Problem, Quantum Black Box, Solving NP complete problems.
Cite
@article{arxiv.1505.01116,
title = {Approaching unstructured search from function bilateral symmetry detection - A quantum algorithm},
author = {Dinesh Kumar and Pankaj Srivastava},
journal= {arXiv preprint arXiv:1505.01116},
year = {2016}
}