Results 11 to 20 of about 108,734 (233)

A robustification approach in unconstrained quadratic optimization [PDF]

Mathematical Programming, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bernauer, Martin K., Griesse, Roland
openaire   +3 more sources

Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization [PDF]

International Conference on Conceptual Structures, 2023
We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum approximate optimization algorithm (QAOA). Our approach requires fewer couplings and fewer physical qubits than the current state-of-the-art, which results in higher ...
Jonas Nüßlein, Sebastian Zielinski, Thomas Gabor, Claudia Linnhoff-Popien, Sebastian Feld   +4 more
openaire   +3 more sources

Quadratic Unconstrained Binary Optimization via Quantum-Inspired Annealing [PDF]

Physical Review Applied, 2022
We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. The algorithm can be seen as an analogue of quantum annealing under the restriction of a product state space, where the dynamical evolution in quantum annealing is replaced with a gradient-descent based method. This formulation is
Bowles, Joseph, Dauphin, Alexandre, Huembeli, Patrick, Martinez, José, Acín, Antonio   +4 more
openaire   +3 more sources

Recursive subspace identification based on instrumental variable unconstrained quadratic optimization [PDF]

International Journal of Adaptive Control and Signal Processing, 2004
AbstractThe problem of the recursive formulation of the MOESP class of subspace identification algorithms is considered and two novel instrumental variable approaches are introduced. The first one leads to an RLS‐like implementation, the second to a gradient type iteration.
Mercère, Guillaume, Lecoeuche, Stéphane, Lovera, Marco   +2 more
openaire   +5 more sources

Rydberg‐Atom Graphs for Quadratic Unconstrained Binary Optimization Problems [PDF]

Advanced Quantum Technologies, 2023
Abstract There is a growing interest in harnessing the potential of the Rydberg‐atom system to address complex combinatorial optimization challenges. Here an experimental demonstration of how the quadratic unconstrained binary optimization (QUBO) problem can be effectively addressed using Rydberg‐atom graphs is presented.
Andrew Byun, Junwoo Jung, Kangheun Kim, Minhyuk Kim, Seokho Jeong, Heejeong Jeong, Jaewook Ahn   +6 more
openaire   +3 more sources

Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer [PDF]

Frontiers in Physics, 2019
The Fujitsu Digital Annealer is designed to solve fully connected quadratic unconstrained binary optimization (QUBO) problems. It is implemented on application-specific CMOS hardware and currently solves problems of up to 1,024 variables.
Maliheh Aramon, Gili Rosenberg, Elisabetta Valiante, Toshiyuki Miyazawa, Hirotaka Tamura, Helmut G. Katzgraber, Helmut G. Katzgraber, Helmut G. Katzgraber   +7 more
doaj   +2 more sources

On some features of quadratic unconstrained binary optimization with random coefficients [PDF]

Bollettino dell'Unione Matematica Italiana
Abstract Quadratic Unconstrained Binary Optimization (QUBO or UBQP) is concerned with maximizing/minimizing the quadratic form $$H(J, \eta ) = W \sum _{i,j} J_{i,j} \eta _{i} \eta _{j}$$ H ...
Isopi, Marco, Scoppola, Benedetto, Troiani, Alessio   +2 more
openaire   +6 more sources

Digital Annealer for quadratic unconstrained binary optimization: A comparative performance analysis [PDF]

Applied Soft Computing, 2022
Digital Annealer (DA) is a computer architecture designed for tackling combinatorial optimization problems formulated as quadratic unconstrained binary optimization (QUBO) models. In this paper, we present the results of an extensive computational study to evaluate the performance of DA in a systematic way in comparison to multiple state-of-the-art ...
Oylum Şeker, Neda Tanoumand, Merve Bodur   +2 more
openaire   +3 more sources

Speedup of high-order unconstrained binary optimization using quantum $${{\mathbb{Z}}}_{2}$$ Z 2 lattice gauge theory

Communications Physics
An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has ...
Bi-Ying Wang, Xiaopeng Cui, Qingguo Zeng, Yemin Zhan, Man-Hong Yung, Yu Shi   +5 more
doaj   +2 more sources

Left-deep join order selection with higher-order unconstrained binary optimization on quantum computers

Frontiers in Computer Science
Join order optimization is among the most crucial query optimization problems, and its central position is also evident in the new research field where quantum computing is applied to database optimization and data management.
Valter Uotila
doaj   +2 more sources