Related papers: Optical Solver of Combinatorial Problems: Nano-Tec…
The emerging optical multiplexing within nanoscale shows super-capacity in encoding information by using the time-domain fingerprints from uniform nanoparticles. However, the optical diffraction limit compromises the decoding throughput and…
We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers. In particular, we define a model of computation…
The mining in physics and biology for accelerating the hardcore algorithm to solve non-deterministic polynomial (NP) hard problems has inspired a great amount of special-purpose ma-chine models. Ising machine has become an efficient solver…
We propose a new shape-based modeling technique for applications in imaging problems. Given a collection of shape priors (a shape dictionary), we define our problem as choosing the right dictionary elements and geometrically composing them…
An intriguing interpretation of the time-evolution of dynamical systems is to view it as a computation that transforms an initial state to a final one. This paradigm has been explored in discrete systems such as cellular automata models,…
Numerical optimization for the inverse design of photonic structures is a tool which is providing increasingly convincing results -- even though the wave nature of problems in photonics makes them particularly complex. In the meantime, the…
Geometry processing presents a variety of difficult numerical problems, each seeming to require its own tailored solution. This breadth is largely due to the expansive list of geometric primitives, e.g., splines, triangles, and hexahedra,…
Optical computing systems deliver unrivalled processing speeds for scalar operations. Yet, integrated implementations have been constrained to low-dimensional tensor operations that fall short of the vector dimensions required for modern…
Quantum computing is seeking to realize hardware-optimized algorithms for application-related computational tasks. NP (nondeterministic-polynomial-time) is a complexity class containing many important but intractable problems like the…
We propose to use sub-wavelength confinement of light associated with the near field of plasmonic systems to create nanoscale optical lattices for ultracold atoms. Our approach combines the unique coherence properties of isolated atoms with…
We show optical waves passing through a nanophotonic medium can perform artificial neural computing. Complex information, is encoded in the wave front of an input light. The medium transforms the wave front to realize sophisticated…
The successful development and optimisation of optically-driven micromachines will be greatly enhanced by the ability to computationally model the optical forces and torques applied to such devices. In principle, this can be done by…
This paper introduces a deterministic algorithm for solving an instance of the Subset Sum Problem based on a new method entitled the Bipartite Synthesis Method. The algorithm is described and shown to have worst-case limiting performance…
Strong coupling of quantum emitters with confined electromagnetic modes of nanophotonic structures may be used to change optical, chemical and transport properties of materials, with significant theoretical effort invested towards a better…
The application of combinatorial optimization problems to solving the problems of planning processes for industries based on a fund of reconfigurable production resources is considered. The results of their solution by mixed integer…
We examine the optical properties of a system of nano and micro particles of varying size, shape, and material (including metals and dielectrics, and sub-wavelength and super-wavelength regimes). Training data is generated by numerically…
A promising approach to achieve computational supremacy over the classical von Neumann architecture explores classical and quantum hardware as Ising machines. The minimisation of the Ising Hamiltonian is known to be NP-hard problem for…
Performing linear operations using optical devices is a crucial building block in many fields ranging from telecommunication to optical analogue computation and machine learning. For many of these applications, key requirements are…
The subset sum problem is known to be an NP-hard problem in the field of computer science with the fastest known approach having a run-time complexity of $O(2^{0.3113n})$. A modified version of this problem is known as the perfect sum…
Exactly computing the full output distribution of linear optical circuits remains a challenge, as existing methods are either time-efficient but memory-intensive or memory-efficient but slow. Moreover, any realistic simulation must account…