arXiv subjects

Daniel A. Lidar

Publications and source records attributed to Daniel A. Lidar.

At least 55 records · Page 3Linked to original sources

arXiv2021

Demonstration of long-range correlations via susceptibility measurements in a one-dimensional superconducting Josephson spin chain

Spin chains have long been considered an effective medium for long-range interactions, entanglement generation, and quantum state transfer. In this work, we explore the properties of a spin chain implemented with superconducting flux circuits, designed to act as a connectivity medium between two superconducting qubits. The susceptibility of the chain is probed and shown to support long-range, cross chain correlations. In addition, interactions between the two end qubits, mediated by the coupler chain, are demonstrated. This work has direct applicability in near term quantum annealing processors as a means of generating long-range, coherent coupling between qubits.

quant-ph↗

arXiv2021

Phase transitions in the frustrated Ising ladder with stoquastic and nonstoquastic catalysts

The role of nonstoquasticity in the field of quantum annealing and adiabatic quantum computing is an actively debated topic. We study a strongly-frustrated quasi-one-dimensional quantum Ising model on a two-leg ladder to elucidate how a first-order phase transition with a topological origin is affected by interactions of the $\pm XX$-type. Such interactions are sometimes known as stoquastic (negative sign) and nonstoquastic (positive sign) "catalysts". Carrying out a symmetry-preserving real-space renormalization group analysis and extensive density-matrix renormalization group computations, we show that the phase diagrams obtained by these two methods are in qualitative agreement with each other and reveal that the first-order quantum phase transition of a topological nature remains stable against the introduction of both $XX$-type catalysts. This is the first study of the effects of nonstoquasticity on a first-order phase transition between topologically distinct phases. Our results indicate that nonstoquastic catalysts are generally insufficient for removing topological obstacles in quantum annealing and adiabatic quantum computing.

quant-ph↗

arXiv2021

Optimal Control for Closed and Open System Quantum Optimization

We provide a rigorous analysis of the quantum optimal control problem in the setting of a linear combination $s(t)B+(1-s(t))C$ of two noncommuting Hamiltonians $B$ and $C$. This includes both quantum annealing (QA) and the quantum approximate optimization algorithm (QAOA). The target is to minimize the energy of the final ``problem'' Hamiltonian $C$, for a time-dependent and bounded control schedule $s(t)\in [0,1]$ and $t\in \mc{I}:= [0,t_f]$. It was recently shown, in a purely closed system setting, that the optimal solution to this problem is a ``bang-anneal-bang'' schedule, with the bangs characterized by $s(t)= 0$ and $s(t)= 1$ in finite subintervals of $\mc{I}$, in particular $s(0)=0$ and $s(t_f)=1$, in contrast to the standard prescription $s(0)=1$ and $s(t_f)=0$ of quantum annealing. Here we extend this result to the open system setting, where the system is described by a density matrix rather than a pure state. This is the natural setting for experimental realizations of QA and QAOA. For finite-dimensional environments and without any approximations we identify sufficient conditions ensuring that either the bang-anneal, anneal-bang, or bang-anneal-bang schedules are optimal, and recover the optimality of $s(0)=0$ and $s(t_f)=1$. However, for infinite-dimensional environments and a system described by an adiabatic Redfield master equation we do not recover the bang-type optimal solution. In fact we can only identify conditions under which $s(t_f)=1$, and even this result is not recovered in the fully Markovian limit. The analysis, which we carry out entirely within the geometric framework of Pontryagin Maximum Principle, simplifies using the density matrix formulation compared to the state vector formulation.

quant-ph↗

arXiv2021

Quantum processor-inspired machine learning in the biomedical sciences

