Do you want to publish a course? Click here

A Scalable Photonic Computer Solving the Subset Sum Problem

127   0   0.0 ( 0 )
 Added by Xian-Min Jin
 Publication date 2020
and research's language is English




Ask ChatGPT about the research

The subset sum problem is a typical NP-complete problem that is hard to solve efficiently in time due to the intrinsic superpolynomial-scaling property. Increasing the problem size results in a vast amount of time consuming in conventionally available computers. Photons possess the unique features of extremely high propagation speed, weak interaction with environment and low detectable energy level, therefore can be a promising candidate to meet the challenge by constructing an a photonic computer computer. However, most of optical computing schemes, like Fourier transformation, require very high operation precision and are hard to scale up. Here, we present a chip built-in photonic computer to efficiently solve the subset sum problem. We successfully map the problem into a waveguide network in three dimensions by using femtosecond laser direct writing technique. We show that the photons are able to sufficiently dissipate into the networks and search all the possible paths for solutions in parallel. In the case of successive primes the proposed approach exhibits a dominant superiority in time consumption even compared with supercomputers. Our results confirm the ability of light to realize a complicated computational function that is intractable with conventional computers, and suggest the subset sum problem as a good benchmarking platform for the race between photonic and conventional computers on the way towards photonic supremacy.



rate research

Read More

323 - Zhengjun Cao , Lihua Liu 2018
Given a set (or multiset) S of n numbers and a target number t, the subset sum problem is to decide if there is a subset of S that sums up to t. There are several methods for solving this problem, including exhaustive search, divide-and-conquer method, and Bellmans dynamic programming method. However, none of them could generate universal and light code. In this paper, we present a new deterministic algorithm based on a novel data arrangement, which could generate such code and return all solutions. If n is small enough, it is efficient for usual purpose. We also present a probabilistic version with one-sided error and a greedy algorithm which could generate a solution with minimized variance.
In photonic neural network a key building block is the perceptron. Here, we describe and demonstrate a complex-valued photonic perceptron that combines time and space multiplexing in a fully passive silicon photonics integrated circuit. An input time dependent bit sequence is broadcasted into a few delay lines where the relative phases are trained by particle swarm algorithms toward the given task. Since only the phases of the propagating optical modes are trained, signal attenuation in the perceptron due to amplitude modulation is avoided. The perceptron performs binary pattern recognition and few bit delayed XOR operations up to 16 Gbps (limited by the used electronics) with Bit Error Rates as low as $10^{-6}$. The perceptron is fully integrated, silicon based, scalable, and can be used as a building block in large neural networks.
Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into states of light and the modern tools for their generation. Here we propose such a design for a scalable and fault-tolerant photonic quantum computer informed by the latest developments in theory and technology. Central to our architecture is the generation and manipulation of three-dimensional hybrid resource states comprising both bosonic qubits and squeezed vacuum states. The proposal enables exploiting state-of-the-art procedures for the non-deterministic generation of bosonic qubits combined with the strengths of continuous-variable quantum computation, namely the implementation of Clifford gates using easy-to-generate squeezed states. Moreover, the architecture is based on two-dimensional integrated photonic chips used to produce a qubit cluster state in one temporal and two spatial dimensions. By reducing the experimental challenges as compared to existing architectures and by enabling room-temperature quantum computation, our design opens the door to scalable fabrication and operation, which may allow photonics to leap-frog other platforms on the path to a quantum computer with millions of qubits.
Distance geometry problem belongs to a class of hard problems in classical computation that can be understood in terms of a set of inputs processed according to a given transformation, and for which the number of possible outcomes grows exponentially with the number of inputs. It is conjectured that quantum computing schemes can solve problems belonging to this class in a time that grows only at a polynomial rate with the number of inputs. While quantum computers are still being developed, there are some classical optics computation approaches that can perform very well for specific tasks. Here, we present an optical computing approach for the distance geometry problem in one dimension and show that it is very promising in the classical computing regime.
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 for various combinatorial optimizationproblems. As a computing accelerator, large-scale photonic spatial Ising machine have great advan-tages and potentials due to excellent scalability and compact system. However, current fundamentallimitation of photonic spatial Ising machine is the configuration flexibility of problem implementationin the accelerator model. Arbitrary spin interactions is highly desired for solving various NP hardproblems. Moreover, the absence of external magnetic field in the proposed photonic Ising machinewill further narrow the freedom to map the optimization applications. In this paper, we propose anovel quadrature photonic spatial Ising machine to break through the limitation of photonic Isingaccelerator by synchronous phase manipulation in two and three sections. Max-cut problem solutionwith graph order of 100 and density from 0.5 to 1 is experimentally demonstrated after almost 100iterations. We derive and verify using simulation the solution for Max-cut problem with more than1600 nodes and the system tolerance for light misalignment. Moreover, vertex cover problem, modeled as an Ising model with external magnetic field, has been successfully implemented to achievethe optimal solution. Our work suggests flexible problem solution by large-scale photonic spatialIsing machine.
comments
Fetching comments Fetching comments
Sign in to be able to follow your search criteria
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا