arXiv subjects

C. R. Laumann

Publications and source records attributed to C. R. Laumann.

28 records · Page 2Linked to original sources

arXiv2014

Many-body Localization and Symmetry Protected Topological Order

Recent work shows that highly excited many-body localized eigenstates can exhibit broken symmetries and topological order, including in dimensions where such order would be forbidden in equilibrium. In this paper we extend this analysis to discrete symmetry protected order via the explicit examples of the Haldane phase of one dimensional spin chains and the topological Ising paramagnet in two dimensions. We comment on the challenge of extending these results to cases where the protecting symmetry is continuous.

cond-mat.str-el↗

arXiv2014

Interferometric probes of many-body localization

We propose a method for detecting many-body localization (MBL) in disordered spin systems. The method involves pulsed, coherent spin manipulations that probe the dephasing of a given spin due to its entanglement with a set of distant spins. It allows one to distinguish the MBL phase from a non-interacting localized phase and a delocalized phase. In particular, we show that for a properly chosen pulse sequence the MBL phase exhibits a characteristic power-law decay reflecting its slow growth of entanglement. We find that this power-law decay is robust with respect to thermal and disorder averaging, provide numerical simulations supporting our results, and discuss possible experimental realizations in solid-state and cold atom systems.

cond-mat.dis-nn↗

arXiv2013

Approximating random quantum optimization problems

We report a cluster of results regarding the difficulty of finding approximate ground states to typical instances of the quantum satisfiability problem $k$-QSAT on large random graphs. As an approximation strategy, we optimize the solution space over `classical' product states, which in turn introduces a novel autonomous classical optimization problem, PSAT, over a space of continuous degrees of freedom rather than discrete bits. Our central results are: (i) The derivation of a set of bounds and approximations in various limits of the problem, several of which we believe may be amenable to a rigorous treatment. (ii) A demonstration that an approximation based on a greedy algorithm borrowed from the study of frustrated magnetism performs well over a wide range in parameter space, and its performance reflects structure of the solution space of random $k$-QSAT. Simulated annealing exhibits metastability in similar `hard' regions of parameter space. (iii) A generalization of belief propagation algorithms introduced for classical problems to the case of continuous spins. This yields both approximate solutions, as well as insights into the free energy `landscape' of the approximation problem, including a so-called dynamical transition near the satisfiability threshold. Taken together, these results allow us to elucidate the phase diagram of random $k$-QSAT in a two-dimensional energy-density--clause-density space.

cond-mat.stat-mech↗

arXiv2012

Strong-disorder renormalization for interacting non-Abelian anyon systems in two dimensions

We consider the effect of quenched spatial disorder on systems of interacting, pinned non-Abelian anyons as might arise in disordered Hall samples at filling fractions ν=5/2 or ν=12/5. In one spatial dimension, such disordered anyon models have previously been shown to exhibit a hierarchy of infinite randomness phases. Here, we address systems in two spatial dimensions and report on the behavior of Ising and Fibonacci anyons under the numerical strong-disorder renormalization group (SDRG). In order to manage the topology-dependent interactions generated during the flow, we introduce a planar approximation to the SDRG treatment. We characterize this planar approximation by studying the flow of disordered hard-core bosons and the transverse field Ising model, where it successfully reproduces the known infinite randomness critical point with exponent ψ~ 0.43. Our main conclusion for disordered anyon models in two spatial dimensions is that systems of Ising anyons as well as systems of Fibonacci anyons do not realize infinite randomness phases, but flow back to weaker disorder under the numerical SDRG treatment.

cond-mat.str-el↗

arXiv2012

The quantum adiabatic algorithm and scaling of gaps at first order quantum phase transitions

Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum antiferromagnetic Ising chain in a staggered field can exhibit a first order transition with only an algebraically small gap. In addition, we construct a simple classical translationally invariant one-dimensional Hamiltonian containing nearest-neighbour interactions only, which exhibits an exponential gap at a thermodynamic quantum first-order transition of essentially topological origin. This establishes that (i) the QAA can be successful even across first order transitions but also that (ii) it can fail on exceedingly simple problems readily solved by inspection, or by classical annealing.