Recent advances in high-throughput genomic technologies coupled with exponential increases in computer processing and memory have allowed us to interrogate the complex aberrant molecular underpinnings of human disease from a genome-wide perspective. While the deluge of genomic information is expected to increase, a bottleneck in conventional high-performance computing is rapidly approaching. Inspired in part by recent advances in physical quantum processors, we evaluated several unconventional machine learning (ML) strategies on actual human tumor data. Here we show for the first time the efficacy of multiple annealing-based ML algorithms for classification of high-dimensional, multi-omics human cancer data from the Cancer Genome Atlas. To assess algorithm performance, we compared these classifiers to a variety of standard ML methods. Our results indicate the feasibility of using annealing-based ML to provide competitive classification of human cancer types and associated molecular subtypes and superior performance with smaller training datasets, thus providing compelling empirical evidence for the potential future application of unconventional computing architectures in the biomedical sciences.

quant-ph↗

arXiv2021

Anneal-path correction in flux qubits

Quantum annealers require accurate control and optimized operation schemes to reduce noise levels, in order to eventually demonstrate a computational advantage over classical algorithms. We study a high coherence four-junction capacitively shunted flux qubit (CSFQ), using dispersive measurements to extract system parameters and model the device. Josephson junction asymmetry inherent to the device causes a deleterious nonlinear cross-talk when annealing the qubit. We implement a nonlinear annealing path to correct the asymmetry in-situ, resulting in a substantial increase in the probability of the qubit being in the correct state given an applied flux bias. We also confirm the multi-level structure of our CSFQ circuit model by annealing it through small spectral gaps and observing quantum signatures of energy level crossings. Our results demonstrate an anneal-path correction scheme designed and implemented to improve control accuracy for high-coherence and high-control quantum annealers, which leads to an enhancement of success probability in annealing protocols.

quant-ph↗

arXiv2020

Why and when is pausing beneficial in quantum annealing?

Recent empirical results using quantum annealing hardware have shown that mid anneal pausing has a surprisingly beneficial impact on the probability of finding the ground state for of a variety of problems. A theoretical explanation of this phenomenon has thus far been lacking. Here we provide an analysis of pausing using a master equation framework, and derive conditions for the strategy to result in a success probability enhancement. The conditions, which we identify through numerical simulations and then prove to be sufficient, require that relative to the pause duration the relaxation rate is large and decreasing right after crossing the minimum gap, small and decreasing at the end of the anneal, and is also cumulatively small over this interval, in the sense that the system does not thermally equilibrate. This establishes that the observed success probability enhancement can be attributed to incomplete quantum relaxation, i.e., is a form of beneficial non-equilibrium coupling to the environment.

quant-ph↗

arXiv2020

Improved Boltzmann machines with error corrected quantum annealing

Boltzmann machines are the basis of several deep learning methods that have been successfully applied to both supervised and unsupervised machine learning tasks. These models assume that a dataset is generated according to a Boltzmann distribution, and the goal of the training procedure is to learn the set of parameters that most closely match the input data distribution. Training such models is difficult due to the intractability of traditional sampling techniques, and proposals using quantum annealers for sampling hope to mitigate the sampling cost. However, real physical devices will inevitably be coupled to the environment, and the strength of this coupling affects the effective temperature of the distributions from which a quantum annealer samples. To counteract this problem, error correction schemes that can effectively reduce the temperature are needed if there is to be some benefit in using quantum annealing for problems at a larger scale, where we might expect the effective temperature of the device to not be sufficiently low. To this end, we have applied nested quantum annealing correction (NQAC) to do unsupervised learning with a small bars and stripes dataset, and to do supervised learning with a coarse-grained MNIST dataset. For both datasets we demonstrate improved training and a concomitant effective temperature reduction at higher noise levels relative to the unencoded case. We also find better performance overall with longer anneal times and offer an interpretation of the results based on a comparison to simulated quantum annealing and spin vector Monte Carlo. A counterintuitive aspect of our results is that the output distribution generally becomes less Gibbs-like with increasing nesting level and increasing anneal times, which shows that improved training performance can be achieved without equilibration to the target Gibbs distribution.

