By S. Hengeveld and others

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... Show more

May 25, 2021

Loading full text...

Similar articles

Loading recommendations...

x1

Solving the One-dimensional Distance Geometry Problem by Optical Computing

Click on play to start listening