Matches in SemOpenAlex for { <https://semopenalex.org/work/W4367053938> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W4367053938 abstract "<p>The main disadvantage of calculations on quantum computers is their non-determinism. For optimization problems, of course, it is possible to get surprisingly good results but without a guarantee of the actual optimality of the result, i.e, an assurance that there exists no better solution which could potentially be found by the quantum machine. In this paper, we propose an novel approach that provides such a guarantee of optimality. We generate a solution that is optimal in the strict mathematical sense, without probabilistic considerations. To accomplish this, we use the D-Wave quantum machine working as a sampler implementing quantum annealing -- an approach considered a hardware metaheuristic -- to obtain upper and lower bounds on the value of the objective function of the problem under consideration. Then, we use the Branch and Bound scheme controlled by quantum annealing. This allows us to obtain very quickly -- in constant time -- the boundaries of the considered subproblems. Our approach is a combination of calculations realized on a quantum machine controlled by procedures implemented on a classical computer, allowing us to generate optimal solutions to the NP-hard problems of task scheduling on a single machine with a total weighted tardiness criterion. The proposed quantum algorithm shows a significant advantage over the classical CPU approach both in terms of calculation time and the number of generated solution tree nodes.</p>" @default.
- W4367053938 created "2023-04-27" @default.
- W4367053938 creator A5014055404 @default.
- W4367053938 creator A5016369928 @default.
- W4367053938 creator A5020169647 @default.
- W4367053938 creator A5028459441 @default.
- W4367053938 creator A5035266104 @default.
- W4367053938 creator A5058017032 @default.
- W4367053938 creator A5070679835 @default.
- W4367053938 date "2023-04-26" @default.
- W4367053938 modified "2023-09-30" @default.
- W4367053938 title "Optimal solving of a scheduling problem using quantum annealing metaheuristics on the D-Wave quantum solver" @default.
- W4367053938 doi "https://doi.org/10.36227/techrxiv.22677721.v1" @default.
- W4367053938 hasPublicationYear "2023" @default.
- W4367053938 type Work @default.
- W4367053938 citedByCount "0" @default.
- W4367053938 crossrefType "posted-content" @default.
- W4367053938 hasAuthorship W4367053938A5014055404 @default.
- W4367053938 hasAuthorship W4367053938A5016369928 @default.
- W4367053938 hasAuthorship W4367053938A5020169647 @default.
- W4367053938 hasAuthorship W4367053938A5028459441 @default.
- W4367053938 hasAuthorship W4367053938A5035266104 @default.
- W4367053938 hasAuthorship W4367053938A5058017032 @default.
- W4367053938 hasAuthorship W4367053938A5070679835 @default.
- W4367053938 hasBestOaLocation W43670539381 @default.
- W4367053938 hasConcept C109718341 @default.
- W4367053938 hasConcept C11413529 @default.
- W4367053938 hasConcept C121332964 @default.
- W4367053938 hasConcept C126255220 @default.
- W4367053938 hasConcept C126980161 @default.
- W4367053938 hasConcept C134306372 @default.
- W4367053938 hasConcept C137019171 @default.
- W4367053938 hasConcept C154945302 @default.
- W4367053938 hasConcept C206729178 @default.
- W4367053938 hasConcept C2778770139 @default.
- W4367053938 hasConcept C33923547 @default.
- W4367053938 hasConcept C41008148 @default.
- W4367053938 hasConcept C49937458 @default.
- W4367053938 hasConcept C62520636 @default.
- W4367053938 hasConcept C77553402 @default.
- W4367053938 hasConcept C84114770 @default.
- W4367053938 hasConcept C90408235 @default.
- W4367053938 hasConceptScore W4367053938C109718341 @default.
- W4367053938 hasConceptScore W4367053938C11413529 @default.
- W4367053938 hasConceptScore W4367053938C121332964 @default.
- W4367053938 hasConceptScore W4367053938C126255220 @default.
- W4367053938 hasConceptScore W4367053938C126980161 @default.
- W4367053938 hasConceptScore W4367053938C134306372 @default.
- W4367053938 hasConceptScore W4367053938C137019171 @default.
- W4367053938 hasConceptScore W4367053938C154945302 @default.
- W4367053938 hasConceptScore W4367053938C206729178 @default.
- W4367053938 hasConceptScore W4367053938C2778770139 @default.
- W4367053938 hasConceptScore W4367053938C33923547 @default.
- W4367053938 hasConceptScore W4367053938C41008148 @default.
- W4367053938 hasConceptScore W4367053938C49937458 @default.
- W4367053938 hasConceptScore W4367053938C62520636 @default.
- W4367053938 hasConceptScore W4367053938C77553402 @default.
- W4367053938 hasConceptScore W4367053938C84114770 @default.
- W4367053938 hasConceptScore W4367053938C90408235 @default.
- W4367053938 hasLocation W43670539381 @default.
- W4367053938 hasOpenAccess W4367053938 @default.
- W4367053938 hasPrimaryLocation W43670539381 @default.
- W4367053938 hasRelatedWork W1985522282 @default.
- W4367053938 hasRelatedWork W2284261663 @default.
- W4367053938 hasRelatedWork W2963048504 @default.
- W4367053938 hasRelatedWork W3095717826 @default.
- W4367053938 hasRelatedWork W3122964149 @default.
- W4367053938 hasRelatedWork W4280588714 @default.
- W4367053938 hasRelatedWork W4285891591 @default.
- W4367053938 hasRelatedWork W4298643526 @default.
- W4367053938 hasRelatedWork W4320802166 @default.
- W4367053938 hasRelatedWork W4321360004 @default.
- W4367053938 isParatext "false" @default.
- W4367053938 isRetracted "false" @default.
- W4367053938 workType "article" @default.