Results 161 to 170 of about 3,222 (193)

The neurobench framework for benchmarking neuromorphic computing algorithms and systems. [PDF]

Nat Commun
Yik J, Van den Berghe K, den Blanken D, Bouhadjar Y, Fabre M, Hueber P, Ke W, Khoei MA, Kleyko D, Pacik-Nelson N, Pierro A, Stratmann P, Sun PV, Tang G, Wang S, Zhou B, Ahmed SH, Vathakkattil Joseph G, Leto B, Micheli A, Mishra AK, Lenz G, Sun T, Ahmed Z, Akl M, Anderson B, Andreou AG, Bartolozzi C, Basu A, Bogdan P, Bohte S, Buckley S, Cauwenberghs G, Chicca E, Corradi F, de Croon G, Danielescu A, Daram A, Davies M, Demirag Y, Eshraghian J, Fischer T, Forest J, Fra V, Furber S, Furlong PM, Gilpin W, Gilra A, Gonzalez HA, Indiveri G, Joshi S, Karia V, Khacef L, Knight JC, Kriener L, Kubendran R, Kudithipudi D, Liu SC, Liu YH, Ma H, Manohar R, Margarit-Taulé JM, Mayr C, Michmizos K, Muir DR, Neftci E, Nowotny T, Ottati F, Ozcelikkale A, Panda P, Park J, Payvand M, Pehle C, Petrovici MA, Posch C, Renner A, Sandamirskaya Y, Schaefer CJS, van Schaik A, Schemmel J, Schmidgall S, Schuman C, Seo JS, Sheik S, Shrestha SB, Sifalakis M, Sironi A, Stewart K, Stewart M, Stewart TC, Timcheck J, Tömen N, Urgese G, Verhelst M, Vineyard CM, Vogginger B, Yousefzadeh A, Zohora FT, Frenkel C, Reddi VJ.   +99 more
europepmc   +1 more source

Solving the resource constrained project scheduling problem with quantum annealing. [PDF]

Sci Rep
Pérez Armas LF, Creemers S, Deleplanque S.   +2 more
europepmc   +1 more source

Pattern QUBOs: Algorithmic Construction of 3SAT-to-QUBO Transformations

Electronics (Switzerland), 2023
One way of solving 3sat instances on a quantum computer is to transform the 3sat instances into instances of Quadratic Unconstrained Binary Optimizations (QUBOs), which can be used as an input for the QAOA algorithm on quantum gate systems or as an input for quantum annealers. This mapping is performed by a 3sat-to-QUBO transformation. Recently, it has
Sebastian Zielinski, Jonas Nüßlein, Jonas Stein   +2 more
exaly   +5 more sources

Optimum-preserving QUBO parameter compression

Quantum Machine Intelligence
Abstract Quadratic unconstrained binary optimization (QUBO) problems are well-studied, not least because they can be approached using contemporary quantum annealing or classical hardware acceleration. However, due to limited precision and hardware noise, the effective set of feasible parameter values is severely restricted.
Sascha Mücke, Nico Piatkowski
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

QUBO formulations of the longest path problem

Theoretical Computer Science, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joey McCollum, Thomas Krauss
openaire   +1 more source

QUBO++: A C++ Library for Developing and Solving QUBO Problems

2025 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
Koji Nakano, Shunsuke Tsukiyama, Yasuaki Itô   +2 more
exaly   +2 more sources

Solving QUBO with GPU parallel MOPSO

Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2021
The Quadratic Unconstrained Binary Optimization problem (QUBO) is an NP-hard optimization problem. QUBO can be reduced from many other combinatorial optimization problems. Hence, if we can solve QUBO, we can also solve many other problems. The paper proposes a novel method to solve QUBO by reducing it into the Bi-objective Bound-constrained Continuous ...
Noriyuki Fujimoto, Kouki Nanai
openaire   +1 more source

On the State of QUBO Solving

Lecture notes in operations research
Thorsten Koch, Daniel Rehfeldt, Yuji Shinano   +2 more
exaly   +2 more sources

Learning QUBO Formulations from Data

Communications in Computer and Information Science
Jonas Nüßlein, Sebastian Zielinski, Claudia Linnhoff-Popien   +2 more
exaly   +2 more sources

On the QUBO formulation of the Hamiltonian cycle problem

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences
Abstract Combinatorial problems pose significant challenges, especially for large-scale instances. A promising approach to addressing these challenges involves quadratic unconstrained binary optimization (QUBO) models, a key framework in quantum computing.
Durbec, Amelia, El Yaagoubi, Amina, Deleplanque, Samuel   +2 more
openaire   +3 more sources