Rejection-Free Monte Carlo Simulation of QUBO and Lechner–Hauke–Zoller Optimization Problems
Many studies have attempted to develop simple and efficient methods for solving global optimization problems. Simulated annealing (SA) has been recognized as a powerful tool for performing this task. In this study, we implemented a rejection-free Monte Carlo (RFMC) algorithm, which is a kernel of re...
Saved in:
| Main Author: | Yoshihiro Nambu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2022-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9852216/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Quantum Computing in Community Detection for Anti-Fraud Applications
by: Yanbo (Justin) Wang, et al.
Published: (2024-11-01) -
Solving Flexible Job-Shop Scheduling Problems Based on Quantum Computing
by: Kaihan Fu, et al.
Published: (2025-02-01) -
Hybrid subQUBO Annealing With a Correction Process for Multi-Day Intermodal Trip Planning
by: Tatsuya Noguchi, et al.
Published: (2025-01-01) -
Computer-Aided Quantum Algorithms for Real-Time Energy Market Trading
by: Jinghui Wu, et al.
Published: (2025-01-01) -
Highly Versatile FPGA-Implemented Cyber Coherent Ising Machine
by: Toru Aonishi, et al.
Published: (2024-01-01)