Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Synchronously-pumped OPO coherent Ising machine: benchmarking and prospects

Synchronously-pumped OPO coherent Ising machine: benchmarking and prospects

Thumbnail Image
Download
Name

112990J.pdf

Description
Published version
Size

896.31 KB

Format

Adobe PDF

Checksum (MD5)

42d35a0aec3f9e619b8ef34750f2ee0c

sword-2020-12-14T19:01:36.original.xml (130 B)
Original SWORD entry document
Author(s)
Hamerly, Ryan M
•
Englund, Dirk R.
Date Issued
February 2020
Journal
Proceedings of SPIE - The International Society for Optical Engineering
Publisher
SPIE
Citation
Hamerly, Ryan et al. “Synchronously-pumped OPO coherent Ising machine: benchmarking and prospects.” Paper in the Proceedings of SPIE - The International Society for Optical Engineering, 11299, AI and Optical Data Sciences, San Francisco CA, February 1-6 2020, SPIE: 112990J © 2020 The Author(s)
Version
Final published version
Abstract
The coherent Ising machine (CIM) is a network of optical parametric oscillators (OPOs) that solves for the ground state of Ising problems through OPO bifurcation dynamics. Here, we present experimental results comparing the performance of the CIM to quantum annealers (QAs) on two claßes of NP-hard optimization problems: ground state calculation of the Sherrington-Kirkpatrick (SK) model and MAX-CUT. While the two machines perform comparably on sparsely-connected problems such as cubic MAX-CUT, on problems with dense connectivity, the QA shows an exponential performance penalty relative to CIMs. We attribute this to the embedding overhead required to map dense problems onto the sparse hardware architecture of the QA, a problem that can be overcome in photonic architectures such as the CIM.
MIT Department
Massachusetts Institute of Technology. Research Laboratory of Electronics
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/129605
DOI of Published Version
https://doi.org/10.1117/12.2547046
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.