Daniele Veraldi, Davide Pierangeli, Silvia Gentilini, Marcello Calvanese Strinati, Jason Sakellariou, James S. Cummins, Airat Kamaletdinov, Marvin Syed, Richard Zhipeng Wang, Natalia G. Berloff, Dimitrios Karanikolopoulos, Pavlos G. Savvidis, Claudio Conti
{"title":"Fully Programmable Spatial Photonic Ising Machine by Focal Plane Division","authors":"Daniele Veraldi, Davide Pierangeli, Silvia Gentilini, Marcello Calvanese Strinati, Jason Sakellariou, James S. Cummins, Airat Kamaletdinov, Marvin Syed, Richard Zhipeng Wang, Natalia G. Berloff, Dimitrios Karanikolopoulos, Pavlos G. Savvidis, Claudio Conti","doi":"10.1103/physrevlett.134.063802","DOIUrl":null,"url":null,"abstract":"Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to N</a:mi>P</a:mi></a:math>-hard combinatorial optimization problems. Spatial photonic Ising machines (SPIMs) exploit optical computing in free space to accelerate the computation, showcasing parallelism, scalability, and low power consumption. However, current SPIMs can implement only a restricted class of problems. This partial programmability is a critical limitation that hampers their benchmark. Achieving full programmability of the device while preserving its scalability is an open challenge. Here, we report a fully programmable SPIM achieved through a novel operation method based on the division of the focal plane. In our scheme, a general Ising problem is decomposed into a set of Mattis Hamiltonians, whose energies are simultaneously computed optically by measuring the intensity on different regions of the camera sensor. Exploiting this concept, we experimentally demonstrate the computation with high success probability of ground-state solutions of up to 32-spin Ising models on unweighted maximum cut graphs with and without ferromagnetic bias. Simulations of the hardware prove a favorable scaling of the accuracy with the number of spin. Our fully programmable SPIM enables the implementation of many quadratic unconstrained binary optimization problems, further establishing SPIMs as a leading paradigm in non–von Neumann hardware. <jats:supplementary-material> <jats:copyright-statement>Published by the American Physical Society</jats:copyright-statement> <jats:copyright-year>2025</jats:copyright-year> </jats:permissions> </jats:supplementary-material>","PeriodicalId":20069,"journal":{"name":"Physical review letters","volume":"49 1","pages":""},"PeriodicalIF":8.1000,"publicationDate":"2025-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Physical review letters","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.1103/physrevlett.134.063802","RegionNum":1,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Ising machines are an emerging class of hardware that promises ultrafast and energy-efficient solutions to NP-hard combinatorial optimization problems. Spatial photonic Ising machines (SPIMs) exploit optical computing in free space to accelerate the computation, showcasing parallelism, scalability, and low power consumption. However, current SPIMs can implement only a restricted class of problems. This partial programmability is a critical limitation that hampers their benchmark. Achieving full programmability of the device while preserving its scalability is an open challenge. Here, we report a fully programmable SPIM achieved through a novel operation method based on the division of the focal plane. In our scheme, a general Ising problem is decomposed into a set of Mattis Hamiltonians, whose energies are simultaneously computed optically by measuring the intensity on different regions of the camera sensor. Exploiting this concept, we experimentally demonstrate the computation with high success probability of ground-state solutions of up to 32-spin Ising models on unweighted maximum cut graphs with and without ferromagnetic bias. Simulations of the hardware prove a favorable scaling of the accuracy with the number of spin. Our fully programmable SPIM enables the implementation of many quadratic unconstrained binary optimization problems, further establishing SPIMs as a leading paradigm in non–von Neumann hardware. Published by the American Physical Society2025
期刊介绍:
Physical review letters(PRL)covers the full range of applied, fundamental, and interdisciplinary physics research topics:
General physics, including statistical and quantum mechanics and quantum information
Gravitation, astrophysics, and cosmology
Elementary particles and fields
Nuclear physics
Atomic, molecular, and optical physics
Nonlinear dynamics, fluid dynamics, and classical optics
Plasma and beam physics
Condensed matter and materials physics
Polymers, soft matter, biological, climate and interdisciplinary physics, including networks