Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Nanotechnology Magazine

VLSI Implementation of an Annealing Accelerator for Solving Combinatorial Optimization Problems

Yuan‐Ho Chen, Hsin-Tung Hua, Chin-Fu Nien, Shinn‐Yn Lin

Published Apr 18, 2024• 0 citations
Publisher

Abstract

Although quantum computing is expected to supplant traditional computing in several application fields, its adoption is hampered by temperature and economic constraints. To overcome these hurdles, researchers have proposed complementary metal-oxide-semiconductor (CMOS) annealing circuits. These circuits draw inspiration from quantum computing algorithms such as quantum annealing and aim to achieve near-quantum benefits by leveraging traditional CMOS technologies. This paper introduces an Ising-model-based hardware architecture that can be applied to combinatorial optimization problems (COPs). With its ability to express quadratic unconstrained binary optimization (QUBO) formulations as polynomials, the Ising model facilitates the encapsulation of multiple solutions and mapping onto fully connected architecture. The proposed annealing accelerator utilizes traditional circuit technologies, including pseudo-random number generators (PRNGs), to realize the required algorithms. The chip proposed herein, implemented using Taiwan Semiconductor Manufacturing Company (TSMC) 90-nm CMOS technology, operates at 50 MHz and covers an area of $3.24{\mathrm{m}}{{\mathrm{m}}^2}$3.24mm2. Experimental results demonstrate the excellent performance of this annealing accelerator in terms of area and power consumption, indicating its promise for use in solving COPs rapidly.

DOI
10.1109/mnano.2024.3378483

Related papers

A Review of Ising Machines Implemented in Conventional and Emerging Technologies

Tingting Zhang, Qichao Tao, Bailiang Liu +9 more

Ising machines have received growing interest as efficient and hardware-friendly solvers for combinatorial optimization problems (COPs). They search for the absolute or approximate ground states of the Ising model with a proper annealing process. In contrast to Ising machines built with superconductive or optical circuits, complementary metal-oxide-semiconductor (CMOS) Ising machines offer inexpensive fabrication, high scalability, and easy integration with mainstream semiconductor chips. As low-energy and CMOS-compatible emerging technologies, spintronics and phase-transition devices offer functionalities that can enhance the scalability and sampling performance of Ising machines. In this article, we survey various approaches in the process flow for solving COPs using CMOS, hybrid CMOS-spintronic, and phase-transition devices. First, the methods for formulating COPs as Ising problems and embedding Ising formulations to the topology of the Ising machine are reviewed. Then, Ising machines are classified by their underlying operational principles and reviewed from a perspective of hardware implementation. CMOS solutions are advantageous with denser connectivity, whereas hybrid CMOS-spintronic and phase-transition device-based solutions show great potential in energy efficiency and high performance. Finally, the challenges and prospects are discussed for the Ising formulation, embedding process, and implementation of Ising machines.

IEEE Transactions on Nanotechnology•Jan 1, 2024•35 citations

A 1.87-TELOPS/W 3-D Ising Machine for Accelerated Quantum Monte Carlo With Reconfigurability Using CMOS p-Bits

Ming-Che Li, Archisman Ghosh, Risi Jaiswal +2 more

