Searcharxiv⌕ Search

arXiv subjects

Helmut G. Katzgraber

Publications and source records attributed to Helmut G. Katzgraber.

At least 91 records · Page 5Linked to original sources
arXiv2016

Stochastic Boltzmann Equation for Magnetic Relaxation in High-Spin Molecules

We introduce the stochastic Boltzmann equation (SBE) as an approach for exploring the spin dynamics of magnetic molecules coupled to a stochastic environment. The SBE is a time-evolution equation for the probability density of the spin density matrix of the system. This probability density is relevant to experiments which take measurements on single molecules, in which probabilities of observing particular spin states (rather than ensemble averages) are of interest. By analogy with standard treatments of the regular Boltzmann equation, we propose a relaxation-time approximation for the SBE, and show that solutions to the SBE under the relaxation-time approximation can be obtained by performing simple trajectory simulations for the case of a boson gas environment. Cases where the relaxation-time approximation are satisfied can therefore be investigated by careful choice of the parameters for the boson gas environment, even if the actual environment is quite different from a boson gas. The application of the SBE approach is demonstrated through an illustrative example.

cond-mat.mtrl-sci↗
arXiv2016

Best-case performance of quantum annealers on native spin-glass benchmarks: How chaos can affect success probabilities

Recent tests performed on the D-Wave Two quantum annealer have revealed no clear evidence of speedup over conventional silicon-based technologies. Here, we present results from classical parallel-tempering Monte Carlo simulations combined with isoenergetic cluster moves of the archetypal benchmark problem-an Ising spin glass-on the native chip topology. Using realistic uncorrelated noise models for the D-Wave Two quantum annealer, we study the best-case resilience, i.e., the probability that the ground-state configuration is not affected by random fields and random-bond fluctuations found on the chip. We thus compute classical upper-bound success probabilities for different types of disorder used in the benchmarks and predict that an increase in the number of qubits will require either error correction schemes or a drastic reduction of the intrinsic noise found in these devices. We outline strategies to develop robust, as well as hard benchmarks for quantum annealing devices, as well as any other computing paradigm affected by noise.

quant-ph↗
arXiv2015

Population annealing: Theory and application in spin glasses

Population annealing is an efficient sequential Monte Carlo algorithm for simulating equilibrium states of systems with rough free energy landscapes. The theory of population annealing is presented, and systematic and statistical errors are discussed. The behavior of the algorithm is studied in the context of large-scale simulations of the three-dimensional Ising spin glass and the performance of the algorithm is compared to parallel tempering. It is found that the two algorithms are similar in efficiency though with different strengths and weaknesses.

cond-mat.dis-nn↗
arXiv2015

Chaos in spin glasses revealed through thermal boundary conditions

We study the fragility of spin glasses to small temperature perturbations numerically using population annealing Monte Carlo. We apply thermal boundary conditions to a three-dimensional Edwards-Anderson Ising spin glass. In thermal boundary conditions all eight combinations of periodic versus antiperiodic boundary conditions in the three spatial directions are present, each appearing in the ensemble with its respective statistical weight determined by its free energy. We show that temperature chaos is revealed in the statistics of crossings in the free energy for different boundary conditions. By studying the energy difference between boundary conditions at free-energy crossings, we determine the domain-wall fractal dimension. Similarly, by studying the number of crossings, we determine the chaos exponent. Our results also show that computational hardness in spin glasses and the presence of chaos are closely related.

cond-mat.dis-nn↗
arXiv2015

Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly

There has been considerable progress in the design and construction of quantum annealing devices. However, a conclusive detection of quantum speedup over traditional silicon-based machines remains elusive, despite multiple careful studies. In this work we outline strategies to design hard tunable benchmark instances based on insights from the study of spin glasses - the archetypal random benchmark problem for novel algorithms and optimization devices. We propose to complement head-to-head scaling studies that compare quantum annealing machines to state-of-the-art classical codes with an approach that compares the performance of different algorithms and/or computing architectures on different classes of computationally hard tunable spin-glass instances. The advantage of such an approach lies in having to only compare the performance hit felt by a given algorithm and/or architecture when the instance complexity is increased. Furthermore, we propose a methodology that might not directly translate into the detection of quantum speedup, but might elucidate whether quantum annealing has a "`quantum advantage" over corresponding classical algorithms like simulated annealing. Our results on a 496 qubit D-Wave Two quantum annealing device are compared to recently-used state-of-the-art thermal simulated annealing codes.

