Results 91 to 100 of about 3,222 (193)
Isomer search or molecule enumeration refers to the problem of finding all the isomers for a given molecule. Many classical search methods have been developed in order to tackle this problem.
Jason P Terry +3 more
doaj +1 more source
The calibration of suspension geometry involves highly nonlinear kinematic relationships and leads to challenging optimization landscapes that are difficult to explore efficiently with classical local methods. Quadratic Unconstrained Binary Optimization (
Muhammad Waqas Arshad +4 more
doaj +1 more source
Track clustering with a quantum annealer for primary vertex reconstruction at hadron colliders
Clustering of charged particle tracks along the beam axis is the first step in reconstructing the positions of hadronic interactions, also known as primary vertices, at hadron collider experiments.
Das, Souvik +3 more
core
A Simple QUBO Formulation of Sudoku
This article describes how to solve Sudoku puzzles using Quadratic Unconstrained Binary Optimization (QUBO). To this end, a QUBO instance with 729 variables is constructed, encoding a Sudoku grid with all constraints in place, which is then partially assigned to account for clues.
openaire +2 more sources
A QUBO Formulation for Qubit Allocation
17 pages, 15 figures; updated some figures for ...
Dury, Bryan, Di Matteo, Olivia
openaire +2 more sources
Quantum Compressed Sensing Tomographic Reconstruction Algorithm
Computed tomography (CT) is a nondestructive technique for observing internal images and has proven highly valuable in medical diagnostics. Recent advances in quantum computing have begun to influence tomographic reconstruction techniques.
Arim Ryou, Kiwoong Kim, Kyungtaek Jun
doaj +1 more source
Quantum computer based feature selection in machine learning
The problem of selecting an appropriate number of features in supervised learning problems is investigated. Starting with common methods in machine learning, the feature selection task is treated as a quadratic unconstrained optimisation problem (QUBO ...
Gerhard Hellstern +2 more
doaj +1 more source
We introduce a method for solving a quadratic unconstrained binary optimization (QUBO) with the two-way one-hot constraints by dividing the QUBO into parts and solving it with an Ising machine.
Akihiro Yatabe, Akihiro Yatabe
doaj +1 more source
Most Frequent Itemset Optimization
In this paper we are dealing with the frequent itemset mining. We concentrate on the special case that we only want to identify the most frequent itemset of length N.
Nüßlein, Jonas
core
Hybrid subQUBO Annealing With a Correction Process for Multi-Day Intermodal Trip Planning
The multi-day intermodal trip planning problem (MITPP) is an optimization problem that seeks to create the optimal route to visit Point-of-Interest (POI) and hotels over days. This problem involves coordinating intermodal transportation, such as walking,
Tatsuya Noguchi +3 more
doaj +1 more source

