A molecular computing approach to solving optimization problems via programmable microdroplet arrays
Si Yue Guo,Pascal Friederich,Pascal Friederich,Yudong Cao,Tony C. Wu,Chris Forman,Douglas Mendoza,Douglas Mendoza,Matthias Degroote,Andrew C. Cavell,Veronica K. Krasecki,Riley J. Hickman,Abhishek Sharma,Leroy Cronin,Nathan C. Gianneschi,Randall H. Goldsmith,Alán Aspuru-Guzik +16 more
12
TL;DR: This work presents a microdroplet array molecular computer to solve combinatorial optimization problems by employing an Ising Hamiltonian to map problems heuristically to droplet-droplet interactions.
read more
Abstract: Summary The search for novel forms of computing to the dominant von Neumann model-based approach is important as it will enable different classes of problems to be solved Molecular computers are a promising alternative to semiconductor-based computers given their potential biocompatibility and cost advantages The vast space of chemical reactions makes molecules a tunable, scalable, and energy-efficient computational vehicle In molecular computers, memory and processing units can be combined into a single, inherently parallelized device Here, we present a microdroplet array molecular computer to solve combinatorial optimization problems by employing an Ising Hamiltonian to map problems heuristically to droplet-droplet interactions The droplets represent binary digits and problems are encoded in intra- and inter-droplet reactions We propose two implementations: first, a hybrid classical-molecular computer that enforces inter-droplet constraints in a classical computer and, second, a purely molecular computer where the problem is entirely pre-programmed in the nearest-neighbor droplet reactions
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
A fully programmable 100-spin coherent Ising machine with all-to-all connections
Peter L. McMahon,Alireza Marandi,Yoshitaka Haribara,Ryan Hamerly,Carsten Langrock,Shuhei Tamate,Takahiro Inagaki,Hiroki Takesue,Shoko Utsunomiya,Kazuyuki Aihara,Robert L. Byer,Martin M. Fejer,Hideo Mabuchi,Yoshihisa Yamamoto +13 more
TL;DR: A scalable optical processor with electronic feedback that can be realized at large scale with room-temperature technology is presented and is able to find exact solutions of, or sample good approximate solutions to, a variety of hard instances of Ising problems.
Ising machines as hardware solvers of combinatorial optimization problems
TL;DR: Ising machines as discussed by the authors are special-purpose hardware solvers that aim to find the absolute or approximate ground states of the Ising model, which is of fundamental computational interest because any problem in the complexity class NP can be formulated as an Ising problem with only polynomial overhead and thus a scalable Ising machine that outperforms existing standard digital computers could have a huge impact for practical applications.
•Journal Article
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
TL;DR: In this article, a quantum computer consisting of quantum nonlinear oscillators, instead of quantum bits, is proposed to solve hard combinatorial optimization problems, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing.
Large-scale coherent Ising machine based on optoelectronic parametric oscillator
Qizhuang Cen,Hao Ding,Tengfei Hao,Shanhong Guan,Zhiqiang Qin,Jiaming Lyu,Wei Liu,Ninghua Zhu,Kun Xu,Yitang Dai,Ming Shan Li +10 more
TL;DR: In this article , the authors proposed to use short microwave pulses generated from an optoelectronic parametric oscillator as the spins to implement a large-scale Ising machine with high stability.
•Posted Content
Microwave Photonic Ising Machine
TL;DR: In this article, the authors proposed to use short microwave pulses generated from an optoelectronic parametric oscillator as the spins to implement the Ising machine with large scale and also high coherence under room temperature.
12
References
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
46.9K
Reducibility Among Combinatorial Problems.
Richard M. Karp
- 01 Jan 1972
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
13.6K
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
8.7K
The complexity of theorem-proving procedures
Stephen A. Cook
- 03 May 1971
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
7.4K
Molecular computation of solutions to combinatorial problems
TL;DR: This experiment demonstrates the feasibility of carrying out computations at the molecular level by solving an instance of the directed Hamiltonian path problem with standard protocols and enzymes.