arXiv subjects

Christopher L. Baldwin

Publications and source records attributed to Christopher L. Baldwin.

18 recordsLinked to original sources

arXiv2026

Emulating XX catalysts for quantum annealing via self-consistent transverse fields

Fully-connected transverse interactions have been considered as catalysts for quantum annealing that could mitigate exponentially small gaps and circumvent first-order phase transitions, but their experimental implementation remains challenging. In this work, we introduce a procedure for emulating their effects via a self-consistent transverse field. All that is required beyond conventional transverse-field annealing is the ability to make measurements in the transverse ($\hatσ^x$) basis. We show that this protocol yields identical dynamics in the large-system limit, and study the approach to that limit in numerical simulations of the (uniform) $p$-spin model. However, realizing the protocol in practice requires us to consider a series of approximate variants, each of whose errors we quantify and demonstrate can be made sufficiently small. Lastly, we show how to map the protocol onto annealing platforms that vary only a single control parameter. Even after the multiple stages of approximation, our procedure can generate dynamics that agree well with the original transverse-interaction catalyst, establishing self-consistent transverse fields as a viable alternative on near-term quantum annealers.

quant-ph↗

arXiv2026

Reaching states below the threshold energy in spin glasses via quantum annealing

Although quantum annealing is usually considered as a method for locating the ground states of difficult spin-glass and optimization problems, its use in approximate optimization -- finding low- but not zero-energy states in a reasonably short amount of time -- is no less important. Here we investigate the behavior of quantum annealing at approximate optimization in the canonical mean-field spin-glass models, the spherical $p$-spin models, and find that it performs surprisingly well. Whereas it had long been assumed that infinite-range spin glasses have a unique ``threshold'' energy at which all quench and annealing dynamics become trapped until exponential timescales, recent work has shown that two-stage quenches can in fact reach states below the naive threshold in more generic situations. We demonstrate that quantum annealing is also capable of exploiting this effect to locate sub-threshold states in $O(1)$ time. Not only can it attain energies as far below the threshold as classical annealing algorithms, but it can do so significantly faster: for an annealing schedule taking time $τ$, the residual energy under quantum annealing decays as $τ^{-α}$ with an exponent up to twice as large as that of simulated annealing in the cases considered. Importantly, by deriving and numerically solving closed integro-differential equations that hold in the thermodynamic limit, our results are free from finite-size effects and hold for annealing times that are unambiguously independent of system size.

quant-ph↗

arXiv2025

Adiabatic reverse annealing is robust to low-temperature decoherence

Adiabatic reverse annealing (ARA) is an improvement to conventional quantum annealing (QA) that uses an initial guess at the desired ground state to circumvent problematic phase transitions. Despite encouraging results in the closed-system setting, Ref. [1] has suggested on the basis of numerical simulations that ARA may lose its advantage in the presence of decoherence. Here, we revisit this problem from a more analytical perspective. Using the $p$-spin model as a solvable example, together with the adiabatic master equation to describe the effects of the environment (valid at weak coupling), we show that ARA can in fact succeed in open systems but that the temperature of the environment plays a key role. We first demonstrate that, in the adiabatic limit, the system will follow the instantaneous equilibrium state as long as the protocol does not pass through any (finite-temperature) phase transitions. Given this, there are two distinct mechanisms by which ARA can break down at high temperature: either there are no paths that avoid transitions, or the equilibrium state itself is disordered. When the temperature is sufficiently low that neither of these occur, then ARA succeeds. Remarkably, there are even situations in which the environment benefits ARA: we find parameter values for which no transition-avoiding paths exist at zero temperature but such paths appear at non-zero temperature.

quant-ph↗

arXiv2025

