Zobrazeno 1 - 10
of 458
pro vyhledávání: '"Tanaka, Shu"'
This paper presents an initialization method that can approximate a given approximate Ising model with a high degree of accuracy using the Factorization Machine (FM), a machine learning model. The construction of Ising models using FM is applied to t
Externí odkaz:
http://arxiv.org/abs/2410.12747
To tackle combinatorial optimization problems on an Ising machine, the objective function and constraints have to be mapped onto a quadratic unconstrained binary optimization (QUBO) model. Since the QUBO consists of binary variables when combinatoria
Externí odkaz:
http://arxiv.org/abs/2410.11198
In this study, we propose a new method for constrained combinatorial optimization using tensor networks. Combinatorial optimization methods employing quantum gates, such as quantum approximate optimization algorithm, have been intensively investigate
Externí odkaz:
http://arxiv.org/abs/2409.01699
Autor:
Couzinie, Yannick, Seki, Yuya, Nishiya, Yusuke, Nishi, Hirofumi, Kosugi, Taichi, Tanaka, Shu, Matsushita, Yu-ichiro
This study investigates the application of Factorization Machines with Quantum Annealing (FMQA) to address the crystal structure problem (CSP) in materials science. FMQA is a black-box optimization algorithm that combines machine learning with anneal
Externí odkaz:
http://arxiv.org/abs/2408.03556
Ising machines are expected to solve combinatorial optimization problems faster than the existing integer programming solvers. These problems, particularly those encountered in practical situations, typically involve inequality constraints. However,
Externí odkaz:
http://arxiv.org/abs/2406.01887
Publikováno v:
J. Phys. Soc. Jpn., Vol.92, No.12, 124002 (2023)
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines (non-quantum-type
Externí odkaz:
http://arxiv.org/abs/2306.06589
Publikováno v:
IEEE Access, vol. 11, pp. 95493-95506, 2023
Ising machines have attracted attention as efficient solvers for combinatorial optimization problems, which are formulated as ground-state (lowest-energy) search problems of the Ising model. Due to the limited bit-width of coefficients on Ising machi
Externí odkaz:
http://arxiv.org/abs/2304.12796
It is imperative to compile quantum circuits for Noisy Intermediate-Scale Quantum (NISQ) devices because of the limited connectivity of physical qubits and the high error rates of gate operations. One of the most critical steps in quantum circuit com
Externí odkaz:
http://arxiv.org/abs/2303.02830
Photonic-crystal surface-emitting lasers (PCSELs), which utilize a two-dimensional (2D) optical resonance inside a photonic crystal for lasing, feature various outstanding functionalities such as single-mode high-power operation and arbitrary control
Externí odkaz:
http://arxiv.org/abs/2209.11952