Qubit-based quantum annealing processors operate at ultra-low temperatures (15 mK) requiring enormous cooling energy. Consequently, there is a lot of interest in quantum Monte Carlo (QMC) algorithms that can be used to emulate quantum computing on classical machines. However, prior classical emulators implemented on CPUs, GPUs, or field-programmable gate arrays (FPGAs) are orders of magnitude slower than quantum annealers highlighting the need for dedicated application-specific integrated circuits (ASICs). Over the past decade, many ASICs have been developed, including general Ising solvers, typically implemented as digital system on chip (SoCs) targeting highly complex graphs, and specific Ising solvers, which address relatively simple Ising graphs using analog computing paradigms. General solvers often suffer from high power consumption, while specific solvers lack reconfigurability. This work presents, for the first time, a QMC algorithm implemented on a 3-D Ising computer fabricated in commercial 65-nm CMOS technology. Specifically, it solves a quantum problem in which a transverse field Ising (TFI) Hamiltonian is applied to an unconventional octagonal lattice. The reconfigurable integrated circuit (IC) also supports traditional 2-D Ising models for solving combinatorial optimization problems (COPs), offering better reconfigurability than prior specific Ising solvers. This IC achieved an energy-to-solution of$41.9~\mu $J at 1 MHz and$16.65~\mu $J at 10 MHz at 0.5 V for the QMC problem. Compared to previous FPGA implementations, this is a three-order-of-magnitude improvement and a six-order-of-magnitude improvement over CPU-based solutions. This article also proposes a new energy efficiency metric,$E_{\text {ELOP}}$(Energy per ELementary OPeration), to better benchmark p-bit-based Ising solvers. Our IC achieves an$E_{\text {ELOP}}$of 1350 fJ at 1 MHz and 535 fJ at 10 MHz (measured at 0.5 V) for solving the QMC problem, which are also equivalent to the energy efficiency of 0.74 and 1.87 TELOPS/W (ELementary OPeration per Second per Watt).

IEEE Journal of Solid-State Circuits•Jun 17, 2026•0 citations

Quantum Annealing Combinatorial Optimization (QACO)

Jincheng Zhang

This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.

•Sep 3, 2026•0 citations

Quantum Annealing for Combinatorial Optimization in Large-Scale Networks

Jincheng Zhang

This paper explores the application of quantum annealing to the challenging domain of combinatorial optimization within large-scale networks. Specifically, it investigates the feasibility of utilizing quantum annealing for problems such as network routing and scheduling, where traditional classical algorithms often struggle due to computational complexity. The core approach involves formulating the network optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem. This transformation enables the mapping of the problem onto the quantum annealing hardware, leveraging the quantum annealing process – characterized by its adiabatic evolution – to discover the optimal solution. We argue that this method presents a potential advantage over conventional algorithms for large-scale network scenarios, offering a pathway to tackling problems previously considered intractable. The theoretical framework and underlying principles are thoroughly discussed, outlining the methodology and highlighting the anticipated benefits.

•Sep 6, 2026•0 citations

Constraint Solving by Quantum Annealing

Philippe Codognet

We present experiments in solving combinatorial optimization and constraint satisfaction problems by means of Quantum Annealing. We describe how to model classic constraint problems such as N-queens and Magic Square as well as hard combinatorial problems such as the Costas Array Problem or the Quadratic Assignment Problem in terms of QUBO (Quadratic Unconstrained Binary Optimization). QUBO is the input language of quantum computers based on quantum annealing such as the D-Wave systems and of the ”quantum-inspired” but classical devices such as Fujitsu’s Digital Annealing Unit or Hitachi’s CMOS Annealing Machine. We present preliminary results for solving these combinatorial optimization and constraint satisfaction problems by implementation on the D-Wave quantum computer.

International Conference on Parallel Processing Workshops (ICPPW)•Aug 9, 2021•9 citations

Investigating the Characteristics of Ising Machines

Kazuhiko Komatsu, Makoto Onoda, Masahito Kumagai +1 more