quant-ph↗

arXiv2020

Probing the Universality of Topological Defect Formation in a Quantum Annealer: Kibble-Zurek Mechanism and Beyond

The number of topological defects created in a system driven through a quantum phase transition exhibits a power-law scaling with the driving time. This universal scaling law is the key prediction of the Kibble-Zurek mechanism (KZM), and testing it using a hardware-based quantum simulator is a coveted goal of quantum information science. Here we provide such a test using quantum annealing. Specifically, we report on extensive experimental tests of topological defect formation via the one-dimensional transverse-field Ising model on two different D-Wave quantum annealing devices. We find that the quantum simulator results can indeed be explained by the KZM for open-system quantum dynamics with phase-flip errors, with certain quantitative deviations from the theory likely caused by factors such as random control errors and transient effects. In addition, we probe physics beyond the KZM by identifying signatures of universality in the distribution and cumulants of the number of kinks and their decay, and again find agreement with the quantum simulator results. This implies that the theoretical predictions of the generalized KZM theory, which assumes isolation from the environment, applies beyond its original scope to an open system. We support this result by extensive numerical computations. To check whether an alternative, classical interpretation of these results is possible, we used the spin-vector Monte Carlo model, a candidate classical description of the D-Wave device. We find that the degree of agreement with the experimental data from the D-Wave annealing devices is better for the KZM, a quantum theory, than for the classical spin-vector Monte Carlo model, thus favoring a quantum description of the device. Our work provides an experimental test of quantum critical dynamics in an open quantum system, and paves the way to new directions in quantum simulation experiments.

quant-ph↗

arXiv2020

Lecture Notes on the Theory of Open Quantum Systems

This is a self-contained set of lecture notes covering various aspects of the theory of open quantum system, at a level appropriate for a one-semester graduate course. The main emphasis is on completely positive maps and master equations, both Markovian and non-Markovian.

quant-ph↗

arXiv2019

Reverse quantum annealing of the $p$-spin model with relaxation

In reverse quantum annealing, the initial state is an eigenstate of the final problem Hamiltonian and the transverse field is cycled rather than strictly decreased as in standard (forward) quantum annealing. We present a numerical study of the reverse quantum annealing protocol applied to the $p$-spin model ($p=3$), including pausing, in an open system setting accounting for dephasing in the energy eigenbasis, which results in thermal relaxation. We consider both independent and collective dephasing and demonstrate that in both cases the open system dynamics substantially enhances the performance of reverse annealing. Namely, including dephasing overcomes the failure of purely closed system reverse annealing to converge to the ground state of the $p$-spin model. We demonstrate that pausing further improves the success probability. The collective dephasing model leads to somewhat better performance than independent dephasing. The protocol we consider corresponds closely to the one implemented in the current generation of commercial quantum annealers, and our results help to explain why recent experiments demonstrated enhanced success probabilities under reverse annealing and pausing.

quant-ph↗

arXiv2019

Dynamics of reverse annealing for the fully-connected $p$-spin model

Reverse annealing is a relatively new variant of quantum annealing, in which one starts from a classical state and increases and then decreases the amplitude of the transverse field, in the hope of finding a better classical state than the initial state for a given optimization problem. We numerically study the unitary quantum dynamics of reverse annealing for the mean-field-type $p$-spin model and show that the results are consistent with the predictions of equilibrium statistical mechanics. In particular, we corroborate the equilibrium analysis prediction that reverse annealing provides an exponential speedup over conventional quantum annealing in terms of solving the $p$-spin model. This lends support to the expectation that equilibrium analyses are effective at revealing essential aspects of the dynamics of quantum annealing. We also compare the results of quantum dynamics with the corresponding classical dynamics, to reveal their similarities and differences. We distinguish between two reverse annealing protocols we call adiabatic and iterated reverse annealing. We further show that iterated reverse annealing, as has been realized in the D-Wave device, is ineffective in the case of the $p$-spin model, but note that a recently-introduced protocol ("$h$-gain"), which implements adiabatic reverse annealing, may lead to improved performance.