Simulated outperforms quantum reverse annealing in mean-field models

Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase transitions. Here we interpret the performance of ARA through its effects on the free energy landscape, and use the intuition gained to introduce a classical analogue to ARA termed ``simulated reverse annealing'' (SRA). This makes it more difficult to claim that ARA provides a quantum advantage in solving a given problem, as not only must ARA succeed but the corresponding SRA must fail. As a solvable example, we analyze how both protocols behave in the infinite-range (non-disordered) $p$-spin model. Through both the thermodynamic phase diagrams and explicit dynamical behavior, we establish that the quantum algorithm has no advantage over its classical counterpart: SRA succeeds not only in every case where ARA does but even in a narrow range of parameters where ARA fails.

quant-ph↗

arXiv2025

Time Independence Does Not Limit Information Flow. II. The Case with Ancillas

While the impact of locality restrictions on quantum dynamics and algorithmic complexity has been well studied in the general case of time-dependent Hamiltonians, the capabilities of time-independent protocols are less well understood. Using clock constructions, we show that the light cone for time-independent Hamiltonians, as captured by Lieb-Robinson bounds, is the same as that for time-dependent systems when local ancillas are allowed. More specifically, we develop time-independent protocols for approximate quantum state transfer with the same run-times as their corresponding time-dependent protocols. Given any piecewise-continuous Hamiltonian, our construction gives a time-independent Hamiltonian that implements its dynamics in the same time, up to error $\varepsilon$, at the cost of introducing a number of local ancilla qubits for each data qubit that is polylogarithmic in the number of qubits, the norm of the Hamiltonian and its derivative (if it exists), the run time, and $1/\varepsilon$. We apply this construction to state transfer for systems with power-law-decaying interactions and one-dimensional nearest-neighbor systems with disordered interaction strengths. In both cases, this gives time-independent protocols with the same optimal light-cone-saturating run-times as their time-dependent counterparts.

quant-ph↗

arXiv2025

Sub-ballistic operator growth in spin chains with heavy-tailed random fields

We rigorously prove that in nearly arbitrary quantum spin chains with power-law-distributed random fields, namely such that the probability of a field exceeding $h$ scales as $h^{-α}$, it is impossible for any operator evolving in the Heisenberg picture to spread with dynamical exponent less than $1/α$. In particular, ballistic growth is impossible for $α< 1$, diffusive growth is impossible for $α< 1/2$, and any finite dynamical exponent becomes impossible for sufficiently small $α$. This result thus establishes a wide family of models in which the disorder provably prevents conventional transport. We express the result as a tightening of Lieb-Robinson bounds due to random fields -- the proof modifies the standard derivation such that strong fields appear as effective weak interactions, and then makes use of analogous recent results for random-bond spin chains.

cond-mat.dis-nn↗

arXiv2025

The anomalously slow dynamics of inhomogeneous quantum annealing

Inhomogeneous quantum annealing (IQA), in which transverse fields are turned off one by one rather than simultaneously, has been proposed as an effective way to avoid the first-order phase transitions that impede conventional quantum annealing (QA). Here we explicitly study the dynamics of IQA, rather than merely the thermodynamics, and find that it is appreciably slower than the phase diagram would suggest. Interestingly, this slowdown manifests both when IQA succeeds in circumventing phase transitions and when it fails. Even in the absence of transitions, such as for the mean-field models that have been analyzed previously, IQA is slower than expected by a factor of the number of spins $N$. More significantly, we show that in non-mean-field models, first-order transitions are likely to be quite common, and the gap at such transitions is not merely exponential in $N$ but exactly zero. Thus IQA cannot reach the ground state on any timescale. Both of these results can be understood through the simple observation that a spin's magnetization becomes conserved once its field is turned off during the IQA protocol.

quant-ph↗

arXiv2025

Time Independence Does Not Limit Information Flow. I. The Free-Particle Case

