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

Fujitsu Scientific and Technical Journal

Application of Digital Annealer for Faster Combinatorial Optimization

Sao Masataka, Hiroyuki Watanabe, Musha Yuuichi, Utsunomiya Akihiro

Published Jan 1, 2019• 32 citations
OpenAlex

Related papers

Digital Annealer Technology to Solve Real-world Combinatorial Optimization Problems

一矢 竹本, 松原 聡, 宮澤俊之 +3 more

電子情報通信学会誌•Mar 1, 2020•0 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

Mathematical Aspects of the Digital Annealer’s Simulated Annealing Algorithm

Bruno Hideki Fukushima-Kimura, Noe Kawamoto, Eitaro Noda +1 more

arXiv:2303.08392•Journal of Statistical Physics•Nov 24, 2023•9 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

Quantum Annealing Implementation for Optimization Problems

U Kanade

Presented in this paper is the theory and practical implementation of quantum annealing for project scheduling and resource-allocation tasks that can be mapped to Ising or Quadratic Unconstrained Binary Optimization (QUBO) models. Quantum annealing is a meta-heuristic that exploits quantum tunnelling to search the energy landscape of combinatorial optimization problems. The Quantum Annealing Process Flowchart is detailed stage by stage. Hybrid quantum-classical workflows that embed annealing inside a Monte Carlo or digital-twin loop are described, together with supporting figures of the energy landscape and the hybrid architecture. Cross-domain analogies with ULD configuration and related combinatorial problems illustrate transferability. The paper concludes with implementation considerations and the current maturity of the technology for construction and logistics applications. Keywords: quantum annealing implementation; Ising model; QUBO; combinatorial optimization; project scheduling; hybrid quantum-classical; energy landscape; digital twin; Monte Carlo; supply-chain resilience; ULD configuration

International Journal of Creative and Open Research in Engineering and Management•Aug 7, 2026•0 citations

Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis

Oylum Şeker, Neda Tanoumand, Merve Bodur

arXiv:2012.12264•Applied Soft Computing•Jul 26, 2022•29 citations
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.
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.
Presented in this paper is the theory and practical implementation of quantum annealing for project scheduling and resource-allocation tasks that can be mapped to Ising or Quadratic Unconstrained Binary Optimization (QUBO) models. Quantum annealing is a meta-heuristic that exploits quantum tunnelling to search the energy landscape of combinatorial optimization problems. The Quantum Annealing Process Flowchart is detailed stage by stage. Hybrid quantum-classical workflows that embed annealing inside a Monte Carlo or digital-twin loop are described, together with supporting figures of the energy landscape and the hybrid architecture. Cross-domain analogies with ULD configuration and related combinatorial problems illustrate transferability. The paper concludes with implementation considerations and the current maturity of the technology for construction and logistics applications. Keywords: quantum annealing implementation; Ising model; QUBO; combinatorial optimization; project scheduling; hybrid quantum-classical; energy landscape; digital twin; Monte Carlo; supply-chain resilience; ULD configuration