quant-ph↗
arXiv2015

Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension

Spin systems with frustration and disorder are notoriously difficult to study both analytically and numerically. While the simulation of ferromagnetic statistical mechanical models benefits greatly from cluster algorithms, these accelerated dynamics methods remain elusive for generic spin-glass-like systems. Here we present a cluster algorithm for Ising spin glasses that works in any space dimension and speeds up thermalization by at least one order of magnitude at temperatures where thermalization is typically difficult. Our isoenergetic cluster moves are based on the Houdayer cluster algorithm for two-dimensional spin glasses and lead to a speedup over conventional state-of-the-art methods that increases with the system size. We illustrate the benefits of the isoenergetic cluster moves in two and three space dimensions, as well as the nonplanar chimera topology found in the D-Wave Inc.~quantum annealing machine.

cond-mat.dis-nn↗
arXiv2015

Comparing Monte Carlo methods for finding ground states of Ising spin glasses: population annealing, simulated annealing and parallel tempering

Population annealing is a Monte Carlo algorithm that marries features from simulated annealing and parallel tempering Monte Carlo. As such, it is ideal to overcome large energy barriers in the free-energy landscape while minimizing a Hamiltonian. Thus, population annealing Monte Carlo can be used as a heuristic to solve combinatorial optimization problems. We illustrate the capabilities of population annealing Monte Carlo by computing ground states of the three-dimensional Ising spin glass with Gaussian disorder, whilst comparing to simulated annealing and parallel tempering Monte Carlo. Our results suggest that population annealing Monte Carlo is significantly more efficient than simulated annealing but comparable to parallel tempering Monte Carlo for finding spin-glass ground states.

cond-mat.dis-nn↗
arXiv2015

The effect of quenched bond disorder on first-order phase transitions

We investigate the effect of quenched bond disorder on the two-dimensional three-color Ashkin-Teller model, which undergoes a first-order phase transition in the absence of impurities. This is one of the simplest and striking models in which quantitative numerical simulations can be carried out to investigate emergent criticality due to disorder rounding of first-order transition. Utilizing extensive cluster Monte Carlo simulations on large lattice sizes of up to $128 \times 128$ spins, each of which is represented by three colors taking values $\pm 1$, we show that the rounding of the first-order phase transition is an emergent criticality. We further calculate the correlation length critical exponent, $ν$, and the magnetization critical exponent, $β$, from finite size scaling analysis. We find that the critical exponents, $ν$ and $β$, change as the strength of disorder or the four-spin coupling varies, and we show that the critical exponents appear not to be in the Ising universality class. We know of no analytical approaches that can explain our non-perturbative results. However our results should inspire further work on this important problem, either numerical or analytical.

cond-mat.dis-nn↗
arXiv2014

Evidence against a mean field description of short-range spin glasses revealed through thermal boundary conditions

A theoretical description of the low-temperature phase of short-range spin glasses has remained elusive for decades. In particular, it is unclear if theories that assert a single pair of pure states, or theories that are based infinitely many pure states-such as replica symmetry breaking-best describe realistic short-range systems. To resolve this controversy, the three-dimensional Edwards-Anderson Ising spin glass in thermal boundary conditions is studied numerically using population annealing Monte Carlo. In thermal boundary conditions all eight combinations of periodic vs antiperiodic boundary conditions in the three spatial directions appear in the ensemble with their respective Boltzmann weights, thus minimizing finite-size corrections due to domain walls. From the relative weighting of the eight boundary conditions for each disorder instance a sample stiffness is defined, and its typical value is shown to grow with system size according to a stiffness exponent. An extrapolation to the large-system-size limit is in agreement with a description that supports the droplet picture and other theories that assert a single pair of pure states. The results are, however, incompatible with the mean-field replica symmetry breaking picture, thus highlighting the need to go beyond mean-field descriptions to accurately describe short-range spin-glass systems.

cond-mat.dis-nn↗
arXiv2014

Low-temperature behavior of the statistics of the overlap distribution in Ising spin-glass models

Using Monte Carlo simulations, we study in detail the overlap distribution for individual samples for several spin-glass models including the infinite-range Sherrington-Kirkpatrick model, short-range Edwards-Anderson models in three and four space dimensions, and one-dimensional long-range models with diluted power-law interactions. We study three long-range models with different powers as follows: the first is approximately equivalent to a short-range model in three dimensions, the second to a short-range model in four dimensions, and the third to a short-range model in the mean-field regime. We study an observable proposed earlier by some of us which aims to distinguish the "replica symmetry breaking" picture of the spin-glass phase from the "droplet picture," finding that larger system sizes would be needed to unambiguously determine which of these pictures describes the low-temperature state of spin glasses best, except for the Sherrington-Kirkpatrick model which is unambiguously described by replica symmetry breaking. Finally, we also study the median integrated overlap probability distribution and a typical overlap distribution, finding that these observables are not particularly helpful in distinguishing the replica symmetry breaking and the droplet pictures.

cond-mat.dis-nn↗
arXiv2014

Existence of a Thermodynamic Spin-Glass Phase in the Zero-Concentration Limit of Anisotropic Dipolar Systems

The nature of ordering in dilute dipolar interacting systems dates back to the work of Debye and is one of the most basic, oldest and as-of-yet unsettled problems in magnetism. While spin-glass order is readily observed in several RKKY-interacting systems, dipolar spin-glasses are subject of controversy and ongoing scrutiny, e.g., in ${{\rm LiHo_xY_{1-x}F_4}}$, a rare-earth randomly diluted uniaxial (Ising) dipolar system. In particular, it is unclear if the spin-glass phase in these paradigmatic materials persists in the limit of zero concentration or not. We study an effective model of ${{\rm LiHo_xY_{1-x}F_4}}$ using large-scale Monte Carlo simulations that combine parallel tempering with a special cluster algorithm tailored to overcome the numerical difficulties that occur at extreme dilutions. We find a paramagnetic to spin-glass phase transition for all Ho ion concentrations down to the smallest concentration numerically accessible of 0.1%, and including Ho ion concentrations which coincide with those studied experimentally up to 16.7%. Our results suggest that randomly-diluted dipolar Ising systems have a spin-glass phase in the limit of vanishing dipole concentration, with a critical temperature vanishing linearly with concentration, in agreement with mean field theory.

cond-mat.dis-nn↗
arXiv2014

Dealing with correlated choices: How a spin-glass model can help political parties select their policies

Starting from preferences on N proposed policies obtained via questionnaires from a sample of the electorate, an Ising spin-glass model in a field can be constructed from which a political party could find the subset of the proposed policies which would maximize its appeal, form a coherent choice in the eyes of the electorate, and have maximum overlap with the party's existing policies. We illustrate the application of the procedure by simulations of a spin glass in a random field on scale-free networks.

cond-mat.dis-nn↗
arXiv2014

A probabilistic evolutionary optimization approach to compute quasiparticle braids

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because these are not Abelian, the problem can be reduced to finding an optimal product of braid generators where the optimality is defined in terms of the gate approximation and the braid's length. In this paper we propose the use of different variants of estimation of distribution algorithms to deal with the problem. Furthermore, we investigate how the regularities of the braid optimization problem can be translated into statistical regularities by means of the Boltzmann distribution. We show that our best algorithm is able to produce many solutions that approximates the target gate with an accuracy in the order of $10^{-6}$, and have lengths up to 9 times shorter than those expected from braids of the same accuracy obtained with other methods.

quant-ph↗
arXiv2014

Error Thresholds for Abelian Quantum Double Models: Increasing the bit-flip Stability of Topological Quantum Memory

Current approaches for building quantum computing devices focus on two-level quantum systems which nicely mimic the concept of a classical bit, albeit enhanced with additional quantum properties. However, rather than artificially limiting the number of states to two, the use of d-level quantum systems (qudits) could provide advantages for quantum information processing. Among other merits, it has recently been shown that multi-level quantum systems can offer increased stability to external disturbances - a key problem in current technologies. In this study we demonstrate that topological quantum memories built from qudits, also known as abelian quantum double models, exhibit a substantially increased resilience to noise. That is, even when taking into account the multitude of errors possible for multi-level quantum systems, topological quantum error correction codes employing qudits can sustain a larger error rate than their two-level counterparts. In particular, we find strong numerical evidence that the thresholds of these error-correction codes are given by the hashing bound. Considering the significantly increased error thresholds attained, this might well outweigh the added complexity of engineering and controlling higher dimensional quantum systems.

