Combining optical and electronic technology, Stanford researchers have made a new type of computer that can solve problems that are a challenge for traditional computers.
The processing power of standard computers is likely to reach its maximum in the next 10 to 25 years. Even at this maximum power, traditional computers won’t be able to handle a particular class of problem that involves combining variables to come up with many possible answers, and looking for the best solution.
Now, an entirely new type of computer that blends optical and electrical processing, reported Oct. 20 in the journal Science, could get around this impending processing constraint and solve those problems. If it can be scaled up, this non-traditional computer could save costs by finding more optimal solutions to problems that have an incredibly high number of possible solutions.
“This is a machine that’s in a sense the first in its class, and the idea is that it opens up a sub-field of research in the area of non-traditional computing machines,” said Peter McMahon, postdoctoral scholar in applied physics and co-author of the paper. “There are many, many questions that this development raises and we expect that over the next few years, several groups are going to be investigating this class of machine and looking into how this approach will pan out.”
The traveling salesman problem
There is a special type of problem – called a combinatorial optimization problem – that traditional computers find difficult to solve, even approximately. An example is what’s known as the “traveling salesman” problem, wherein a salesman has to visit a specific set of cities, each only once, and return to the first city, and the salesman wants to take the most efficient route possible. This problem may seem simple but the number of possible routes increases extremely rapidly as cities are added, and this underlies why the problem is difficult to solve.
“Those problems are challenging for standard computers, even supercomputers, because as the size grows, at some point, it takes the age of the universe to search through all the possible solutions,” said Alireza Marandi, a former postdoctoral scholar at Stanford and co-author of the study. “This is true even with a supercomputer because the growth in possibilities is so fast.”
It may be tempting to simply give up on the traveling salesman, but solving such hard optimization problems could have enormous impact in a wide range of areas. Examples include finding the optimal path for delivery trucks, minimizing interference in wireless networks, and determining how proteins fold. Even small improvements in some of these areas could result in massive monetary savings, which is why some scientists have spent their careers creating algorithms that produce very good approximate solutions to this type of problem.
An Ising machine
The Stanford team has built what’s called an Ising machine, named for a mathematical model of magnetism. The machine acts like a reprogrammable network of artificial magnets where each magnet only points up or down and, like a real magnetic system, it is expected to tend toward operating at low energy.
The theory is that, if the connections among a network of magnets can be programmed to represent the problem at hand, once they settle on the optimal, low-energy directions they should face, the solution can be derived from their final state. In the case of the traveling salesman, each artificial magnet in the Ising machine represents the position of a city in a particular path.
Rather than using magnets on a grid, the Stanford team used a special kind of laser system, known as a degenerate optical parametric oscillator, that, when turned on, will represent an upward- or downward-pointing “spin.” Pulses of the laser represent a city’s position in a path the salesman could take. In an earlier version of this machine (published two years ago), the team members extracted a small portion of each pulse, delayed it and added a controlled amount of that portion to the subsequent pulses. In traveling salesman terms, this is how they program the machine with the connections and distances between the cities. The pulse-to-pulse couplings constitute the programming of the problem. Then the machine is turned on to try to find a solution, which can be obtained by measuring the final output phases of the pulses.
The problem in this previous approach was connecting large numbers of pulses in arbitrarily complex ways. It was doable but required an added controllable optical delay for each pulse, which was costly and difficult to implement.
The latest Stanford Ising machine shows that a drastically more affordable and practical version could be made by replacing the controllable optical delays with a digital electronic circuit. The circuit emulates the optical connections among the pulses in order to program the problem and the laser system still solves it.
Nearly all of the materials used to make this machine are off-the-shelf elements that are already used for telecommunications. That, in combination with the simplicity of the programming, makes it easy to scale up. Stanford’s machine is currently able to solve 100-variable problems with any arbitrary set of connections between variables, and it has been tested on thousands of scenarios.
A group at NTT in Japan that consulted with Stanford’s team has also created an independent version of the machine; its study has been published alongside Stanford’s by Science. For now, the Ising machine still falls short of beating the processing power of traditional digital computers when it comes to combinatorial optimization. But it is gaining ground fast and the researchers are looking forward to seeing what other work will be possible based on this breakthrough.
“I think it’s an exciting avenue of exploration for finding alternative computers. It can get us closer to more efficient ways of tackling some of the most daunting computational problems we have,” said Marandi. “So far, we’ve made a laser-based computer that can target some of these problems, and we have already shown some promising results.”
The Latest on: Ising machine
via Google News
The Latest on: Ising machine
- VUB researchers shrink optical computeron November 18, 2019 at 10:57 am
A team from the Vrije Universiteit Brussel (VUB) succeeded in constructing a so-called coherent Ising machine (CIM) from off-the-shelf optical components. This resulted in a drastic size reduction: ...
- Fabrication of atomic junctions with experimental parameters optimized using ground-state searches of Ising spin computingon November 7, 2019 at 2:17 am
We tested these parameters in actual FCE experiments, and we demonstrated that the Ising spin model could improve the controllability of the quantized conductance in atomic junctions. This result ...
- New kind of computer built for complex problemson October 20, 2019 at 5:00 pm
The team has built what’s called an Ising machine, named for a mathematical model of magnetism. The machine acts like a reprogrammable network of artificial magnets where each magnet only points up or ...
- Photonics Modeling: Optical Ising machines solve complex engineering, science, and even business problemson July 30, 2019 at 5:00 pm
Researchers have built the largest photonic Ising machine to date—an optical processor for solving difficult optimization problems by modeling interacting spins via a spatially varying light field.
- Investigating the long-time behavior of the two-dimensional Ising model by leveraging the Java Virtual Machine (JVM)on June 23, 2019 at 2:33 pm
Further, the Ising model has been related to Machine Learning models (see discussion in Quora: How is the Ising model related to machine learning?) and I postulate that it will be increasingly more ...
- Researchers find connectivity more important that thought for specialized optimizing machineson June 10, 2019 at 6:37 am
Researchers have also suggested other types of technology for building specialized optimizing machines—one such example is the Ising machine being pioneered at Stanford University. It is a type of ...
- Viewpoint: Photonic Ising Machines Go Bigon May 31, 2019 at 9:12 am
Figure 1: Pierangeli et al. realized a scalable Ising machine by encoding spins in the spatial modulation of the phase of a laser beam (green). They set the interactions between the spins by ...
- Experimental investigation of performance differences between coherent Ising machines and a quantum annealeron April 4, 2019 at 5:00 pm
1 Research Laboratory of Electronics, Massachusetts Institute of Technology, 50 Vassar Street, Cambridge, MA 02139, USA. 2 National Institute of Informatics, Hitotsubashi 2-1-2, Chiyoda-ku, Tokyo ...
- A coherent Ising machine for 2000-node optimization problemson March 3, 2019 at 4:00 pm
1 NTT Basic Research Laboratories, NTT Corporation, 3-1 Morinosato Wakamiya, Atsugi, Kanagawa 243-0198, Japan. 2 Department of Mathematical Informatics, University of Tokyo, Hongo 7-3-1, Bunkyo-ku, ...
via Bing News