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

arXiv:2303.08392 · Journal of Statistical Physics

Mathematical Aspects of the Digital Annealer’s Simulated Annealing Algorithm

Bruno Hideki Fukushima-Kimura, Noe Kawamoto, Eitaro Noda, Akira Sakai

Published Nov 24, 2023• 9 citations
arXivHTMLPDF
DOI
10.1007/s10955-023-03179-3

Related papers

APPLYING QUANTUM SEARCH TO AUTOMATED TEST PATTERN GENERATION FOR VLSI CIRCUITS

Amardeep S. G. Singh, Sarbjeet Singh

This paper presents a quantum search algorithm for Automated Test Pattern Generation (ATPG) of VLSI circuits. For given digital circuits, a neural network is created that represents the digital gates with their interconnections as neurons. This neural network is characterized by an energy function E, which is the mathematics representation of neural network. The solution of the energy function gives us the test vector. The test vector is a combination of input values of digital circuits that detects a particular fault. In this paper, specific aspects of quantum theory like superposition and quantum parallelism are applied to find the solution of this energy function. The algorithm developed is so efficient that it requires only [Formula: see text] (where N is the total number of vectors) iterations to find the desired test vector whereas in classical computing, it takes N/2 iterations. At the end, a comparison is made between exhaustive, simulated annealing and quantum based techniques. Experimental results show that the quantum search algorithms are more efficient than classical algorithms and can be applied with more efficiency.

International Journal of Quantum Information•Mar 1, 2003•5 citations

Application of Digital Annealer for Faster Combinatorial Optimization

Sao Masataka, Hiroyuki Watanabe, Musha Yuuichi +1 more

Fujitsu Scientific and Technical Journal•Jan 1, 2019•32 citations

Optimizing Human Resource Allocation in Long-Term Care Using Quantum and Digital Annealing

Chia‐Ho Ou, Jhih-Ying Chen, Wun-Ci Cao +3 more

This study proposes a Quadratic Unconstrained Binary Optimization (QUBO) optimization model for scheduling home care workers in long-term care services. The Simulated Annealing (SA) algorithm, D-Wave Hybrid quantum annealer, Compal Quantix digital annealer, and Fujitsu DA3 digital annealer are conducted for performance evaluations on the proposed model. Experimental results show that the Compal Quantix and Fujitsu DA3 digital annealers significantly reduce the commuting distance of home care workers for optimizing human resource allocation more effectively than other schemes.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•3 citations

Digital Annealer Technology to Solve Real-world Combinatorial Optimization Problems

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

電子情報通信学会誌•Mar 1, 2020•0 citations

Digital Annealing with Parallel Flip Dynamics

George Higgins Hutchinson, Tinish Bhattacharya, Arne Heittmann +1 more

Digital Annealing (DA) is an enhancement of the simulated annealing (SA) algorithm, achieved through a paralleltrial update scheme that boosts the flip acceptance rate, and a dynamic escape mechanism that helps overcome narrow energy barriers. In each parallel-trial iteration of the DA algorithm, every variable of the problem is independently proposed ("tried") for a flip. If any such candidate flips are accepted, a single candidate flip is then selected at random and applied. The primary contribution of this work is an improvement of the DA algorithm through parallel-flip dynamics, in which multiple candidate variable flips are applied within a single parallel-trial iteration. By utilizing computations of a parallel-trial scheme more efficiently, the enhanced algorithm exhibits faster convergence and a more favorable scaling exponent with respect to the number of parallel-trial iterations. This is demonstrated by benchmarking uniform random-SAT problems, where the algorithm outperforms other local search methods. To further motivate these results, we show that the proposed algorithm is well-suited for an efficient implementation on recently developed in-memory-computing parallel-gradient hardware, highlighting its potential for next-generation optimization solver accelerators.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Oct 26, 2025•0 citations

Comparison of quantum annealing and simulated annealing

Hidetoshi Nishimori

The European Physical Journal Special Topics•Feb 1, 2015•3 citations
This paper presents a quantum search algorithm for Automated Test Pattern Generation (ATPG) of VLSI circuits. For given digital circuits, a neural network is created that represents the digital gates with their interconnections as neurons. This neural network is characterized by an energy function E, which is the mathematics representation of neural network. The solution of the energy function gives us the test vector. The test vector is a combination of input values of digital circuits that detects a particular fault. In this paper, specific aspects of quantum theory like superposition and quantum parallelism are applied to find the solution of this energy function. The algorithm developed is so efficient that it requires only [Formula: see text] (where N is the total number of vectors) iterations to find the desired test vector whereas in classical computing, it takes N/2 iterations. At the end, a comparison is made between exhaustive, simulated annealing and quantum based techniques. Experimental results show that the quantum search algorithms are more efficient than classical algorithms and can be applied with more efficiency.
This study proposes a Quadratic Unconstrained Binary Optimization (QUBO) optimization model for scheduling home care workers in long-term care services. The Simulated Annealing (SA) algorithm, D-Wave Hybrid quantum annealer, Compal Quantix digital annealer, and Fujitsu DA3 digital annealer are conducted for performance evaluations on the proposed model. Experimental results show that the Compal Quantix and Fujitsu DA3 digital annealers significantly reduce the commuting distance of home care workers for optimizing human resource allocation more effectively than other schemes.
Digital Annealing (DA) is an enhancement of the simulated annealing (SA) algorithm, achieved through a paralleltrial update scheme that boosts the flip acceptance rate, and a dynamic escape mechanism that helps overcome narrow energy barriers. In each parallel-trial iteration of the DA algorithm, every variable of the problem is independently proposed ("tried") for a flip. If any such candidate flips are accepted, a single candidate flip is then selected at random and applied. The primary contribution of this work is an improvement of the DA algorithm through parallel-flip dynamics, in which multiple candidate variable flips are applied within a single parallel-trial iteration. By utilizing computations of a parallel-trial scheme more efficiently, the enhanced algorithm exhibits faster convergence and a more favorable scaling exponent with respect to the number of parallel-trial iterations. This is demonstrated by benchmarking uniform random-SAT problems, where the algorithm outperforms other local search methods. To further motivate these results, we show that the proposed algorithm is well-suited for an efficient implementation on recently developed in-memory-computing parallel-gradient hardware, highlighting its potential for next-generation optimization solver accelerators.