Broadening the set of algorithms and use-cases for analog combinatorial optimization accelerators

Thomas Van Vaerenbergh; Suhas Kumar; Mahmoud Abdelghany; Fabian Bohm; Peter Bienstman; Guy Verschaffelt; Guy Van der Sande; John Paul Strachan; Raymond G. Beausoleil

doi:10.1117/12.2595405

1 August 2021 Broadening the set of algorithms and use-cases for analog combinatorial optimization accelerators

Thomas Van Vaerenbergh, Suhas Kumar, Mahmoud Abdelghany, Fabian Bohm, Peter Bienstman, Guy Verschaffelt, Guy Van der Sande, John Paul Strachan, Raymond G. Beausoleil

Author Affiliations +

Proceedings Volume 11804, Emerging Topics in Artificial Intelligence (ETAI) 2021; 118041S (2021) https://doi.org/10.1117/12.2595405
Event: SPIE Nanoscience + Engineering, 2021, San Diego, California, United States

Abstract

Recent experimental results show how classical accelerators based on analog computing can outperform quantum annealing alternatives in benchmark tasks that require dense connection matrices. In Hewlett Packard Labs, we have been studying two alternatives: integrated coherent Ising machines and mem-HNNs (based on memristive crossbar arrays). An important challenge for commercial viability is that different industrial workloads typically benefit from the availability of a variety of optimization algorithms and require a broad range of template combinatorial optimization problems. In this talk, we will discuss our recent progress in going beyond Max-Cut, and we will propose a broader range of algorithms. This flexibility in algorithm choices and template problems is an important step forward to address the wide variety of enterprise-level use-cases such as airline scheduling, supply chain optimization, real-time bandwidth management, gene sequencing, etc.

Conference Presentation

Citation Download Citation

Thomas Van Vaerenbergh, Suhas Kumar, Mahmoud Abdelghany, Fabian Bohm, Peter Bienstman, Guy Verschaffelt, Guy Van der Sande, John Paul Strachan, and Raymond G. Beausoleil "Broadening the set of algorithms and use-cases for analog combinatorial optimization accelerators", Proc. SPIE 11804, Emerging Topics in Artificial Intelligence (ETAI) 2021, 118041S (1 August 2021); https://doi.org/10.1117/12.2595405

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
PRESENTATION

WATCH
PRESENTATION SAVE TO MY LIBRARY

GET CITATION

KEYWORDS

Optimization (mathematics)

Analog electronics

Algorithms

Annealing

Computer simulations

Quantum computing

Genetic algorithms

Show All Keywords

Keywords/Phrases

Search In:

Publication Years