Optical NP problem solver on laser-written waveguide platform
Open Access
- 9 January 2018
- journal article
- research article
- Published by Optica Publishing Group in Optics Express
- Vol. 26 (2) , 702-710
Abstract
Cognitive photonic networks are researched to efficiently solve computationally hard problems. Flexible fabrication techniques for the implementation of such networks into compact and scalable chips are desirable for the study of new optical computing schemes and algorithm optimization. Here we demonstrate a femtosecond laser-written optical oracle based on cascaded directional couplers in glass, for the solution of the Hamiltonian path problem. By interrogating the integrated photonic chip with ultrashort laser pulses, we were able to distinguish the different paths traveled by light pulses, and thus infer the existence or the absence of the Hamiltonian path in the network by using an optical correlator. This work proves that graph theory problems may be easily implemented in integrated photonic networks, down scaling the net size and speeding up execution times.Keywords
Funding Information
- Fondazione Cariplo (FemtoDiamante)
- Ministero dell’Istruzione, dell’Università e della Ricerca (MIUR) (DIAMANTE SIR)
- Ministry of Education - Singapore (MOE) (MOE2011-T3-1-005)
This publication has 36 references indexed in Scilit:
- IS PROTEIN FOLDING PROBLEM REALLY A NP-COMPLETE ONE? FIRST INVESTIGATIONSJournal of Bioinformatics and Computational Biology, 2014
- Universal Computation by Multiparticle Quantum WalkScience, 2013
- Masking traveling beams: Optical solutions for NP-complete problems, trading space for timeTheoretical Computer Science, 2010
- The Protein Folding ProblemAnnual Review of Biophysics, 2008
- Optical Quantum ComputingScience, 2007
- Guest Column: NP-complete problems and physical realityACM SIGACT News, 2005
- Using three-dimensional microfluidic networks for solving computationally hard problemsProceedings of the National Academy of Sciences, 2001
- The protein threading problem with sequence amino acid interaction preferences is NP-completeProtein Engineering, Design and Selection, 1994
- Complexity of protein foldingBulletin of Mathematical Biology, 1993
- A Procedure for Clique Detection Using the Group MatrixSociometry, 1957