The speed of information propagation in long-range interacting quantum systems is limited by Lieb-Robinson-type bounds, whose tightness can be established by finding specific quantum state-transfer protocols. Previous works have given quantum state-transfer protocols that saturate the corresponding Lieb-Robinson bounds using time-dependent Hamiltonians. Are speed limits for quantum information propagation different for time-independent Hamiltonians? In a step towards addressing this question, we present and analyze two optimal time-independent state-transfer protocols for free-particle systems, which utilize continuous-time single-particle quantum walks with hopping strength decaying as a power law. We rigorously prove and numerically confirm that our protocols achieve quantum state transfer, with controllable error over an arbitrarily long distance in any spatial dimension, at the speed limits set by the free-particle Lieb-Robinson bounds. This shows that time independence does not limit information flow for long-range free-particle Hamiltonians.

quant-ph↗

arXiv2023

The Glass Transition of Quantum Hard Spheres in High Dimensions

We study the equilibrium thermodynamics of quantum hard spheres in the infinite-dimensional limit, determining the boundary between liquid and glass phases in the temperature-density plane by means of the Franz-Parisi potential. We find that as the temperature decreases from high values, the effective radius of the spheres is enhanced by a multiple of the thermal de Broglie wavelength, thus increasing the effective filling fraction and decreasing the critical density for the glass phase. Numerical calculations show that the critical density continues to decrease monotonically as the temperature decreases further, suggesting that the system will form a glass at sufficiently low temperatures for any density.

cond-mat.stat-mech↗

arXiv2023

Revisiting the replica trick: Competition between spin glass and conventional order

There is an ambiguity in how to apply the replica trick to spin glass models which have additional order parameters unrelated to spin glass order -- with respect to which quantities does one minimize vs maximize the action, and in what sequence? Here we show that the correct procedure is to first maximize with respect to "replica" order parameters, and then minimize with respect to "conventional" order parameters. With this result, we further elucidate the relationship between quenched free energies, annealed free energies, and replica order -- it is possible for the quenched and annealed free energies to differ even while all replica order parameters remain zero.

cond-mat.dis-nn↗

arXiv2023

Spectral statistics of a minimal quantum glass model

Glasses have the interesting feature of being neither integrable nor fully chaotic. They thermalize quickly within a subspace but thermalize much more slowly across the full space due to high free energy barriers which partition the configuration space into sectors. Past works have examined the Rosenzweig-Porter (RP) model as a minimal quantum model which transitions from localized to chaotic behavior. In this work we generalize the RP model in such a way that it becomes a minimal model which transitions from glassy to chaotic behavior, which we term the "Block Rosenzweig-Porter" (BRP) model. We calculate the spectral form factors of both models at all timescales. Whereas the RP model exhibits a crossover from localized to ergodic behavior at the Thouless timescale, the new BRP model instead crosses over from glassy to fully chaotic behavior, as seen by a change in the slope of the ramp of the spectral form factor.

cond-mat.dis-nn↗

arXiv2022

Disordered Lieb-Robinson bounds in one dimension

By tightening the conventional Lieb-Robinson bounds to better handle systems which lack translation invariance, we determine the extent to which "weak links" suppress operator growth in disordered one-dimensional spin chains. In particular, we prove that ballistic growth is impossible when the distribution of coupling strengths $μ(J)$ has a sufficiently heavy tail at small $J$, and identify the correct dynamical exponent to use instead. Furthermore, through a detailed analysis of the special case in which the couplings are genuinely random and independent, we find that the standard formulation of Lieb-Robinson bounds is insufficient to capture the complexity of the dynamics -- we must distinguish between bounds which hold for all sites of the chain and bounds which hold for a subsequence of sites, and we show by explicit example that these two can have dramatically different behaviors. All the same, our result for the dynamical exponent is tight, in that we prove by counterexample that there cannot exist any Lieb-Robinson bound with a smaller exponent. We close by discussing the implications of our results, both major and minor, for numerous applications ranging from quench dynamics to the structure of ground states.

cond-mat.dis-nn↗

arXiv2022

Spectral Form Factor of a Quantum Spin Glass