Recently, Ising machines have garnered attention as accelerators for resolving combinatorial optimization problems by converting them into Quadratic Unconstrained Binary Optimization (QUBO) problems. Ising machines have been rapidly developed with various implementations. For instance, there are different Ising machines like quantum annealing machines that use analog quantum circuits, simulated annealing machines that use digital processors like CPU, GPU, and VE, and digital annealing machines that use digital circuits such as CMOS and FPGA. However, the characteristics of Ising machines have not been fully comprehended, because a standardized evaluation method and a commonly used benchmark program for Ising machines have not been established yet. This research focuses on combinatorial clustering as a benchmark program for the evaluation of Ising machines, aiming to investigate the characteristics of Ising machines.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•3 citations
Although quantum computing is expected to supplant traditional computing in several application fields, its adoption is hampered by temperature and economic constraints. To overcome these hurdles, researchers have proposed complementary metal-oxide-semiconductor (CMOS) annealing circuits. These circuits draw inspiration from quantum computing algorithms such as quantum annealing and aim to achieve near-quantum benefits by leveraging traditional CMOS technologies. This paper introduces an Ising-model-based hardware architecture that can be applied to combinatorial optimization problems (COPs). With its ability to express quadratic unconstrained binary optimization (QUBO) formulations as polynomials, the Ising model facilitates the encapsulation of multiple solutions and mapping onto fully connected architecture. The proposed annealing accelerator utilizes traditional circuit technologies, including pseudo-random number generators (PRNGs), to realize the required algorithms. The chip proposed herein, implemented using Taiwan Semiconductor Manufacturing Company (TSMC) 90-nm CMOS technology, operates at 50 MHz and covers an area of 3.24mm23.24{\mathrm{m}}{{\mathrm{m}}^2}3.24mm23.24mm2. Experimental results demonstrate the excellent performance of this annealing accelerator in terms of area and power consumption, indicating its promise for use in solving COPs rapidly.
Ising machines have received growing interest as efficient and hardware-friendly solvers for combinatorial optimization problems (COPs). They search for the absolute or approximate ground states of the Ising model with a proper annealing process. In contrast to Ising machines built with superconductive or optical circuits, complementary metal-oxide-semiconductor (CMOS) Ising machines offer inexpensive fabrication, high scalability, and easy integration with mainstream semiconductor chips. As low-energy and CMOS-compatible emerging technologies, spintronics and phase-transition devices offer functionalities that can enhance the scalability and sampling performance of Ising machines. In this article, we survey various approaches in the process flow for solving COPs using CMOS, hybrid CMOS-spintronic, and phase-transition devices. First, the methods for formulating COPs as Ising problems and embedding Ising formulations to the topology of the Ising machine are reviewed. Then, Ising machines are classified by their underlying operational principles and reviewed from a perspective of hardware implementation. CMOS solutions are advantageous with denser connectivity, whereas hybrid CMOS-spintronic and phase-transition device-based solutions show great potential in energy efficiency and high performance. Finally, the challenges and prospects are discussed for the Ising formulation, embedding process, and implementation of Ising machines.
Qubit-based quantum annealing processors operate at ultra-low temperatures (15 mK) requiring enormous cooling energy. Consequently, there is a lot of interest in quantum Monte Carlo (QMC) algorithms that can be used to emulate quantum computing on classical machines. However, prior classical emulators implemented on CPUs, GPUs, or field-programmable gate arrays (FPGAs) are orders of magnitude slower than quantum annealers highlighting the need for dedicated application-specific integrated circuits (ASICs). Over the past decade, many ASICs have been developed, including general Ising solvers, typically implemented as digital system on chip (SoCs) targeting highly complex graphs, and specific Ising solvers, which address relatively simple Ising graphs using analog computing paradigms. General solvers often suffer from high power consumption, while specific solvers lack reconfigurability. This work presents, for the first time, a QMC algorithm implemented on a 3-D Ising computer fabricated in commercial 65-nm CMOS technology. Specifically, it solves a quantum problem in which a transverse field Ising (TFI) Hamiltonian is applied to an unconventional octagonal lattice. The reconfigurable integrated circuit (IC) also supports traditional 2-D Ising models for solving combinatorial optimization problems (COPs), offering better reconfigurability than prior specific Ising solvers. This IC achieved an energy-to-solution of$41.9~\mu $J at 1 MHz and$16.65~\mu Jat10MHzat0.5VfortheQMCproblem.ComparedtopreviousFPGAimplementations,thisisathree−order−of−magnitudeimprovementandasix−order−of−magnitudeimprovementoverCPU−basedsolutions.Thisarticlealsoproposesanewenergyefficiencymetric,J at 10 MHz at 0.5 V for the QMC problem. Compared to previous FPGA implementations, this is a three-order-of-magnitude improvement and a six-order-of-magnitude improvement over CPU-based solutions. This article also proposes a new energy efficiency metric,Jat10MHzat0.5VfortheQMCproblem.ComparedtopreviousFPGAimplementations,thisisathree−order−of−magnitudeimprovementandasix−order−of−magnitudeimprovementoverCPU−basedsolutions.Thisarticlealsoproposesanewenergyefficiencymetric,E_{\text {ELOP}}(EnergyperELementaryOPeration),tobetterbenchmarkp−bit−basedIsingsolvers.OurICachievesan(Energy per ELementary OPeration), to better benchmark p-bit-based Ising solvers. Our IC achieves an(EnergyperELementaryOPeration),tobetterbenchmarkp−bit−basedIsingsolvers.OurICachievesanE_{\text {ELOP}}$of 1350 fJ at 1 MHz and 535 fJ at 10 MHz (measured at 0.5 V) for solving the QMC problem, which are also equivalent to the energy efficiency of 0.74 and 1.87 TELOPS/W (ELementary OPeration per Second per Watt).
This paper explores the application of Quantum Annealing (QA) to the field of combinatorial optimization. The core idea is to leverage the principles of quantum mechanics, specifically quantum tunneling, to efficiently solve complex optimization problems. We present a framework for utilizing QA to tackle problems represented as quadratic unconstrained binary optimization (QUBO) models. The methodology focuses on mapping the problem's constraints and objective function into a form suitable for QA hardware. We discuss the challenges involved in this mapping process, including the limitations of current QA devices and the need for careful problem formulation. Furthermore, we analyze the potential advantages of QA over classical optimization techniques, particularly concerning the exploration of a wider solution space. The research highlights the promise of QACO as a viable approach for tackling computationally demanding combinatorial optimization tasks, offering a novel method to enhance optimization efficiency.
This paper explores the application of quantum annealing to the challenging domain of combinatorial optimization within large-scale networks. Specifically, it investigates the feasibility of utilizing quantum annealing for problems such as network routing and scheduling, where traditional classical algorithms often struggle due to computational complexity. The core approach involves formulating the network optimization problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem. This transformation enables the mapping of the problem onto the quantum annealing hardware, leveraging the quantum annealing process – characterized by its adiabatic evolution – to discover the optimal solution. We argue that this method presents a potential advantage over conventional algorithms for large-scale network scenarios, offering a pathway to tackling problems previously considered intractable. The theoretical framework and underlying principles are thoroughly discussed, outlining the methodology and highlighting the anticipated benefits.
We present experiments in solving combinatorial optimization and constraint satisfaction problems by means of Quantum Annealing. We describe how to model classic constraint problems such as N-queens and Magic Square as well as hard combinatorial problems such as the Costas Array Problem or the Quadratic Assignment Problem in terms of QUBO (Quadratic Unconstrained Binary Optimization). QUBO is the input language of quantum computers based on quantum annealing such as the D-Wave systems and of the ”quantum-inspired” but classical devices such as Fujitsu’s Digital Annealing Unit or Hitachi’s CMOS Annealing Machine. We present preliminary results for solving these combinatorial optimization and constraint satisfaction problems by implementation on the D-Wave quantum computer.
Recently, Ising machines have garnered attention as accelerators for resolving combinatorial optimization problems by converting them into Quadratic Unconstrained Binary Optimization (QUBO) problems. Ising machines have been rapidly developed with various implementations. For instance, there are different Ising machines like quantum annealing machines that use analog quantum circuits, simulated annealing machines that use digital processors like CPU, GPU, and VE, and digital annealing machines that use digital circuits such as CMOS and FPGA. However, the characteristics of Ising machines have not been fully comprehended, because a standardized evaluation method and a commonly used benchmark program for Ising machines have not been established yet. This research focuses on combinatorial clustering as a benchmark program for the evaluation of Ising machines, aiming to investigate the characteristics of Ising machines.