3 citations · 3 across the 5 of their papers we have counts for
5 papers
Replication-based quantum annealing error mitigation
Hristo N. Djidjev
Quantum annealers like those from D-Wave Systems implement adiabatic quantum computing to solve optimization problems, but their analog nature and limited control functionalities p…
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…
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…
Distributed Out-of-Memory SVD on CPU/GPU Architectures
Ismael Boureima, Manish Bhattarai, Maksim E. Eren +3
We propose an efficient, distributed, out-of-memory implementation of the truncated singular value decomposition (t-SVD) for heterogeneous (CPU+GPU) high performance computing (HPC…