arXiv subjects

Kelly Boothby

Publications and source records attributed to Kelly Boothby.

13 recordsLinked to original sources

arXiv2025

Quantum dynamics in frustrated Ising fullerenes

The complex energy landscapes exhibited by frustrated magnetic systems undergoing quantum fluctuations are a challenge to accurately simulate, and thus of great interest for testing diverse qubit platforms in the field of quantum simulation. This study experimentally demonstrates quantum fluctuations lifting the degenerate ground-state manifold of classical magnetic configurations in fullerene Ising models with resonating dimers. The interplay between degeneracy and quantum fluctuations makes these boundary-free models a suitable benchmark for quantum simulators. Indeed, we observe significant performance improvement across generations of superconducting quantum annealers, showing the potential of highly symmetric, frustrated systems for assessing the precision of quantum-simulation technologies.

quant-ph↗

arXiv2024

Cyclic Quantum Annealing: Searching for Deep Low-Energy States in 5000-Qubit Spin Glass

Quantum computers promise a qualitative speedup in solving a broad spectrum of practical optimization problems. The latter can be mapped onto the task of finding low-energy states of spin glasses, which is known to be exceedingly difficult. Using D-Wave's 5000-qubit quantum processor, we demonstrate that a recently proposed iterative cyclic quantum annealing algorithm can find deep low-energy states in record time. We also find intricate structures in a low-energy landscape of spin glasses, such as a power-law distribution of connected clusters with a small surface energy. These observations offer guidance for further improvement of the optimization algorithms.

cond-mat.dis-nn↗

arXiv2024

Beyond-classical computation in quantum simulation

Quantum computers hold the promise of solving certain problems that lie beyond the reach of conventional computers. However, establishing this capability, especially for impactful and meaningful problems, remains a central challenge. Here, we show that superconducting quantum annealing processors can rapidly generate samples in close agreement with solutions of the Schr\"odinger equation. We demonstrate area-law scaling of entanglement in the model quench dynamics of two-, three-, and infinite-dimensional spin glasses, supporting the observed stretched-exponential scaling of effort for matrix-product-state approaches. We show that several leading approximate methods based on tensor networks and neural networks cannot achieve the same accuracy as the quantum annealer within a reasonable time frame. Thus, quantum annealers can answer questions of practical importance that may remain out of reach for classical computation.

quant-ph↗

arXiv2023

Quantum error mitigation in quantum annealing

Quantum Error Mitigation (QEM) presents a promising near-term approach to reduce error when estimating expectation values in quantum computing. Here, we introduce QEM techniques tailored for quantum annealing, using Zero-Noise Extrapolation (ZNE). We implement ZNE through zero-temperature extrapolation as well as energy-time rescaling. We conduct experimental investigations into the quantum critical dynamics of a transverse-field Ising spin chain, demonstrating the successful mitigation of thermal noise through both of these techniques. Moreover, we show that energy-time rescaling effectively mitigates control errors in the coherent regime where the effect of thermal noise is minimal. Our ZNE results agree with exact calculations of the coherent evolution over a range of annealing times that exceeds the coherent annealing range by almost an order of magnitude.

quant-ph↗

arXiv2023

Tutorial: Calibration refinement in quantum annealing

Quantum annealing has emerged as a powerful platform for simulating and optimizing classical and quantum Ising models. Quantum annealers, like other quantum and/or analog computing devices, are susceptible to nonidealities including crosstalk, device variation, and environmental noise. Compensating for these effects through calibration refinement or "shimming" can significantly improve performance, but often relies on ad-hoc methods that exploit symmetries in both the problem being solved and the quantum annealer itself. In this tutorial we attempt to demystify these methods. We introduce methods for finding exploitable symmetries in Ising models, and discuss how to use these symmetries to suppress unwanted bias. We work through several examples of increasing complexity, and provide complete Python code. We include automated methods for two important tasks: finding copies of small subgraphs in the qubit connectivity graph, and automatically finding symmetries of an Ising model via generalized graph automorphism. Code is available at https://github.com/dwavesystems/shimming-tutorial.

quant-ph↗

arXiv2023

Kagome qubit ice

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.

cond-mat.stat-mech↗

arXiv2022

Quantum critical dynamics in a 5000-qubit programmable spin glass

