Solving the Hamiltonian path problem with a light-based computer

In this paper we propose a special computational device which uses light rays for solving the Hamiltonian path problem on a directed graph. The device has a graph-like representation and the light is traversing it by following the routes given by the connections between nodes. In each node the rays are uniquely marked so that they can be easily identified. At the destination node we will search only for particular rays that have passed only once through each node. We show that the proposed device can solve small and medium instances of the problem in reasonable time.

[1]  J H Reif,et al.  Efficient parallel algorithms for optical computing with the discrete Fourier transform (DFT) primitive. , 1997, Applied optics.

[2]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[3]  Cern.  Quantum computers and intractable (NP-complete) computing problems. , 1993, Physical review. A, Atomic, molecular, and optical physics.

[4]  Thomas J. Naughton,et al.  Implementations of a Model of Physical Sorting , 2008, Int. J. Unconv. Comput..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[7]  S. Harris,et al.  Light speed reduction to 17 metres per second in an ultracold atomic gas , 1999, Nature.

[8]  Juris Hartmanis,et al.  On the Weight of Computations , 1995, Bull. EATCS.

[9]  G. Agrawal.  Fiber‐Optic Communication Systems , 2021 .

[10]  L M Adleman,et al.  Molecular computation of solutions to combinatorial problems. , 1994, Science.

[11]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[12]  Mihai Oltean.  A Light-Based Device for Solving the Hamiltonian Path Problem , 2006, UC.

[13]  Joseph W. Goodman,et al.  Architectural development of optical data processing systems , 1982 .

[14]  H. Orland,et al.  Phase diagram of a semiflexible polymer chain in a θ solvent: Application to protein folding , 1995, cond-mat/9512058.

[15]  Dominik Schultes.  Rainbow Sort: Sorting at the Speed of Light , 2004, Natural Computing.

[16]  N. J. A. Sloane,et al.  The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[17]  Thomas J. Naughton,et al.  Model of computation for Fourier optical processors , 2000, International Topical Meeting on Optics in Computing.

[18]  E. A. Stach,et al.  Stationary pulses of light in an atomic medium , 2022 .

[19]  Z. Dutton,et al.  Observation of coherent optical information storage in an atomic medium using halted light pulses , 2001, Nature.

[20]  Thomas J. Naughton,et al.  An optical model of computation , 2005, Theor. Comput. Sci..

[21]  G. W. Greenwood,et al.  Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms , 2000, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[22]  Pierluigi Frisco,et al.  An Algorithm for SAT Without an Extraction Phase , 2005, DNA.

[23]  M. Paniccia,et al.  A continuous-wave Raman silicon laser , 2005, Nature.

[24]  H. L. Le Roy,et al.  Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[25]  Dror G. Feitelson.  Optical computing - a survey for computer scientists , 1988 .

[26]  Jerome Faist.  Optoelectronics: Silicon shines on , 2005, Nature.

[27]  Alexander Fang,et al.  An all-silicon Raman laser , 2005, Nature.