178 citations · 191 across the 7 of their papers we have counts for
7 papers
Using Universal Frame Randomization and Randomized Compilation to Mitigate Errors in Quantum Optimization
Rachel E. Johnson, Joshua A. Job, Steve Adachi
Error mitigation is essential for near-term quantum devices, and two promising techniques are universal frame randomization and Randomized Compilation. These methods insert random…
The Cost of Entanglement Renormalization on a Fault-Tolerant Quantum Computer
Joshua Job, Isaac H. Kim, Eric Johnston +1
We perform a detailed resource estimate for the prospect of using deep entanglement renormalization ansatz (DMERA) on a fault-tolerant quantum computer, focusing on the regime in w…
Systematic comparison of deep belief network training using quantum annealing vs. classical techniques
Joshua Job, Steve Adachi
In this work we revisit and expand on a 2015 study that used a D-Wave quantum annealer as a sampling engine to assist in the training of a Deep Neural Network. The original 2015 re…
Restricted Boltzmann Machines for galaxy morphology classification with a quantum annealer
João Caldeira, Joshua Job, Steven H. Adachi +2
We present the application of Restricted Boltzmann Machines (RBMs) to the task of astronomical image classification using a quantum annealer built by D-Wave Systems. Morphological…
Quantum Annealing and the Satisfiability Problem
Kristen L. Pudenz, Gregory S. Tallant, Todd R. Belote +1
The utility of satisfiability (SAT) as an application focused hard computational problem is well established. We explore the potential of quantum annealing to enhance classical SAT…
Application of Quantum Annealing to Training of Deep Neural Networks
Steven H. Adachi, Maxwell P. Henderson
In Deep Learning, a well-known approach for training a Deep Neural Network starts by training a generative Deep Belief Network model, typically using Contrastive Divergence (CD), t…
A Comparison of Approaches for Solving Hard Graph-Theoretic Problems
Victoria Horan, Steve Adachi, Stanley Bak
In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational…