activity
20192026
most citedQuantum Volume in Practice: What Users Can Expect from NISQ Devices

65 citations · 594 across the 65 of their papers we have counts for

collaborators
Showing 2021Show all

7 papers · 1 filter

quant-ph2021★ 54 cited

Parallel Quantum Annealing

Elijah Pelofske, Georg Hahn, Hristo N. Djidjev

Quantum annealers of D-Wave Systems, Inc., offer an efficient way to compute high quality solutions of NP-hard problems. This is done by mapping a problem onto the physical qubits…

cs.IR2021

A Robust Cybersecurity Topic Classification Tool

Elijah Pelofske, Lorie M. Liebrock, Vincent Urias

In this research, we use user defined labels from three internet text sources (Reddit, Stackexchange, Arxiv) to train 21 different machine learning models for the topic classificat…

quant-ph2021★ 27 cited

Sampling on NISQ Devices: "Who's the Fairest One of All?"

Elijah Pelofske, John Golden, Andreas Bärtschi +2

Modern NISQ devices are subject to a variety of biases and sources of noise that degrade the solution quality of computations carried out on these devices. A natural question that…

quant-ph2021★ 18 cited

Quantum Annealing Algorithms for Boolean Tensor Networks

Elijah Pelofske, Georg Hahn, Daniel O'Malley +2

Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality solutions of NP-hard problems. In this contribution, we explore th…

quant-ph2021★ 1 cited

Using machine learning for quantum annealing accuracy prediction

Aaron Barbosa, Elijah Pelofske, Georg Hahn +1

Quantum annealers, such as the device built by D-Wave Systems, Inc., offer a way to compute solutions of NP-hard problems that can be expressed in Ising or QUBO (quadratic unconstr…

quant-ph2021★ 3 cited

Boolean Hierarchical Tucker Networks on Quantum Annealers

Elijah Pelofske, Georg Hahn, Daniel O'Malley +2

Quantum annealing is an emerging technology with the potential to solve some of the computational challenges that remain unresolved as we approach an era beyond Moore's Law. In thi…

quant-ph2021

Reducing quantum annealing biases for solving the graph partitioning problem

Elijah Pelofske, Georg Hahn, Hristo N. Djidjev

Quantum annealers offer an efficient way to compute high quality solutions of NP-hard problems when expressed in a QUBO (quadratic unconstrained binary optimization) or an Ising fo…