quant-ph↗

arXiv2019

Arbitrary-time error suppression for Markovian adiabatic quantum computing using stabilizer subspace codes

Adiabatic quantum computing (AQC) can be protected against thermal excitations via an encoding into error detecting codes, supplemented with an energy penalty formed from a sum of commuting Hamiltonian terms. Earlier work showed that it is possible to suppress the initial thermally induced excitation out of the encoded ground state, in the case of local Markovian environments, by using an energy penalty strength that grows only logarithmically in the system size, at a fixed temperature. The question of whether this result applies beyond the initial time was left open. Here we answer this in the affirmative. We show that thermal excitations out of the encoded ground state can be suppressed at arbitrary times under the additional assumption that the total evolution time is polynomial in the system size. Thus, computational problems that can be solved efficiently using AQC in a closed system setting, can still be solved efficiently subject to coupling to a thermal environment. Our construction uses stabilizer subspace codes, which require at least $4$-local interactions to achieve this result.

quant-ph↗

arXiv2019

Sensitivity of quantum speedup by quantum annealing to a noisy oracle

The glued-trees problem is the only example known to date for which quantum annealing provides an exponential speedup, albeit by partly using excited state evolution, in an oracular setting. How robust is this speedup to noise on the oracle? To answer this, we construct phenomenological short-range and long-range noise models, and noise models that break or preserve the reflection symmetry of the spectrum. We show that under the long-range noise models an exponential quantum speedup is retained. However, we argue that a classical algorithm with an equivalent long-range noise model also exhibits an exponential speedup over the noiseless model. In the quantum setting the long-range noise is able to lift the spectral gap of the problem so that the evolution changes from diabatic to adiabatic. In the classical setting, long-range noise creates a significant probability of the walker landing directly on the EXIT vertex. Under short-range noise the exponential speedup is lost, but a polynomial quantum speedup is retained for sufficiently weak noise. In contrast to noise range, we find that breaking of spectral symmetry by the noise has no significant impact on the performance of the noisy algorithms. Our results about the long-range models highlight that care must be taken in selecting phenomenological noise models so as not to change the nature of the computational problem. We conclude from the short-range noise model results that the exponential speedup in the glued-trees problem is not robust to noise, but a polynomial quantum speedup is still possible.

quant-ph↗

arXiv2018

Quantum annealing of the $p$-spin model under inhomogeneous transverse field driving

We solve the mean-field-like $p$-spin Ising model under a spatio-temporal inhomogeneous transverse field to study the effects of inhomogeneity on the performance of quantum annealing. We find that the problematic first-order quantum phase transition that arises under the conventional homogeneous field protocol can be avoided if the temperature is zero and the local field is completely turned off site by site after a finite time. When these ideal conditions are not satisfied, a new series of first-order transitions appear, which prevents us from driving the system while avoiding first-order transitions. Nevertheless, under these non-ideal conditions, quantitative improvements can be obtained in terms of narrower tunneling barriers in the free energy landscape. A comparison with classical simulated annealing establishes a limited quantum advantage in the ideal case, since inhomogeneous temperature driving in simulated annealing cannot remove a first-order transition, in contrast to the quantum case. The classical model of spin-vector Monte Carlo is also analyzed, and we find it to have the same thermodynamic phase diagram as the quantum model in the ideal case, with deviations arising at non-zero temperature.

quant-ph↗

arXiv2018

Exploring More-Coherent Quantum Annealing