It is widely expected that systems which fully thermalize are chaotic in the sense of exhibiting random-matrix statistics of their energy level spacings, whereas integrable systems exhibit Poissonian statistics. In this paper, we investigate a third class: spin glasses. These systems are partially chaotic but do not achieve full thermalization due to large free energy barriers. We examine the level spacing statistics of a canonical infinite-range quantum spin glass, the quantum $p$-spherical model, using an analytic path integral approach. We find statistics consistent with a direct sum of independent random matrices, and show that the number of such matrices is equal to the number of distinct metastable configurations -- the exponential of the spin glass "complexity" as obtained from the quantum Thouless-Anderson-Palmer equations. We also consider the statistical properties of the complexity itself and identify a set of contributions to the path integral which suggest a Poissonian distribution for the number of metastable configurations. Our results show that level spacing statistics can probe the ergodicity-breaking in quantum spin glasses and provide a way to generalize the notion of spin glass complexity beyond models with a semi-classical limit.

cond-mat.stat-mech↗

arXiv2022

Simulation Complexity of Many-Body Localized Systems

We use complexity theory to rigorously investigate the difficulty of classically simulating evolution under many-body localized (MBL) Hamiltonians. Using the defining feature that MBL systems have a complete set of quasilocal integrals of motion (LIOMs), we demonstrate a transition in the classical complexity of simulating such systems as a function of evolution time. On one side, we construct a quasipolynomial-time tensor-network-inspired algorithm for strong simulation of 1D MBL systems (i.e., calculating the expectation value of arbitrary products of local observables) evolved for any time polynomial in the system size. On the other side, we prove that even weak simulation, i.e. sampling, becomes formally hard after an exponentially long evolution time, assuming widely believed conjectures in complexity theory. Finally, using the consequences of our classical simulation results, we also show that the quantum circuit complexity for MBL systems is sublinear in evolution time. This result is a counterpart to a recent proof that the complexity of random quantum circuits grows linearly in time.

quant-ph↗

arXiv2021

The Lieb-Robinson light cone for power-law interactions

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as $1/r^α$ at distance $r$? Here, we present a definitive answer to this question for all exponents $α>2d$ and all spatial dimensions $d$. Schematically, information takes time at least $r^{\min\{1, α-2d\}}$ to propagate a distance~$r$. As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

quant-ph↗

arXiv2020

Optimal Protocols in Quantum Annealing and QAOA Problems

Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more effective has remained unclear. Here we analytically apply the framework of optimal control theory to show that generically, given a fixed amount of time, the optimal procedure has the pulsed (or "bang-bang") structure of QAOA at the beginning and end but can have a smooth annealing structure in between. This is in contrast to previous works which have suggested that bang-bang (i.e., QAOA) protocols are ideal. To support this theoretical work, we carry out simulations of various transverse field Ising models, demonstrating that bang-anneal-bang protocols are more common. The general features identified here provide guideposts for the nascent experimental implementations of quantum optimization algorithms.

quant-ph↗

arXiv2020

Studying viral populations with tools from quantum spin chains

We study Eigen's model of quasi-species, characterized by sequences that replicate with a specified fitness and mutate independently at single sites. The evolution of the population vector in time is then closely related to that of quantum spins in imaginary time. We employ multiple perspectives and tools from interacting quantum systems to examine growth and collapse of realistic viral populations, specifically certain HIV proteins. All approaches used, including the simplest perturbation theory, give consistent results.

cond-mat.stat-mech↗

arXiv2018

Magnetoenhancement of superconductivity in composite D-wave superconductors

We study composite D-wave superconductors consisting of randomly oriented and randomly distributed superconducting droplets embedded into a matrix. In a certain range of parameters the application of a small magnetic field enhances the superconductivity in these materials while larger fields suppress superconductivity as usual in conventional superconductors. We investigate the magnetic field dependence of the superfluid density and the critical temperature of such superconductors.

cond-mat.supr-con↗