Results 61 to 70 of about 3,222 (193)

Material‐Based Intelligence: Autonomous Adaptation and Embodied Computation in Physical Substrates

Advanced Intelligent Systems, Volume 8, Issue 5, May 2026.
This perspective formulates a unifying framework for Material‐Based Intelligence (MBI), defining the physical requirements for materials to achieve embodied action, active memory and embodied information processing through intrinsic nonequilibrium dynamics. The design of intelligent materials often draws parallels with the complex adaptive behaviors of
Vladimir A. Baulin, Rudolf M. Füchslin, Achille Giacometti, Helmut Hauser, Marco Werner   +4 more
wiley   +1 more source

End‐to‐End Portfolio Optimization with Hybrid Quantum Annealing

Advanced Quantum Technologies, Volume 9, Issue 4, April 2026.
This works presents a hybrid quantum‐classical framework for portfolio optimization that combines quantum assisted asset selection and rebalancing with classical weight allocation. The approach processes real market data, embeds it into Quadratic Unconstrained Binary Optimization formulations, and evaluates performance within a unified workflow ...
Sai Nandan Morapakula, Sangram Deshpande, Rakesh Yata, Rushikesh Ubale, Uday Wad, Kazuki Ikeda   +5 more
wiley   +1 more source

Mean field approximation for solving QUBO problems

PLOS ONE, 2022
The Quadratic Unconstrained Binary Optimization (QUBO) problem is NP-hard. Some exact methods like the Branch-and-Bound algorithm are suitable for small problems. Some approximations like stochastic simulated annealing for discrete variables or mean-field annealing for continuous variables exist for larger ones, and quantum computers based on the ...
Máté Tibor Veszeli, Gábor Vattay
openaire   +6 more sources

Reinforcement Learning-Based Formulations With Hamiltonian-Inspired Loss Functions for Combinatorial Optimization Over Graphs

IEEE Access
Quadratic Unconstrained Binary Optimization (QUBO) is a versatile approach used to represent a wide range of NP-hard Combinatorial Optimization (CO) problems through binary variables. The transformation of QUBO to an Ising Hamiltonian is recognized as an
Redwan Ahmed Rizvee, Raheeb Hassan, Md. Mosaddek Khan   +2 more
doaj   +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

Prime factorization using quantum annealing and computational algebraic geometry

, 2016
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gr\"obner bases. We present a novel scalable algorithm which combines the two approaches and leads to the factorization of all ...
Alghassi, Hedayat, Dridi, Raouf
core   +1 more source

PearSAN: A Machine Learning Method for Inverse Design Using Pearson Correlated Surrogate Annealing

Advanced Optical Materials, Volume 14, Issue 10, 13 March 2026.
A machine learning–assisted inverse design framework is introduced to overcome the curse of dimensionality in complex nanophotonic design problems. By leveraging Pearson‐correlated surrogate annealing (PearSAN) method within a generative latent space, rapid convergence toward optimal thermophotovoltaic metasurface designs is achieved, enabling precise ...
Michael Bezick, Blake A. Wilson, Vaishnavi Iyer, Yuheng Chen, Vladimir M. Shalaev, Sabre Kais, Alexander V. Kildishev, Brad Lackey, Alexandra Boltasseva   +8 more
wiley   +1 more source

Detecting Multiple Communities Using Quantum Annealing on the D-Wave System

, 2019
A very important problem in combinatorial optimization is partitioning a network into communities of densely connected nodes; where the connectivity between nodes inside a particular community is large compared to the connectivity between nodes belonging
Mniszewski, Susan M., Negre, Christian F. A., Ushijima-Mwesigwa, Hayato   +2 more
core   +1 more source

QUBOs

Abstract In previous chapters, we already came across an instance of a quadratic unconstrained binary optimization problem or QUBO for short. In this chapter, we will now widen our perspective on QUBOs as our major plot line in this book is that any QUBO can be solved by running a Hopfield net and that any problem that can be solved ...
Christian Bauckhage, Rafet Sifa
openaire   +1 more source

Qubit‐Efficient Quantum Local Search for Combinatorial Optimization

Advanced Quantum Technologies, Volume 9, Issue 3, March 2026.
We introduce a qubit‐efficient variational quantum algorithm for combinatorial optimization that adaptively uses from logarithmic to a linear number of qubits to implement quantum local search. The method encodes flip probabilities of spin groups into quantum amplitudes, enabling exploration of classically intractable neighborhoods while maintaining ...
Mikhail Podobrii, Viacheslav Kuzmin, Vladimir Voloshinov, Margarita Veshchezerova, Michael R. Perelshtein   +4 more
wiley   +1 more source