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 Spectrum

Silicon chip delivers quantum speeds [News]

John Boyd

Published Jun 21, 2018• 12 citations
Publisher

Abstract

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.

DOI
10.1109/mspec.2018.8389173

Related papers

Fundamental and Application to Material Development of Digital Annealer

Hideyuki Jippo, Chieko TERASHIMA, Mari Ohfuchi

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.

Vacuum and Surface Science•Mar 9, 2020•1 citation

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

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

Benchmarking Quantum(-Inspired) Annealing Hardware on Practical Use Cases

Tian Huang, Jun Xu, Tao Luo +3 more

Quantum(-inspired) annealers show promise in solving combinatorial optimisation problems in practice. There has been extensive researches demonstrating the utility of D-Wave quantum annealer and quantum-inspired annealer, i.e., Fujitsu Digital Annealer on various applications, but few works are comparing these platforms. In this paper, we benchmark quantum(-inspired) annealers with three combinatorial optimisation problems ranging from generic scientific problems to complex problems in practical use. In the case where the problem size goes beyond the capacity of a quantum(-inspired) computer, we evaluate them in the context of decomposition. Experiments suggest that both annealers are effective on problems with small size and simple settings, but lose their utility when facing problems in practical size and settings. Decomposition methods extend the scalability of annealers, but they are still far away from practical use. Based on the experiments and comparison, we discuss the advantages and limitations of quantum(-inspired) annealers, as well as the research directions that may improve the utility and scalability of the these emerging computing technologies.

arXiv:2203.02325•IEEE Transactions on Computers•Nov 3, 2022•30 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

A Reality Check on Quantum Optimisation: Evidence from an Industrial Case Study

Hila Safi, Karen Wintersperger, Oliver von Sicard +2 more

Quantum Processing Units promise speed-ups for selected computational problems, including combinatorial optimisation, but their industrial utility remains an open challenge. We study an industrial variant of the Job-Shop Scheduling Problem using quantum, quantum-inspired, and classical methods across three platforms: IBM Quantum, the D-Wave Quantum Annealer, and the Fujitsu Digital Annealer. By tailoring formulations to hardware-specific constraints, we show that hardware-software co-design is essential for solution quality and scalability. We benchmark all approaches against an exact classical solver and a MILP formulation, evaluating runtime, solution quality, and scalability. Our results indicate that quantum and quantum-inspired optimisation can support industrial solver selection, integration in classical workflows, modelling decisions, and early proof-of-concept development, while suggesting a potential path towards improved approximations for industrial scheduling.

cs.ARCross-listedarXiv:2607.13325•Jul 16, 2026•1 citation
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.
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.
Quantum(-inspired) annealers show promise in solving combinatorial optimisation problems in practice. There has been extensive researches demonstrating the utility of D-Wave quantum annealer and quantum-inspired annealer, i.e., Fujitsu Digital Annealer on various applications, but few works are comparing these platforms. In this paper, we benchmark quantum(-inspired) annealers with three combinatorial optimisation problems ranging from generic scientific problems to complex problems in practical use. In the case where the problem size goes beyond the capacity of a quantum(-inspired) computer, we evaluate them in the context of decomposition. Experiments suggest that both annealers are effective on problems with small size and simple settings, but lose their utility when facing problems in practical size and settings. Decomposition methods extend the scalability of annealers, but they are still far away from practical use. Based on the experiments and comparison, we discuss the advantages and limitations of quantum(-inspired) annealers, as well as the research directions that may improve the utility and scalability of the these emerging computing technologies.
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.
Quantum Processing Units promise speed-ups for selected computational problems, including combinatorial optimisation, but their industrial utility remains an open challenge. We study an industrial variant of the Job-Shop Scheduling Problem using quantum, quantum-inspired, and classical methods across three platforms: IBM Quantum, the D-Wave Quantum Annealer, and the Fujitsu Digital Annealer. By tailoring formulations to hardware-specific constraints, we show that hardware-software co-design is essential for solution quality and scalability. We benchmark all approaches against an exact classical solver and a MILP formulation, evaluating runtime, solution quality, and scalability. Our results indicate that quantum and quantum-inspired optimisation can support industrial solver selection, integration in classical workflows, modelling decisions, and early proof-of-concept development, while suggesting a potential path towards improved approximations for industrial scheduling.