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

Vacuum and Surface Science

Fundamental and Application to Material Development of Digital Annealer

Hideyuki Jippo, Chieko TERASHIMA, Mari Ohfuchi

Published Mar 9, 2020• 1 citation
Publisher

Abstract

Digital Annealer developed by Fujitsu is a new architecture to solve “combinatorial optimization problems” at high speed with digital circuit inspired by quantum phenomena. The features are stable operation with digital circuit at room temperature, easy miniaturization, and easy mapping more complex problems with a fully-connected architecture. The Digital Annealer is easy to apply actual problems and contributes to customers in a wide range of businesses, including drug discovery, chemistry, manufacturing, transportation, finance, and logistics. In this article, we explain the fundamental of the Digital Annealer including the speedup technique. We also introduce an application to the material development using the Digital Annealer. The Digital Annealer is used to evaluate the structural similarity of the flavor molecules. We found that the molecules with high structural similarity show a similar flavor. We also extracted the common substructure of molecules having the similar flavor, which is considered to be the key structure of the flavor.

DOI
10.1380/vss.63.117

Related papers

Silicon chip delivers quantum speeds [News]

John Boyd

Fujitsu has designed a new computer architecture running on silicon-dubbed the Digital Annealer-which the company claims rivals quantum computers in utility. Fujitsu began offering cloud services in Japan in May, employing the technology to resolve combinatorial optimization problems, such as finding similarities among patterns of molecules to speed drug discovery.

IEEE Spectrum•Jun 21, 2018•12 citations

Digital Annealer for High-Speed Solving of Combinatorial optimization Problems and Its Applications

Satoshi Matsubara, Motomu Takatsu, Toshiyuki Miyazawa +4 more

A Digital Annealer (DA) is a dedicated architecture for high-speed solving of combinatorial optimization problems mapped to an Ising model. With fully coupled bit connectivity and high coupling resolution as a major feature, it can be used to express a wide variety of combinatorial optimization problems. The DA uses Markov Chain Monte Carlo as a basic search mechanism, accelerated by the hardware implementation of multiple speed-enhancement techniques such as parallel search, escape from a local solution, and replica exchange. It is currently being offered as a cloud service using a second-generation chip operating on a scale of 8,192 bits. This paper presents an overview of the DA, its performance against benchmarks, and application examples.

Asia and South Pacific Design Automation Conference (ASP-DAC)•Jan 1, 2020•176 citations

Benchmarks for Digital Annealer with Quadratic Constrained Binary Optimization Problems

Hiroaki Kameyama, Yutaka Takita, Matthieu Parizy +2 more

In this paper, we evaluate the performance of Fujitsu's Digital Annealer, an original computing technology inspired by quantum phenomena and developed to solve practical combinatorial optimization problems, using the public benchmark QPLIB. As a result of the performance evaluation, it was confirmed that the best published solution was obtained in more than 90% of the instances at high speed.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 14, 2024•3 citations

Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer

Maliheh Aramon, Gili Rosenberg, Elisabetta Valiante +3 more

The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS hardware and currently solves problems of up to 1024 variables. The Digital Annealer's algorithm is currently based on simulated annealing; however, it differs from it in its utilization of an efficient parallel-trial scheme and a dynamic escape mechanism. In addition, the Digital Annealer exploits the massive parallelization that custom application-specific CMOS hardware allows. We compare the performance of the Digital Annealer to simulated annealing and parallel tempering with isoenergetic cluster moves on two-dimensional and fully connected spin-glass problems with bimodal and Gaussian couplings. These represent the respective limits of sparse versus dense problems, as well as high-degeneracy versus low-degeneracy problems. Our results show that the Digital Annealer currently exhibits a time-to-solution speedup of roughly two orders of magnitude for fully connected spin-glass problems with bimodal or Gaussian couplings, over the single-core implementations of simulated annealing and parallel tempering Monte Carlo used in this study. The Digital Annealer does not appear to exhibit a speedup for sparse two-dimensional spin-glass problems, which we explain on theoretical grounds. We also benchmarked an early implementation of the Parallel Tempering Digital Annealer. Our results suggest an improved scaling over the other algorithms for fully connected problems of average difficulty with bimodal disorder. The next generation of the Digital Annealer is expected to be able to solve fully connected problems up to 8192 variables in size. This would enable the study of fundamental physics problems and industrial applications that were previously inaccessible using standard computing hardware or special-purpose quantum annealing machines.

arXiv:1806.08815•Frontiers in Physics•Apr 5, 2019•493 citations

Solving Combinatorial Optimization Problems on Fujitsu Digital Annealer

Yu-Ting Kao, Jia-Le Liao, Hsiu-Chuan Hsu

Combinatorial optimization problems are ubiquitous in various disciplines and applications. Many heuristic algorithms have been devoted to solve these types of problems. In order to increase the efficiency for finding the optimal solutions, an application-specific hardware, called digital annealer (DA) has been developed for solving combinatorial optimization problems using quadratic unconstrained binary optimization (QUBO) formulations. In this study, we formulated the number partitioning problem and the graph partitioning problem into QUBO forms and solved such problems with the DA developed by Fujitsu Ltd. The QUBO formulation of the number partitioning problem is fully connected. The DA found the overall runtime for the optimal solution to be less than 30 seconds for 6500 binary variables. For the graph partitioning problem, we adopted modularity as the metric for determining the quality of the partitions. For Zachary's Karate Club graph, the modularity obtained was 0.445, a 6% increase against D-wave Quantum Annealer and Simulated Annealing. Moreover, to explore the DA's potential applications to real-world problems, we used the search for communities or virtual microgrids in a power distribution network as an example. The problem was formulated into graph partitioning. It is shown that the DA effectively identified community structures in the IEEE 33-bus and IEEE 118-bus network.