quant-ph↗
arXiv2014

Glassy Chimeras could be blind to quantum speedup: Designing better benchmarks for quantum annealing machines

Recently, a programmable quantum annealing machine has been built that minimizes the cost function of hard optimization problems by adiabatically quenching quantum fluctuations. Tests performed by different research teams have shown that, indeed, the machine seems to exploit quantum effects. However experiments on a class of random-bond instances have not yet demonstrated an advantage over classical optimization algorithms on traditional computer hardware. Here we present evidence as to why this might be the case. These engineered quantum annealing machines effectively operate coupled to a decohering thermal bath. Therefore, we study the finite-temperature critical behavior of the standard benchmark problem used to assess the computational capabilities of these complex machines. We simulate both random-bond Ising models and spin glasses with bimodal and Gaussian disorder on the D-Wave Chimera topology. Our results show that while the worst-case complexity of finding a ground state of an Ising spin glass on the Chimera graph is not polynomial, the finite-temperature phase space is likely rather simple: Spin glasses on Chimera have only a zero-temperature transition. This means that benchmarking optimization methods using spin glasses on the Chimera graph might not be the best benchmark problems to test quantum speedup. We propose alternative benchmarks by embedding potentially harder problems on the Chimera topology. Finally, we also study the (reentrant) disorder-temperature phase diagram of the random-bond Ising model on the Chimera graph and show that a finite-temperature ferromagnetic phase is stable up to 19.85(15)% antiferromagnetic bonds. Beyond this threshold the system only displays a zero-temperature spin-glass phase. Our results therefore show that a careful design of the hardware architecture and benchmark problems is key when building quantum annealing machines.

cond-mat.dis-nn↗
arXiv2014

Boolean decision problems with competing interactions on scale-free networks: Equilibrium and nonequilibrium behavior in an external bias

We study the equilibrium and nonequilibrium properties of Boolean decision problems with competing interactions on scale-free networks in an external bias (magnetic field). Previous studies at zero field have shown a remarkable equilibrium stability of Boolean variables (Ising spins) with competing interactions (spin glasses) on scale-free networks. When the exponent that describes the power-law decay of the connectivity of the network is strictly larger than 3, the system undergoes a spin-glass transition. However, when the exponent is equal to or less than 3, the glass phase is stable for all temperatures. First, we perform finite-temperature Monte Carlo simulations in a field to test the robustness of the spin-glass phase and show that the system has a spin-glass phase in a field, i.e., exhibits a de Almeida-Thouless line. Furthermore, we study avalanche distributions when the system is driven by a field at zero temperature to test if the system displays self-organized criticality. Numerical results suggest that avalanches (damage) can spread across the whole system with nonzero probability when the decay exponent of the interaction degree is less than or equal to 2, i.e., that Boolean decision problems on scale-free networks with competing interactions can be fragile when not in thermal equilibrium.

cond-mat.dis-nn↗
arXiv2013

Stability of topologically-protected quantum computing proposals as seen through spin glasses

Sensitivity to noise makes most of the current quantum computing schemes prone to error and nonscalable, allowing only for small proof-of-principle devices. Topologically-protected quantum computing aims at solving this problem by encoding quantum bits and gates in topological properties of the hardware medium that are immune to noise that does not impact the entire system at once. There are different approaches to achieve topological stability or active error correction, ranging from quasiparticle braidings to spin models and topological color codes. The stability of these proposals against noise can be quantified by their error threshold. This figure of merit can be computed by mapping the problem onto complex statistical-mechanical spin-glass models with local disorder on nontrival lattices that can have many-body interactions and are sometimes described by lattice gauge theories. The error threshold for a given source of error then represents the point in the temperature-disorder phase diagram where a stable symmetry-broken phase vanishes. An overview of the techniques used to estimate the error thresholds is given, as well as a summary of recent results on the stability of different topologically-protected quantum computing schemes to different error sources.

cond-mat.dis-nn↗