Results 11 to 20 of about 190,388 (322)
The birational composition of arbitrary quadratic form with binary quadratic form
Journal of the Belarusian State University. Mathematics and Informatics, 2022 Let f(X) and g(Y) be nondegenerate quadratic forms of dimensions m and n respectively over a field K, charK ≠ 2. Herein, the problem of the birational composition of f(X) and g(Y) is considered, namely, the condition is established when the product f(X)g(Y) is birationally equivalent over K to a quadratic form h(Z) over K of dimension m + n?
Alexandr A. Bondarenko
openaire +3 more sources
Efficient optimization accelerator framework for multi-state spin Ising problems [PDF]
Nature CommunicationsIsing Machines are emerging hardware architectures that efficiently solve NP-hard combinatorial optimization problems. Generally, combinatorial problems are transformed into quadratic unconstrained binary optimization (QUBO) form, but this transformation
Chirag Garg, Sayeef Salahuddin
doaj +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 +4 more
doaj +1 more source
Supercongruences involving Apéry-like numbers and binomial coefficients
AIMS Mathematics, 2022 Let $ \{S_n\} $ be the Apéry-like sequence given by $ S_n = \sum_{k = 0}^n\binom nk\binom{2k}k\binom{2n-2k}{n-k} $. We show that for any odd prime $ p $, $ \sum_{n = 1}^{p-1}\frac {nS_n}{8^n}{\equiv} (1-(-1)^{\frac{p-1}2})p^2\ (\text{ mod}\ {p^3}) $. Let
Zhi-Hong Sun
doaj +1 more source
Algorithms, 2023 Quadratic unconstrained binary optimization (QUBO) is a classic NP-hard problem with an enormous number of applications. Local search strategy (LSS) is one of the most fundamental algorithmic concepts and has been successfully applied to a wide range of ...
Bahram Alidaee, Haibo Wang, Lutfu S. Sua
doaj +1 more source
IET Control Theory & Applications, 2021 This paper concentrates on the stability problem of systems with two additive time‐varying delay components. For the construction of Lyapunov–Krasovskii functional (LKF), in the case that the introduced augmented vector contains the double integral term ...
Meng Liu, Yong He, Lin Jiang
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 +4 more
doaj +1 more source
An elegant scheme of self-testing for multipartite Bell inequalities
npj Quantum Information, 2023 Self-testing is the most accurate form of certification of quantum devices. While self-testing in bipartite Bell scenarios has been thoroughly studied, self-testing in the more complex multipartite Bell scenarios remains largely unexplored.
Ekta Panwar +2 more
doaj +1 more source
A Symbolic Approach to Discrete Structural Optimization Using Quantum Annealing
Mathematics, 2023 With the advent of novel quantum computing technologies and the new possibilities thereby offered, a prime opportunity has presented itself to investigate the practical application of quantum computing.
Kevin Wils, Boyang Chen
doaj +1 more source
Individual subject evaluated difficulty of adjustable mazes generated using quantum annealing
Frontiers in Computer Science, 2023 In this study, the maze generation using quantum annealing is proposed. We reformulate a standard algorithm to generate a maze into a specific form of a quadratic unconstrained binary optimization problem suitable for the input of the quantum annealer ...
Yuto Ishikawa +5 more
doaj +1 more source