11 citations · 11 across the 1 of their papers we have counts for
6 papers
Architectural considerations in the design of a third-generation superconducting quantum annealing processor
Kelly Boothby, Colin Enderud, Trevor Lanting +46
Early generations of superconducting quantum annealing processors have provided a valuable platform for studying the performance of a scalable quantum computing technology. These s…
Accurately computing electronic properties of a quantum ring
C. Neill, T. McCourt, X. Mi +89
A promising approach to study condensed-matter systems is to simulate them on an engineered quantum platform. However, achieving the accuracy needed to outperform classical methods…
Scaling advantage in quantum simulation of geometrically frustrated magnets
Andrew D. King, Jack Raymond, Trevor Lanting +51
The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter s…
Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
I. Ozfidan, C. Deng, A. Y. Smirnov +45
Quantum annealing (QA) is a heuristic algorithm for finding low-energy configurations of a system, with applications in optimization, machine learning, and quantum simulation. Up t…
Observation of topological phenomena in a programmable lattice of 1,800 qubits
Andrew D. King, Juan Carrasquilla, Isil Ozfidan +20
The celebrated work of Berezinskii, Kosterlitz and Thouless in the 1970s revealed exotic phases of matter governed by topological properties of low-dimensional materials such as th…
Quantum Annealing amid Local Ruggedness and Global Frustration
James King, Sheir Yarkoni, Jack Raymond +5
A recent Google study [Phys. Rev. X, 6:031015 (2016)] compared a D-Wave 2X quantum processing unit (QPU) to two classical Monte Carlo algorithms: simulated annealing (SA) and quant…