quant-ph↗

arXiv2010

Statistical mechanics of classical and quantum computational complexity

The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous framework for classifying the hardness of problems according to the computational resources, most notably time, needed to solve them. Its extension to quantum computers allows the relative power of quantum computers to be analyzed. This framework identifies families of problems which are likely hard for classical computers (``NP-complete'') and those which are likely hard for quantum computers (``QMA-complete'') by indirect methods. That is, they identify problems of comparable worst-case difficulty without directly determining the individual hardness of any given instance. Statistical mechanical methods can be used to complement this classification by directly extracting information about particular families of instances---typically those that involve optimization---by studying random ensembles of them. These pose unusual and interesting (quantum) statistical mechanical questions and the results shed light on the difficulty of problems for large classes of algorithms as well as providing a window on the contrast between typical and worst case complexity. In these lecture notes we present an introduction to this set of ideas with older work on classical satisfiability and recent work on quantum satisfiability as primary examples. We also touch on the connection of computational hardness with the physical notion of glassiness.

cond-mat.stat-mech↗

arXiv2010

On product, generic and random generic quantum satisfiability

We report a cluster of results on k-QSAT, the problem of quantum satisfiability for k-qubit projectors which generalizes classical satisfiability with k-bit clauses to the quantum setting. First we define the NP-complete problem of product satisfiability and give a geometrical criterion for deciding when a QSAT interaction graph is product satisfiable with positive probability. We show that the same criterion suffices to establish quantum satisfiability for all projectors. Second, we apply these results to the random graph ensemble with generic projectors and obtain improved lower bounds on the location of the SAT--unSAT transition. Third, we present numerical results on random, generic satisfiability which provide estimates for the location of the transition for k=3 and k=4 and mild evidence for the existence of a phase which is satisfiable by entangled states alone.

quant-ph↗

arXiv2010

AKLT Models with Quantum Spin Glass Ground States

We study AKLT models on locally tree-like lattices of fixed connectivity and find that they exhibit a variety of ground states depending upon the spin, coordination and global (graph) topology. We find a) quantum paramagnetic or valence bond solid ground states, b) critical and ordered Néel states on bipartite infinite Cayley trees and c) critical and ordered quantum vector spin glass states on random graphs of fixed connectivity. We argue, in consonance with a previous analysis, that all phases are characterized by gaps to local excitations. The spin glass states we report arise from random long ranged loops which frustrate Néel ordering despite the lack of randomness in the coupling strengths.

cond-mat.dis-nn↗

arXiv2009

There are no Goldstone bosons on the Bethe lattice

We discuss symmetry breaking quantum phase transitions on the oft studied Bethe lattice in the context of the ferromagnetic scalar spherical model or, equivalently, the infinite $N_f$ limit of ferromagnetic models with $O(N_f)$ symmetry. We show that the approach to quantum criticality is characterized by the vanishing of a gap to just the global modes so that {\it all} local correlation functions continue to exhibit massive behavior. This behavior persists into the broken symmetry phase even as the order parameter develops an expectation value and thus there are no massless Goldstone bosons in the spectrum. We relate this feature to a spectral property of the graph Laplacian shared by the set of `expander' graphs, and argue that our results apply to symmetry breaking transitions on such graphs quite generally.

cond-mat.stat-mech↗

arXiv2009

Phase transitions and random quantum satisfiability

Alongside the effort underway to build quantum computers, it is important to better understand which classes of problems they will find easy and which others even they will find intractable. We study random ensembles of the QMA$_1$-complete quantum satisfiability (QSAT) problem introduced by Bravyi. QSAT appropriately generalizes the NP-complete classical satisfiability (SAT) problem. We show that, as the density of clauses/projectors is varied, the ensembles exhibit quantum phase transitions between phases that are satisfiable and unsatisfiable. Remarkably, almost all instances of QSAT for any hypergraph exhibit the same dimension of the satisfying manifold. This establishes the QSAT decision problem as equivalent to a, potentially new, graph theoretic problem and that the hardest typical instances are likely to be localized in a bounded range of clause density.

quant-ph↗