Results 31 to 40 of about 2,742,325 (160)

A computational study of Ising‐based solvers for discrete landscape exploration in process optimization

AIChE Journal, EarlyView.
ABSTRACT Conceptual process design combines discrete configuration choices with continuous operating decisions, often yielding difficult mixed‐integer nonlinear or simulation‐based optimization problems. This work presents an exploratory computational assessment of Ising‐based solvers, simulated annealing, quantum annealing, and entropy computing, as ...
Yirang Park, David E. Bernal Neira
wiley   +1 more source

Quantum image denoising: a framework via Boltzmann machines, QUBO, and quantum annealing

Frontiers in Computer Science, 2023
We investigate a framework for binary image denoising via restricted Boltzmann machines (RBMs) that introduces a denoising objective in quadratic unconstrained binary optimization (QUBO) form well-suited for quantum annealing.
Phillip Kerger, Phillip Kerger, Phillip Kerger, Ryoji Miyazaki, Ryoji Miyazaki   +4 more
doaj   +1 more source

Factorization Machine with Iterative Quantum Reverse Annealing: A Python Package for Batch Black‐Box Optimization With Reverse Quantum Annealing

Advanced Intelligent Discovery, EarlyView.
Factorization machine with iterative quantum reverse annealing (FMIRA) leverages quantum reverse annealing to perform batch black‐box optimization. Factorization machine with quantum annealing (FMQA) is a widely used python package for solving black‐box optimization problems using D‐Wave quantum annealers.
Andrejs Tučs, Ryo Tamura, Koji Tsuda
wiley   +1 more source

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

Advanced Intelligent Discovery, EarlyView.
Active learning (AL) strategies are benchmarked for the binary design of planar multilayer nanophotonic structures. Factorization machines combined with quantum annealing (QA) become effective as dimensionality increases. Hybrid QA provides the strongest results for 100‐layer problems, highlighting the importance of optimization method selection in ...
Serang Jung, Seongmin Kim, Jaehyun Park, Chaeyoung Park, Zhihao Xu, Sanghyo Hwang, Baiqing Ye, Youn sang Kim, Sun‐Kyung Kim, Tengfei Luo, Eungkyu Lee   +10 more
wiley   +1 more source

Solving the Traveling Salesman Problem on the D-Wave Quantum Computer

Frontiers in Physics, 2021
The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem ...
Siddharth Jain
doaj   +1 more source

A Scalable and Resource‐Efficient Pipelined p‐Computer for Probabilistic Ising Machines

Advanced Intelligent Systems, EarlyView.
(a) Block diagram of the portfolio optimization problem: given M assets, the goal is to determine the optimal weights w that maximize the expected return (based on the mean historical assets return u), while minimizing the risk, quantified by the assets covariance matrix S.
Deborah Volpe, Eleonora Raimondo, Andrea Grimaldi, Pedram Khalili Amiri, Stefano Chiappini, Anna Giordano, Mario Carpentieri, Hyunsoo Yang, Massimo Chiappini, Giovanni Finocchio   +9 more
wiley   +1 more source

Trip Planning Based on subQUBO Annealing

IEEE Access, 2023
The trip planning problem (TPP) can be formulated as a combinatorial optimization problem that searches for the best route to visit a series of landmarks and hotels.
Tatsuya Noguchi, Keisuke Fukada, Siya Bao, Nozomu Togawa   +3 more
doaj   +1 more source

Establishing Shape Correspondences: A Survey

Computer Graphics Forum, EarlyView.
Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley   +1 more source

Quadratic and Higher-Order Unconstrained Binary Optimization of Railway Rescheduling for Quantum Computing [PDF]

, 2022
As consequences of disruptions in railway traffic affect passenger experience/satisfaction, appropriate rerouting and/or rescheduling is necessary. These problems are known to be NP-hard, given the numerous restrictions of traffic nature. With the recent
Krawiec, Krzysztof, Salehi, Özlem, Kundu, Akash, Domino, Krzysztof   +3 more
core   +1 more source

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

Advanced Intelligent Discovery, Volume 2, Issue 5, October 2026.
This work investigates the optimal initial data size for surrogate‐based active learning in functional material optimization. Using factorization machine (FM)‐based quadratic unconstrained binary optimization (QUBO) surrogates and averaged piecewise linear regression, we show that adequate initial data accelerates convergence, enhances efficiency, and ...
Seongmin Kim, In‐Saeng Suh
wiley   +1 more source