Results 1 to 10 of about 1,548 (65)
A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
Discrete Optimization, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Endre Boros, Peter L Hammer
exaly +3 more sources
Advanced Quantum TechnologiesABSTRACT This study formulates a novel, elevation‐aware Quadratic Unconstrained Binary Optimization (QUBO) model for multi‐vehicle route optimization that simultaneously reduces fuel consumption and traffic congestion. Candidate routes are generated using a gradient‐corrected Dijkstra algorithm, and route selection is optimized by ...
Tsubasa Suzuki, Takao Tomono
openaire +2 more sources
Privacy-Preserving Quantum Annealing for Quadratic Unconstrained Binary Optimization (QUBO) Problems
2024 IEEE International Conference on Quantum Computing and Engineering (QCE)8 pages, 3 figures, QCE ...
Sheng Zhong
exaly +3 more sources
PLOS ONE, 2022 The most advanced D-Wave Advantage quantum annealer has 5000+ qubits, however, every qubit is connected to a small number of neighbors. As such, implementation of a fully-connected graph results in an order of magnitude reduction in qubit count. To compensate for the reduced number of qubits, one has to rely on special heuristic software such as qbsolv,
Alexander Teplukhin +4 more
openaire +4 more sources
Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem [PDF]
, 2008 We show that the NP-hard quadratic unconstrained binary optimization (QUBO) problem on a graph $G$ can be solved using an adiabatic quantum computer that implements an Ising spin-1/2 Hamiltonian, by reduction through minor-embedding of $G$ in the quantum
Choi, Vicky
core +2 more sources
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 QUBO from its conventional Boolean presentation into an equivalent spin glass problem with coupled $\pm1$ spin variables exposed to a site-dependent external field. We find that in a widely used testbed for QUBO these fields tend to be rather large compared to the typical coupling and many spins in each optimal ...
openaire +3 more sources
Approximate Approximation on a Quantum Annealer
, 2020 Many problems of industrial interest are NP-complete, and quickly exhaust resources of computational devices with increasing input sizes. Quantum annealers (QA) are physical devices that aim at this class of problems by exploiting quantum mechanical ...
Feld, Sebastian +5 more
core +1 more source
Flight Gate Assignment with a Quantum Annealer [PDF]
, 2018 Optimal flight gate assignment is a highly relevant optimization problem from airport management. Among others, an important goal is the minimization of the total transit time of the passengers.
A Haghani +6 more
core +4 more sources
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management [PDF]
, 2018 We present the mapping of a class of simplified air traffic management (ATM) problems (strategic conflict resolution) to quadratic unconstrained boolean optimization (QUBO) problems.
Biswas, Rupak +8 more
core +2 more sources
QuASeR -- Quantum Accelerated De Novo DNA Sequence Reconstruction
, 2020 In this article, we present QuASeR, a reference-free DNA sequence reconstruction implementation via de novo assembly on both gate-based and quantum annealing platforms.
Al-Ars, Zaid +2 more
core +1 more source