activity
19982014
most citedExperimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor

281 citations · 1.2k across the 17 of their papers we have counts for

collaborators

17 papers

quant-ph2014★ 195 cited

Entanglement in a quantum annealing processor

T. Lanting, A. J. Przybysz, A. Yu. Smirnov +23

Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a…

quant-ph2012

Finding low-energy conformations of lattice protein models by quantum annealing

Alejandro Perdomo-Ortiz, Neil Dickson, Marshall Drew-Brook +2

Lattice protein folding models are a cornerstone of computational biophysics. Although these models are a coarse grained representation, they provide useful insight into the energy…

quant-ph2010★ 2 cited

Investigating the Performance of an Adiabatic Quantum Optimization Processor

Kamran Karimi, Neil G. Dickson, Firas Hamze +6

Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum…

cond-mat.supr-con2010★ 16 cited

Observation of Co-tunneling in Pairs of Coupled Flux Qubits

T. Lanting, R. Harris, J. Johansson +17

We report measurements of macroscopic resonant tunneling between the two lowest energy states of a pair of magnetically coupled rf-SQUID flux qubits. This technique provides a dire…

cond-mat.supr-con2010★ 281 cited

Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor

R. Harris, M. W. Johnson, T. Lanting +23

A superconducting chip containing a regular array of flux qubits, tunable interqubit inductive couplers, an XY-addressable readout system, on-chip programmable magnetic memory, and…

quant-ph2009★ 59 cited

Training a Large Scale Classifier with the Quantum Adiabatic Algorithm

Hartmut Neven, Vasil S. Denchev, Geordie Rose +1

In a previous publication we proposed discrete global optimization as a method to train a strong binary classifier constructed as a thresholded sum over weak classifiers. Our motiv…