Experiments on disordered alloys suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Due to the importance of spin glasses as a paradigmatic computational testbed, reproducing this phenomenon in a programmable system has remained a central challenge in quantum optimization. Here we achieve this goal by realizing quantum critical spin-glass dynamics on thousands of qubits with a superconducting quantum annealer. We first demonstrate quantitative agreement between quantum annealing and time-evolution of the Schr\"odinger equation in small spin glasses. We then measure dynamics in 3D spin glasses on thousands of qubits, where simulation of many-body quantum dynamics is intractable. We extract critical exponents that clearly distinguish quantum annealing from the slower stochastic dynamics of analogous Monte Carlo algorithms, providing both theoretical and experimental support for a scaling advantage in reducing energy as a function of annealing time.

quant-ph↗

arXiv2022

Hybrid quantum annealing for larger-than-QPU lattice-structured problems

Quantum processing units (QPUs) executing annealing algorithms have shown promise in optimization and simulation applications. Hybrid algorithms are a natural bridge to additional applications of larger scale. We present a straightforward and effective method for solving larger-than-QPU lattice-structured Ising optimization problems. Performance is compared against simulated annealing with promising results, and improvement is shown as a function of the generation of D-Wave QPU used.

quant-ph↗

arXiv2021

Architectural considerations in the design of a third-generation superconducting quantum annealing processor

Early generations of superconducting quantum annealing processors have provided a valuable platform for studying the performance of a scalable quantum computing technology. These studies have directly informed our approach to the design of the next-generation processor. Our design priorities for this generation include an increase in per-qubit connectivity, a problem Hamiltonian energy scale similar to previous generations, reduced Hamiltonian specification errors, and an increase in the processor scale that also leaves programming and readout times fixed or reduced. Here we discuss the specific innovations that resulted in a processor architecture that satisfies these design priorities.

quant-ph↗

arXiv2020

Simulating the Shastry-Sutherland Ising Model using Quantum Annealing

Frustration represents an essential feature in the behavior of magnetic materials when constraints on the microscopic Hamiltonian cannot be satisfied simultaneously. This gives rise to exotic phases of matter including spin liquids, spin ices, and stripe phases. Here we demonstrate an approach to understanding the microscopic effects of frustration by computing the phases of a 468-spin Shastry-Sutherland Ising Hamiltonian using a quantum annealer. Our approach uses mean-field boundary conditions to mitigate effects of finite size and defects alongside an iterative quantum annealing protocol to simulate statistical physics. We recover all phases of the Shastry-Sutherland Ising model -- including the well-known fractional magnetization plateau -- and the static structure factor characterizing the critical behavior at these transitions. These results establish quantum annealing as an emerging method in understanding the effects of frustration on the emergence of novel phases of matter and pave the way for future comparisons with real experiments.

quant-ph↗

arXiv2020

Next-Generation Topology of D-Wave Quantum Processors

This paper presents an overview of the topology of D-Wave's next-generation quantum processors. It provides examples of minor embeddings and discusses performance of embedding algorithms for the new topology compared to the existing Chimera topology. It also presents some initial performance results for simple, standard Ising model classes of problems.

quant-ph↗

arXiv2019

Scaling advantage in quantum simulation of geometrically frustrated magnets

The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter systems. One important task is the simulation of geometrically frustrated magnets in which topological phenomena can emerge from competition between quantum and thermal fluctuations. Here we report on experimental observations of relaxation in such simulations, measured on up to 1440 qubits with microsecond resolution. By initializing the system in a state with topological obstruction, we observe quantum annealing (QA) relaxation timescales in excess of one microsecond. Measurements indicate a dynamical advantage in the quantum simulation over the classical approach of path-integral Monte Carlo (PIMC) fixed-Hamiltonian relaxation with multiqubit cluster updates. The advantage increases with both system size and inverse temperature, exceeding a million-fold speedup over a CPU. This is an important piece of experimental evidence that in general, PIMC does not mimic QA dynamics for stoquastic Hamiltonians. The observed scaling advantage, for simulation of frustrated magnetism in quantum condensed matter, demonstrates that near-term quantum devices can be used to accelerate computational tasks of practical relevance.

quant-ph↗

arXiv2015

Fast clique minor generation in Chimera qubit connectivity graphs

The current generation of D-Wave quantum annealing processor is designed to minimize the energy of an Ising spin configuration whose pairwise interactions lie on the edges of a {\em Chimera} graph $\mathcal C_{M,N,L}$. In order to solve an Ising spin problem with arbitrary pairwise interaction structure, the corresponding graph must be minor-embedded into a Chimera graph. We define a combinatorial class of {\em native clique minors} in Chimera graphs with vertex images of uniform, near minimal size, and provide a polynomial-time algorithm that finds a maximum native clique minor in a given induced subgraph of a Chimera graph. These minors allow improvement over recent work and have immediate practical applications in the field of quantum annealing.

cs.DM↗