In the quest to reboot computing, quantum annealing (QA) is an interesting candidate for a new capability. While it has not demonstrated an advantage over classical computing on a real-world application, many important regions of the QA design space have yet to be explored. In IARPA's Quantum Enhanced Optimization (QEO) program, we have opened some new lines of inquiry to get to the heart of QA, and are designing testbed superconducting circuits and conducting key experiments. In this paper, we discuss recent experimental progress related to one of the key design dimensions: qubit coherence. Using MIT Lincoln Laboratory's qubit fabrication process and extending recent progress in flux qubits, we are implementing and measuring QA-capable flux qubits. Achieving high coherence in a QA context presents significant new engineering challenges. We report on techniques and preliminary measurement results addressing two of the challenges: crosstalk calibration and qubit readout. This groundwork enables exploration of other promising features and provides a path to understanding the physics and the viability of quantum annealing as a computing resource.

quant-ph↗

arXiv2018

Demonstration of a scaling advantage for a quantum annealer over simulated annealing

The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing. The D-Wave quantum annealing processors have been at the forefront of experimental attempts to address this goal, given their relatively large numbers of qubits and programmability. A complete determination of the optimal time-to-solution (TTS) using these processors has not been possible to date, preventing definitive conclusions about the presence of a scaling advantage. The main technical obstacle has been the inability to verify an optimal annealing time within the available range. Here we overcome this obstacle and present a class of problem instances for which we observe an optimal annealing time using a D-Wave 2000Q processor over a range spanning up to more than $2000$ qubits. This allows us to perform an optimal TTS benchmarking analysis and perform a comparison to several classical algorithms, including simulated annealing, spin-vector Monte Carlo, and discrete-time simulated quantum annealing. We establish the first example of a scaling advantage for an experimental quantum annealer over classical simulated annealing: we find that the D-Wave device exhibits certifiably better scaling than simulated annealing, with $95\%$ confidence, over the range of problem sizes that we can test. However, we do not find evidence for a quantum speedup: simulated quantum annealing exhibits the best scaling by a significant margin. Our construction of instance classes with verifiably optimal annealing times opens up the possibility of generating many new such classes, paving the way for further definitive assessments of scaling advantages using current and future quantum annealing devices.

quant-ph↗

arXiv2018

Finite temperature quantum annealing solving exponentially small gap problem with non-monotonic success probability

Closed-system quantum annealing is expected to sometimes fail spectacularly in solving simple problems for which the gap becomes exponentially small in the problem size. Much less is known about whether this gap scaling also impedes open-system quantum annealing. Here we study the performance of a quantum annealing processor in solving such a problem: a ferromagnetic chain with sectors of alternating coupling strength that is classically trivial but exhibits an exponentially decreasing gap in the sector size. The gap is several orders of magnitude smaller than the device temperature. Contrary to the closed-system expectation, the success probability rises for sufficiently large sector sizes. The success probability is strongly correlated with the number of thermally accessible excited states at the critical point. We demonstrate that this behavior is consistent with a quantum open-system description that is unrelated to thermal relaxation, and is instead dominated by the system's properties at the critical point.

quant-ph↗

arXiv2018

Error Reduction in Quantum Annealing using Boundary Cancellation: Only the End Matters

The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $τ$ is upper bounded by $C/τ$ for some positive constant $C$. It has been known for decades that this error can be reduced to $C_{k}/τ^{k+1}$ if the Hamiltonian has vanishing derivatives up to order $k$ at the beginning and end of the evolution. Here we extend this result to open systems described by a time-dependent Liouvillian superoperator. We find that the same results holds provided the Liouvillian has vanishing derivatives up to order $k$ only at the end of the evolution. This asymmetry is ascribable to the arrow of time inherent in open system evolution. We further investigate whether it is possible to satisfy the required assumptions by controlling only the system, as required for realistic implementations. Surprisingly, we find the answer to be affirmative. We establish this rigorously in the setting of the Davies-Lindblad adiabatic master equation, and numerically in the setting of two different time-dependent Redfield-type master equations we derive. The results are shown to be stable with respect to imperfections in the preparation. Finally, we prove that the results hold also in a fully Hamiltonian model.

quant-ph↗