54 citations · 395 across the 33 of their papers we have counts for
5 papers · 1 filter
On the expected runtime of multiple testing algorithms with bounded error
Georg Hahn
Consider testing multiple hypotheses in the setting where the p-values of all hypotheses are unknown and thus have to be approximated using Monte Carlo simulations. One class of al…
Efficient Combinatorial Optimization Using Quantum Annealing
Hristo N. Djidjev, Guillaume Chapuis, Georg Hahn +1
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techn…
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
Georg Hahn, Hristo N. Djidjev
Recent advances in the development of commercial quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstraine…
Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
Purnima Ghale, Matthew P. Kroonblawd, Susan M. Mniszewski +6
Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD ar…
Finding Maximum Cliques on the D-Wave Quantum Annealer
Guillaume Chapuis, Hristo N. Djidjev, Georg Hahn +1
This paper assesses the performance of the D-Wave 2X (DW) quantum annealer for finding a maximum clique in a graph, one of the most fundamental and important NP-hard problems. Beca…