Solving the One-dimensional Distance Geometry Problem by Optical Computing
Abstract
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows exponentially with the number of inputs. It is conjectured that quantum computing schemes can solve problems belonging to this class in a time that grows only at a polynomial rate with the number of inputs. While quantum computers are still being developed, there are some classical optics computation approaches that can perform very well for specific tasks. Here, we present an optical computing approach for the distance geometry problem in one dimension and show that it is very promising in the classical computing regime.
Cite
@article{arxiv.2105.12118,
title = {Solving the One-dimensional Distance Geometry Problem by Optical Computing},
author = {S. B. Hengeveld and N. Rubiano da Silva and D. S. Gonçalves and P. H. Souto Ribeiro and A. Mucherino},
journal= {arXiv preprint arXiv:2105.12118},
year = {2021}
}
Comments
8 pages, 1 figure