Using synchronized oscillators to compute the maximum independent set

Author:

Mallick Antik,Bashar Mohammad Khairul,Truesdell Daniel S.ORCID,Calhoun Benton H.,Joshi SiddharthORCID,Shukla NikhilORCID

Abstract

AbstractNot all computing problems are created equal. The inherent complexity of processing certain classes of problems using digital computers has inspired the exploration of alternate computing paradigms. Coupled oscillators exhibiting rich spatio-temporal dynamics have been proposed for solving hard optimization problems. However, the physical implementation of such systems has been constrained to small prototypes. Consequently, the computational properties of this paradigm remain inadequately explored. Here, we demonstrate an integrated circuit of thirty oscillators with highly reconfigurable coupling to compute optimal/near-optimal solutions to the archetypally hard Maximum Independent Set problem with over 90% accuracy. This platform uniquely enables us to characterize the dynamical and computational properties of this hardware approach. We show that the Maximum Independent Set is more challenging to compute in sparser graphs than in denser ones. Finally, using simulations we evaluate the scalability of the proposed approach. Our work marks an important step towards enabling application-specific analog computing platforms to solve computationally hard problems.

Publisher

Springer Science and Business Media LLC

Subject

General Physics and Astronomy,General Biochemistry, Genetics and Molecular Biology,General Chemistry

Reference70 articles.

1. Barahona, F. On the computational complexity of Ising spin glass models. J. Phys. A 15, 3241–3253 (1982).

2. Fraenkel, A. S. Complexity of protein folding. Bull. Math. Biol. 55, 1199–1210 (1993).

3. Wang, J. et al. Segmenting subcellular structures in histology tissue images. In 2015 IEEE 12th International Symposium on Biomedical Imaging (ISBI), 556–559 (IEEE, Brooklyn, NY, 2015).

4. Garey, M. & Johnson, D. Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co Ltd., New York, NY, 1990).

5. Lawler, E. L. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).

Cited by 38 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3