Results 21 to 30 of about 22,651 (215)

Analysis of the relation between quadratic unconstrained binary optimization and the spin-glass ground-state problem [PDF]

Physical Review Research, 2019
We analyze the transformation of quadratic unconstrained binary optimization (QUBO) from its conventional Boolean presentation into an equivalent spin-glass problem with coupled ±1 spin variables exposed to a site-dependent external field.
Stefan Boettcher
doaj   +2 more sources

Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization

Computer Science Research Notes
Quantum algorithms have shown promise in solving Quadratic Unconstrained Binary Optimization (QUBO) problems, benefiting from their connection to the transverse field Ising model.
Zedong Peng, Daniel de Roux, David E. Bernal Neira   +2 more
openalex   +2 more sources

Support vector machine based on the quadratic unconstrained binary optimization model

Journal of Physics: Conference Series
Support vector machine (SVM) is a powerful supervised machine learning model that is often used in binary classification algorithms. As Moore’s Law approaches its theoretical limits and the demand for machine learning to handle large-scale, high ...
Qiwei Wang
openalex   +2 more sources

Generating hard quadratic unconstrained binary optimization instances via the method of combining bit reduction and duplication technique [PDF]

Int. J. Parallel Emergent Distributed Syst.
Quadratic Unconstrained Binary Optimization (QUBO) is a combinatorial optimization problem defined by an energy function that consists of a quadratic formula involving multiple binary variables.
X. H. Li, Koji Nakano, Shunsuke Tsukiyama, Yasuaki Ito, Takumi Kato, Yuya Kawamata   +5 more
openalex   +2 more sources

Warm start of variational quantum algorithms for quadratic unconstrained binary optimization problems

EPJ Quantum Technology
Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random parameter initialization. In this work, we propose a warm start method inspired by
Yahui Chai, Karl Jansen, Stefan Kühn, Tim Schwägerl, Tobias Stollenwerk   +4 more
openalex   +2 more sources

Parity Quantum Optimization: Compiler [PDF]

Quantum, 2023
We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures.
Kilian Ender, Roeland ter Hoeven, Benjamin E. Niehoff, Maike Drieb-Schön, Wolfgang Lechner   +4 more
doaj   +1 more source

Grover Adaptive Search for Constrained Polynomial Binary Optimization [PDF]

Quantum, 2021
In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case.
Austin Gilliam, Stefan Woerner, Constantin Gonciulea   +2 more
doaj   +1 more source

Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization [PDF]

, 2008
Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable problems.
Hartmut Neven, Geordie Rose, William G. Macready   +2 more
openalex   +4 more sources

A generic method of pose generation in molecular docking via quadratic unconstrained binary optimization [PDF]

Annals of computer science and information systems
Pei-Kun Yang, Jung-Hsin Lin
doaj   +2 more sources

Performance Comparison of Typical Binary-Integer Encodings in an Ising Machine

IEEE Access, 2021
The differences in performance among binary-integer encodings in an Ising machine, which can solve combinatorial optimization problems, are investigated.
Kensuke Tamura, Tatsuhiko Shirai, Hosho Katsura, Shu Tanaka, Nozomu Togawa   +4 more
doaj   +1 more source