136 citations · 513 across the 37 of their papers we have counts for
4 papers · 2 filters
Posiform Planting: Generating QUBO Instances for Benchmarking
Georg Hahn, Elijah Pelofske, Hristo N. Djidjev
We are interested in benchmarking both quantum annealing and classical algorithms for minimizing Quadratic Unconstrained Binary Optimization (QUBO) problems. Such problems are NP-h…
Initial State Encoding via Reverse Quantum Annealing and h-gain Features
Elijah Pelofske, Georg Hahn, Hristo Djidjev
Quantum annealing is a specialized type of quantum computation that aims to use quantum fluctuations in order to obtain global minimum solutions of combinatorial optimization probl…
Quantum annealing with inequality constraints: the set cover problem
Hristo N. Djidjev
This paper presents two novel approaches for solving the set cover problem (SCP) with multiple inequality constraints on quantum annealers. The first method uses the augmented Lagr…
Logical qubit implementation for quantum annealing: augmented Lagrangian approach
Hristo N. Djidjev
Solving optimization problems on quantum annealers usually requires each variable of the problem to be represented by a connected set of qubits called a logical qubit or a chain. C…