Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Classical Machines, for Solving the Toughest Problems in Computer Science

Not Accessible

Your library or personal account may give you access

Abstract

Classical analog processors are now solving hard Computer Science problems that were thought to require a Quantum Computer. There are now classical machines that solve Ising type optimizations, opening the door toward other NP-hard problems as well.

© 2019 The Author(s)

PDF Article
More Like This
A compact and inexpensive coherent Ising machine based on opto-electronic feedback for solving combinatorial optimization problems

Fabian Böhm, Guy Verschaffelt, and Guy Van der Sande
STh4M.3 CLEO: Science and Innovations (CLEO_SI) 2020

Solving MAXCUT optimization problems with a coherent Ising machine based on opto-electronic oscillators

Fabian Böhm, Guy Verschaffelt, and Guy Van der Sande
jsi_3_2 European Quantum Electronics Conference (EQEC) 2019

Solving Vertex Cover Problem using Quadrature Photonic Spatial Ising Machine

Wenchen Sun, Wenjia Zhang, Yuanyuan Liu, Qingwen Liu, and Zuyuan He
M2G.4 Optical Fiber Communication Conference (OFC) 2022

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2023 | Optica Publishing Group. All Rights Reserved