Engineering Papers⌕ Search

Engineering topics

Hastings, Matthew B

Publications and source records attributed to Hastings, Matthew B.

Topological quantum order: Stability under local perturbations

We study zero-temperature stability of topological phases of matter under weak time-independent perturbations. Our results apply to quantum spin Hamiltonians that can be written as a sum of geometrically local commuting projectors on a D-dimensional lattice with certain topological order conditions. Given such a Hamiltonian H{sub 0}, we prove that there exists a constant threshold {epsilon}>0 such that for any perturbation V representable as a sum of short-range bounded-norm interactions, the perturbed Hamiltonian H=H{sub 0}+{epsilon}V has well-defined spectral bands originating from low-lying eigenvalues of H{sub 0}. These bands are separated from the rest of the spectra and from each other by a constant gap. The band originating from the smallest eigenvalue of H{sub 0} has exponentially small width (as a function of the lattice size). Our proof exploits a discrete version of Hamiltonian flow equations, the theory of relatively bounded operators, and the Lieb-Robinson bound.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Light-cone matrix product

We show how to combine the light-cone and matrix product algorithms to simulate quantum systems far from equilibrium for long times. For the case of the XXZ spin chain at {delta}=0.5, we simulate to a time of {approx_equal}22.5. While part of the long simulation time is due to the use of the light-cone method, we also describe a modification of the infinite time-evolving bond decimation algorithm with improved numerical stability, and we describe how to incorporate symmetry into this algorithm. While statistical sampling error means that we are not yet able to make a definite statement, the behavior of the simulation at long times indicates the appearance of either 'revivals' in the order parameter as predicted by Hastings and Levitov (e-print arXiv:0806.4283) or of a distinct shoulder in the decay of the order parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Making almost commuting matrices commute

Suppose two Hermitian matrices A, B almost commute ({parallel}[A,B]{parallel} {<=} {delta}). Are they close to a commuting pair of Hermitian matrices, A', B', with {parallel}A-A'{parallel},{parallel}B-B'{parallel} {<=} {epsilon}? A theorem of H. Lin shows that this is uniformly true, in that for every {epsilon} > 0 there exists a {delta} > 0, independent of the size N of the matrices, for which almost commuting implies being close to a commuting pair. However, this theorem does not specifiy how {delta} depends on {epsilon}. We give uniform bounds relating {delta} and {epsilon}. The proof is constructive, giving an explicit algorithm to construct A' and B'. We provide tighter bounds in the case of block tridiagonal and tridiagnonal matrices. Within the context of quantum measurement, this implies an algorithm to construct a basis in which we can make a projective measurement that approximately measures two approximately commuting operators simultaneously. Finally, we comment briefly on the case of approximately measuring three or more approximately commuting operators using POVMs (positive operator-valued measures) instead of projective measurements.

99 GENERAL AND MISCELLANEOUS↗

Inference from matrix products: a heuristic spin glass algorithm

We present an algorithm for finding ground states of two-dimensional spin-glass systems based on ideas from matrix product states in quantum information theory. The algorithm works directly at zero temperature and defines an approximation to the energy whose accuracy depends on a parameter k. We test the algorithm against exact methods on random field and random bond Ising models, and we find that accurate results require a k which scales roughly polynomially with the system size. The algorithm also performs well when tested on small systems with arbitrary interactions, where no fast, exact algorithms exist. The time required is significantly less than Monte Carlo schemes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Infinitely many kinds of quantum channels

We define the ability of a quantum channel to simulate another by means of suitable encoding and decoding operations. While classical channels have only two equivalence classes under simulation (channels with non-vanishing capacity and those with vanishing capacity), we show that there are an uncountable infinity of different equivalence classes of quantum channels using the example of the quantum erasure channel. Our results also imply a kind of 'Matthew principle' for error correction on certain channels.

99 GENERAL AND MISCELLANEOUS↗