Results 181 to 190 of about 22,651 (215)

Annealed Mean Field Descent Is Highly Effective for Quadratic Unconstrained Binary Optimization

arXiv.org
In recent years, formulating various combinatorial optimization problems as Quadratic Unconstrained Binary Optimization (QUBO) has gained significant attention as a promising approach for efficiently obtaining optimal or near-optimal solutions.
Kyo Kuroki, Thiem Van Chu, Masato Motomura, Kazushi Kawamura   +3 more
semanticscholar   +1 more source

Systematic and Efficient Construction of Quadratic Unconstrained Binary Optimization Forms for High-order and Dense Interactions

Journal of the Physical Society of Japan
Quantum Annealing (QA) can efficiently solve combinatorial optimization problems whose objective functions are represented by Quadratic Unconstrained Binary Optimization (QUBO) formulations.
Hyakka Nakada, Shu Tanaka
semanticscholar   +1 more source

Solving Quadratic Unconstrained Binary Optimization with Collaborative Spiking Neural Networks

International Conference on Rebooting Computing, 2022
Quadratic Unconstrained Binary Optimization (QUBO) problem becomes an attractive and valuable optimization problem formulation in that it can easily transform into a variety of other combinatorial optimization problems such as Graph/number Partition, Max-
Yan Fang, A. Lele
semanticscholar   +1 more source

Multi-color ordering method for minimizing number of colors in quadratic unconstrained binary optimization formulation

2025 Thirteenth International Symposium on Computing and Networking Workshops (CANDARW)
The multi-coloring method can be formulated as a graph coloring problem, which is known to be NP-hard. In this study, we solve the graph coloring problem using a quadratic unconstrained binary optimization (QUBO) formulation.
Tomohiro Suzuki
semanticscholar   +1 more source

High‐throughput FPGA implementation for quadratic unconstrained binary optimization

Concurrency and Computation, 2021
Quadratic unconstrained binary optimization (QUBO) is a combinatorial optimization problem. Since various NP‐hard problems such as the traveling salesman problem can be formulated as a QUBO instance, QUBO is used with a wide range of applications.
Hiroshi Kagawa, Yasuaki Ito, K. Nakano, Ryota Yasudo, Yuya Kawamata, Ryota Katsuki, Yusuke Tabata, Takashi Yazane, Kenichiro Hamano   +8 more
semanticscholar   +1 more source

Effectively encoding satisfiability problems into quadratic unconstrained binary optimization models for quantum computing

Int. J. Parallel Emergent Distributed Syst.
Quadratic Unconstrained Binary Optimization (QUBO) models, defined by quadratic objective functions involving multiple binary variables, enable the search for optimal or near-optimal solutions to satisfiability problems through quantum mechanics. However,
Xiaotian Li, Shunsuke Tsukiyama, Koji Nakano, Victor Parque, Yasuaki Ito, Takumi Kato, Yuya Kawamata, Kaiki Ii   +7 more
semanticscholar   +1 more source

Neural Quantum Annealing for Real-World Quadratic Unconstrained Binary Optimization

International Conference on Quantum Computing and Engineering
We simulate Quantum Annealing on a variational manifold defined by a parametric family of wavefunctions represented by a Restricted Boltzmann Machine architecture. By iteratively lowering the transverse field and optimizing the neural network parameters,
Pietro Torta, Luca Leone, Rebecca Casati, Enrico Prati   +3 more
semanticscholar   +1 more source

Privacy-Preserving Quantum Annealing for Quadratic Unconstrained Binary Optimization (QUBO) Problems

International Conference on Quantum Computing and Engineering
Quantum annealers offer a promising approach to solve Quadratic Unconstrained Binary Optimization (QUBO) problems, which have a wide range of applications.
Moyang Xie, Yuan Zhang, Sheng Zhong, Qun Li   +3 more
semanticscholar   +1 more source

A3TUM: Automated Tabu Tenure Tuning by Unique Move for Quadratic Unconstrained Binary Optimization

GECCO Companion
Tabu search is one of the promising solving methods for quadratic unconstrained binary problem (QUBO). A critical parameter of tabu search is tabu tenure, which balances the behavior of the solver between greedy and exploratory.
Masahiko Sugimura, Matthieu Parizy
semanticscholar   +1 more source

Decoding of Polar Codes Using Quadratic Unconstrained Binary Optimization

IEEE Journal on Selected Areas in Communications
Polar codes encounter challenges in decoder complexity while preserving good error-correction properties. Instead of conventional decoders, a quantum annealer (QA) decoder has been proposed to explore untapped possibilities. For future QA applications, a
Huayi Zhou, Ryan Seah, Marwan Jalaleddine, Warren J. Gross   +3 more
semanticscholar   +1 more source