arXiv:2311.05196•Nov 9, 2023•9 citations

Quantum-inspired algorithm for Vehicle Sharing Problem

Whei Yeap Suen, Chun Yat Lee, Hoong Chuin Lau

Recent hardware developments in quantum technologies have inspired a myriad of special-purpose hardware devices tasked to solve optimization problems. In this paper, we explore the application of Fujitsu's quantum-inspired CMOS-based Digital Annealer (DA) in solving constrained routing problems arising in transportation and logistics. More precisely in this paper, we study the vehicle sharing problem and show that the DA as a QUBO solver can potentially fill the gap between two common methods: exact solvers like Cplex and heuristics. We benchmark the scalability and quality of solutions obtained by DA with Cplex and with a greedy heuristic. Our results show that the DA is a general QUBO solver that is more robust than heuristics, and more scalable than Cplex. Our methodology and framework which focus on QUBO problems is also applicable to other quantum-inspired and fully quantum devices that are undergoing development.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Oct 1, 2021•4 citations
Digital Annealer developed by Fujitsu is a new architecture to solve “combinatorial optimization problems” at high speed with digital circuit inspired by quantum phenomena. The features are stable operation with digital circuit at room temperature, easy miniaturization, and easy mapping more complex problems with a fully-connected architecture. The Digital Annealer is easy to apply actual problems and contributes to customers in a wide range of businesses, including drug discovery, chemistry, manufacturing, transportation, finance, and logistics. In this article, we explain the fundamental of the Digital Annealer including the speedup technique. We also introduce an application to the material development using the Digital Annealer. The Digital Annealer is used to evaluate the structural similarity of the flavor molecules. We found that the molecules with high structural similarity show a similar flavor. We also extracted the common substructure of molecules having the similar flavor, which is considered to be the key structure of the flavor.
A Digital Annealer (DA) is a dedicated architecture for high-speed solving of combinatorial optimization problems mapped to an Ising model. With fully coupled bit connectivity and high coupling resolution as a major feature, it can be used to express a wide variety of combinatorial optimization problems. The DA uses Markov Chain Monte Carlo as a basic search mechanism, accelerated by the hardware implementation of multiple speed-enhancement techniques such as parallel search, escape from a local solution, and replica exchange. It is currently being offered as a cloud service using a second-generation chip operating on a scale of 8,192 bits. This paper presents an overview of the DA, its performance against benchmarks, and application examples.
The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS hardware and currently solves problems of up to 1024 variables. The Digital Annealer's algorithm is currently based on simulated annealing; however, it differs from it in its utilization of an efficient parallel-trial scheme and a dynamic escape mechanism. In addition, the Digital Annealer exploits the massive parallelization that custom application-specific CMOS hardware allows. We compare the performance of the Digital Annealer to simulated annealing and parallel tempering with isoenergetic cluster moves on two-dimensional and fully connected spin-glass problems with bimodal and Gaussian couplings. These represent the respective limits of sparse versus dense problems, as well as high-degeneracy versus low-degeneracy problems. Our results show that the Digital Annealer currently exhibits a time-to-solution speedup of roughly two orders of magnitude for fully connected spin-glass problems with bimodal or Gaussian couplings, over the single-core implementations of simulated annealing and parallel tempering Monte Carlo used in this study. The Digital Annealer does not appear to exhibit a speedup for sparse two-dimensional spin-glass problems, which we explain on theoretical grounds. We also benchmarked an early implementation of the Parallel Tempering Digital Annealer. Our results suggest an improved scaling over the other algorithms for fully connected problems of average difficulty with bimodal disorder. The next generation of the Digital Annealer is expected to be able to solve fully connected problems up to 8192 variables in size. This would enable the study of fundamental physics problems and industrial applications that were previously inaccessible using standard computing hardware or special-purpose quantum annealing machines.
Combinatorial optimization problems are ubiquitous in various disciplines and applications. Many heuristic algorithms have been devoted to solve these types of problems. In order to increase the efficiency for finding the optimal solutions, an application-specific hardware, called digital annealer (DA) has been developed for solving combinatorial optimization problems using quadratic unconstrained binary optimization (QUBO) formulations. In this study, we formulated the number partitioning problem and the graph partitioning problem into QUBO forms and solved such problems with the DA developed by Fujitsu Ltd. The QUBO formulation of the number partitioning problem is fully connected. The DA found the overall runtime for the optimal solution to be less than 30 seconds for 6500 binary variables. For the graph partitioning problem, we adopted modularity as the metric for determining the quality of the partitions. For Zachary's Karate Club graph, the modularity obtained was 0.445, a 6% increase against D-wave Quantum Annealer and Simulated Annealing. Moreover, to explore the DA's potential applications to real-world problems, we used the search for communities or virtual microgrids in a power distribution network as an example. The problem was formulated into graph partitioning. It is shown that the DA effectively identified community structures in the IEEE 33-bus and IEEE 118-bus network.
Recent hardware developments in quantum technologies have inspired a myriad of special-purpose hardware devices tasked to solve optimization problems. In this paper, we explore the application of Fujitsu's quantum-inspired CMOS-based Digital Annealer (DA) in solving constrained routing problems arising in transportation and logistics. More precisely in this paper, we study the vehicle sharing problem and show that the DA as a QUBO solver can potentially fill the gap between two common methods: exact solvers like Cplex and heuristics. We benchmark the scalability and quality of solutions obtained by DA with Cplex and with a greedy heuristic. Our results show that the DA is a general QUBO solver that is more robust than heuristics, and more scalable than Cplex. Our methodology and framework which focus on QUBO problems is also applicable to other quantum-inspired and fully quantum devices that are undergoing development.