Abstract

We introduce an optical method based on white light interferometry in order to solve the well-known NP–complete traveling salesman problem. To our knowledge it is the first time that a method for the reduction of non–polynomial time to quadratic time has been proposed. We will show that this achievement is limited by the number of available photons for solving the problem. It will turn out that this number of photons is proportional to NN for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal–to–noise ratio. The proposed method is meant purely as a gedankenexperiment.

©2007 Optical Society of America

Corrections Tobias Haist and Wolfgang Osten, "An optical solution for the traveling salesman problem: erratum," Opt. Express 15, 12627-12627 (2007)

https://www.osapublishing.org/oe/abstract.cfm?uri=oe-15-20-12627 Tobias Haist and Wolfgang Osten, "An optical solution for the traveling salesman problem: erratum," Opt. Express, 12627-12627 (2007)

An optical solution for the traveling salesman problem: erratum Tobias Haist and Wolfgang Osten

Opt. Express 15(20) 12627-12627 (2007)

Optical solution for bounded NP-complete problems Natan T. Shaked, Stephane Messika, Shlomi Dolev, and Joseph Rosen

Appl. Opt. 46(5) 711-724 (2007)

Channel allocation in elastic optical networks using traveling salesman problem algorithms Chayan Bhar, Erik Agrell, Kamran Keykhosravi, Magnus Karlsson, and Peter A. Andrekson

J. Opt. Commun. Netw. 11(10) C58-C66 (2019)