当前位置: X-MOL 学术arXiv.cs.ET › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Solving the One-dimensional Distance Geometry Problem by Optical Computing
arXiv - CS - Emerging Technologies Pub Date : 2021-05-25 , DOI: arxiv-2105.12118
S. B. Hengeveld, N. Rubiano da Silva, D. S. Gonçalves, P. H. Souto Ribeiro, A. Mucherino

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.

中文翻译:

通过光学计算解决一维距离几何问题

距离几何问题属于经典计算中的一类难题,可以根据根据给定变换处理的一组输入来理解,并且针对这些问题,可能结果的数量与输入的数量成指数增长。可以推测,量子计算方案可以在仅随着输入数量以多项式速率增长的时间内解决属于此类的问题。尽管量子计算机仍在开发中,但是有一些经典的光学计算方法可以很好地完成特定任务。在这里,我们提出了一种用于一维距离几何问题的光学计算方法,并表明它在经典计算机制中非常有前途。
更新日期:2021-05-27
down
wechat
bug