Jack Raymond

Jack Raymond

Auto-generated profile, based on publicly available information

Jack Raymond

D-Wave Quantum Inc

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 November 2016 in Frontiers in ICT
Verified
Journal Article
Open access
PDF file
JRJack Raymond&Ast
Jack Raymond&Ast
SYSheir Yarkoni
Sheir Yarkoni
EAEvgeny Andriyash
Evgeny Andriyash
Sampling from a Boltzmann distribution is NP-hard and so requires heuristic approaches. Quantum annealing is one promising candidate. The failure of annealing dynamics to equilibrate on practical time scales is a well understood limitation, but does not always prevent a heuristically useful distribution from being generated. In this paper we evaluate several methods for determining a useful operational temperature range for annealers. We show that, even where distributions deviate from the Boltzmann distribution due to ergodicity breaking, these estimates can be useful. We introduce the concepts of local and global temperatures that are captured by different estimation methods. We argue that for practical application it often makes sense to analyze annealers that are subject to post-processing in order to isolate the macroscopic distribution deviations that are a practical barrier to their application.

8 April 2023 in ACM Transactions on Quantum Computing
Verified
Journal Article
Open access
JRJack Raymond
Jack Raymond
RSRadomir Stevanovic
Radomir Stevanovic
WBWilliam Bernoudy
William Bernoudy
KBKelly Boothby
Kelly Boothby
CMCatherine C. McGeoch
Catherine C. McGeoch
AKAndrew D. King
Andrew D. King
Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to larger applications. We present a simple greedy method for solving larger-than-QPU lattice-structured Ising optimization problems. The method, implemented in the open source D-Wave Hybrid framework, uses a QPU coprocessor operating with generic parameters. Performance is evaluated for standard spin-glass problems on two lattice types with up to 11,616 spin variables, double the size that is directly programmable on any available QPU. The proposed method is shown to converge to low-energy solutions faster than an open source simulated annealing method that is either directly employed or substituted as a coprocessor in the hybrid method. Using newer Advantage QPUs in place of D-Wave 2000Q QPUs is shown to enhance convergence of the hybrid method to low energies and to achieve a lower final energy.

30 July 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
AKAndrew D. King
Andrew D. King
CBCristian D. Batista
Cristian D. Batista
JRJack Raymond
Jack Raymond
TLTrevor Lanting
Trevor Lanting
IOIsil Ozfidan
Isil Ozfidan
MAMohammad H. Amin
Mohammad H. Amin
Geometrically frustrated spin-chain compounds such as Ca3Co2O6 exhibit extremely slow relaxation under a changing magnetic field. Consequently, both low-temperature laboratory experiments and Monte Carlo simulations have shown peculiar out-of-equilibrium magnetization curves, which arise from trapping in metastable configurations. In this work, we simulate this phenomenon in a superconducting quantum annealing processor, allowing us to probe the impact of quantum fluctuations on both the equilibrium and dynamics of the system. Increasing the quantum fluctuations with a transverse field reduces the impact of metastable traps in out-of-equilibrium samples and aids the development of three-sublattice ferrimagnetic (up-up-down) long-range order with magnetization 1/3. At equilibrium, we identify a finite-temperature shoulder in the 1/3-to-saturated phase transition, promoted by quantum fluctuations but with an entropic origin. This work demonstrates the viability of dynamical as well as equilibrium studies of frustrated magnetism using large-scale programmable quantum systems and is therefore an important step toward programmable simulation of dynamics in materials using quantum hardware.

27 February 2023 in Nature Communications
Verified
Journal Article
Open access
PDF file
ALAlejandro Lopez-Bezanilla
Alejandro Lopez-Bezanilla
JRJack Raymond
Jack Raymond
KBKelly Boothby
Kelly Boothby
JCJuan Carrasquilla
Juan Carrasquilla
CNCristiano Nisoli
Cristiano Nisoli
AKAndrew D. King
Andrew D. King
Topological phases of spin liquids with constrained disorder can host a kinetics of fractionalized excitations. However, spin-liquid phases with distinct kinetic regimes have proven difficult to observe experimentally. Here we present a realization of kagome spin ice in the superconducting qubits of a quantum annealer, and use it to demonstrate a field-induced kinetic crossover between spin-liquid phases. Employing fine control over local magnetic fields, we show evidence of both the Ice-I phase and an unconventional field-induced Ice-II phase. In the latter, a charge-ordered yet spin-disordered topological phase, the kinetics proceeds via pair creation and annihilation of strongly correlated, charge conserving, fractionalized excitations. As these kinetic regimes have resisted characterization in other artificial spin ice realizations, our results demonstrate the utility of quantum-driven kinetics in advancing the study of topological phases of spin liquids.

28 February 2020 in Physical Review E
Verified
Journal Article
Closed access
PDF file
DPDilina Perera
Dilina Perera
FHFiras Hamze
Firas Hamze
JRJack Raymond
Jack Raymond
MWMartin Weigel
Martin Weigel
HKHelmut G. Katzgraber
Helmut G. Katzgraber
We investigate the computational hardness of spin-glass instances on a square lattice, generated via a recently introduced tunable and scalable approach for planting solutions. The method relies on partitioning the problem graph into edge-disjoint subgraphs and planting frustrated, elementary subproblems that share a common local ground state, which guarantees that the ground state of the entire problem is known a priori. Using population annealing Monte Carlo, we compare the typical hardness of problem classes over a large region of the multidimensional tuning parameter space. Our results show that the problems have a wide range of tunable hardness. Moreover, we observe multiple transitions in the hardness phase space, which we further corroborate using simulated annealing and simulated quantum annealing. By investigating thermodynamic properties of these planted systems, we demonstrate that the harder samples undergo magnetic ordering transitions which are also ultimately responsible for the observed hardness transitions on changing the sample composition.

27 October 2015
Verified
Book Chapter
Open access
PDF file
ADAdam Douglass
Adam Douglass
AKAndrew D. King
Andrew D. King
JRJack Raymond
Jack Raymond
SAT filters are a novel and compact data structure that can be used to quickly query a word for membership in a fixed set. They have the potential to store more information in a fixed storage limit than a Bloom filter. Constructing a SAT filter requires sampling diverse solutions to randomly constructed constraint satisfaction instances, but there is flexibility in the choice of constraint satisfaction problem. Presented here is a case study of SAT filter construction with a focus on constraint satisfaction problems based on MAX-CUT clauses (Not-all-equal 3-SAT, 2-in-4-SAT, etc.) and frustrated cycles in the Ising model. Solutions are sampled using a D-Wave quantum annealer, and results are measured against classical approaches. The SAT variants studied are of interest in the context of SAT filters, independent of the solvers used.