An optical solution for the set splitting problem

We describe here an optical device, based on time-delays, for solving the set splitting problem which is well-known NP-complete problem. The device has a graph-like structure and the light is traversing it from a start node to a destination node. All possible (potential) paths in the graph are generated and at the destination we will check which one satisfies completely the problem's constrains.Comment: 10 pages, 2 figure

All-Optical Reinforcement Learning in Solitonic X-Junctions

L'etologia ha dimostrato che gruppi di animali o colonie possono eseguire calcoli complessi distribuendo semplici processi decisionali ai membri del gruppo. Ad esempio, le colonie di formiche possono ottimizzare le traiettorie verso il cibo eseguendo sia un rinforzo (o una cancellazione) delle tracce di feromone sia spostarsi da una traiettoria ad un'altra con feromone più forte. Questa procedura delle formiche possono essere implementati in un hardware fotonico per riprodurre l'elaborazione del segnale stigmergico. Presentiamo qui innovative giunzioni a X completamente integrate realizzate utilizzando guide d'onda solitoniche in grado di fornire entrambi i processi decisionali delle formiche. Le giunzioni a X proposte possono passare da comportamenti simmetrici (50/50) ad asimmetrici (80/20) utilizzando feedback ottici, cancellando i canali di uscita inutilizzati o rinforzando quelli usati.Ethology has shown that animal groups or colonies can perform complex calculation distributing simple decision-making processes to the group members. For example ant colonies can optimize the trajectories towards the food by performing both a reinforcement (or a cancellation) of the pheromone traces and a switch from one path to another with stronger pheromone. Such ant's processes can be implemented in a photonic hardware to reproduce stigmergic signal processing. We present innovative, completely integrated X-junctions realized using solitonic waveguides which can provide both ant's decision-making processes. The proposed X-junctions can switch from symmetric (50/50) to asymmetric behaviors (80/20) using optical feedbacks, vanishing unused output channels or reinforcing the used ones

The edge-disjoint path problem on random graphs by message-passing

We present a message-passing algorithm to solve the edge disjoint path problem (EDP) on graphs incorporating under a unique framework both traffic optimization and path length minimization. The min-sum equations for this problem present an exponential computational cost in the number of paths. To overcome this obstacle we propose an efficient implementation by mapping the equations onto a weighted combinatorial matching problem over an auxiliary graph. We perform extensive numerical simulations on random graphs of various types to test the performance both in terms of path length minimization and maximization of the number of accommodated paths. In addition, we test the performance on benchmark instances on various graphs by comparison with state-of-the-art algorithms and results found in the literature. Our message-passing algorithm always outperforms the others in terms of the number of accommodated paths when considering non trivial instances (otherwise it gives the same trivial results). Remarkably, the largest improvement in performance with respect to the other methods employed is found in the case of benchmarks with meshes, where the validity hypothesis behind message-passing is expected to worsen. In these cases, even though the exact message-passing equations do not converge, by introducing a reinforcement parameter to force convergence towards a sub optimal solution, we were able to always outperform the other algorithms with a peak of 27% performance improvement in terms of accommodated paths. On random graphs, we numerically observe two separated regimes: one in which all paths can be accommodated and one in which this is not possible. We also investigate the behaviour of both the number of paths to be accommodated and their minimum total length.Comment: 14 pages, 8 figure

Soliton propagation and polarisation mode-locking in birefringent optical fibres

Soliton propagation in polarization-preserving fibres is analysed. Based on the coupled nonlinear Schrodinger equations we derive an analytical approximation for such type of soliton propagation. Exploitation of soliton polarization properties for passive mode-locking in fibre lasers is also considered

Highly photo-stable Perovskite nanocubes: towards integrated single photon sources based on tapered nanofibers

The interest in perovskite nanocrystals (NCs) such as CsPbBr$_3$ for quantum applications is rapidly raising, as it has been demonstrated that they can behave as very efficient single photon emitters. The main problem to tackle in this context is their photo-stability under optical excitation. In this article, we present a full analysis of the optical and quantum properties of highly efficient perovskite nanocubes synthesized with an established method, which is used for the first time to produce quantum emitters, and is shown to ensure an increased photostability. These emitters exhibit reduced blinking together with a strong photon antibunching. Remarkably these features are hardly affected by the increase of the excitation intensity well above the emission saturation levels. Finally, we achieve for the first time the coupling of a single perovskite nanocube with a tapered optical nanofiber in order to aim for a compact integrated single photon source for future applications

Logic Programming approaches for routing fault-free and maximally-parallel Wavelength Routed Optical Networks on Chip (Application paper)

One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networks-on-Chip (ONoCs). Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the International Conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. The underlying technology, only quickly mentioned in that paper, is Answer Set Programming (ASP). In this work, we detail the ASP approach we used to solve such problem. Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint Logic Programming on Finite Domains (CLP(FD)). This paper is under consideration for possible publication on Theory and Practice of Logic Programming.Comment: Paper presented at the 33nd International Conference on Logic Programming (ICLP 2017), Melbourne, Australia, August 28 to September 1, 2017. 16 pages, LaTeX, 5 figure