Publication

Continuous interpolation between the fully frustrated Ising and quantum dimer models

2011
Journal Articles

Abstract

We propose a quantum model interpolating between the fully frustrated spin-1/2 Ising model in a transverse field and a dimer model. This model contains a resonating-valence-bond phase, including a line with an exactly solvable ground state of Rokhsar-Kivelson type. We discuss the phase diagrams of this model on the square and triangular (in terms of the dimer representation) lattices.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

2011
Journal Articles

Abstract

Official source

Related concepts (25)

Interpolation

In the mathematical field of numerical analysis, interpolation is a type of estimation, a method of constructing (finding) new data points based on the range of a discrete set of known data points. In engineering and science, one often has a number of data points, obtained by sampling or experimentation, which represent the values of a function for a limited number of values of the independent variable. It is often required to interpolate; that is, estimate the value of that function for an intermediate value of the independent variable.

Polynomial interpolation

In numerical analysis, polynomial interpolation is the interpolation of a given bivariate data set by the polynomial of lowest possible degree that passes through the points of the dataset. Given a set of n + 1 data points , with no two the same, a polynomial function is said to interpolate the data if for each . There is always a unique such polynomial, commonly given by two explicit formulas, the Lagrange polynomials and Newton polynomials.

Bicubic interpolation

In mathematics, bicubic interpolation is an extension of cubic spline interpolation (a method of applying cubic interpolation to a data set) for interpolating data points on a two-dimensional regular grid. The interpolated surface (meaning the kernel shape, not the image) is smoother than corresponding surfaces obtained by bilinear interpolation or nearest-neighbor interpolation. Bicubic interpolation can be accomplished using either Lagrange polynomials, cubic splines, or cubic convolution algorithm.

Related publications (32)

Continuous interpolation between the fully frustrated Ising and quantum dimer models

Chat with Graph Search

Interpolation and Quantifiers in Ortholattices

Primary and secondary order parameters in the fully frustrated transverse-field Ising model on the square lattice

Phase diagram of the J-Jd Heisenberg model on the maple leaf lattice: Neural networks and density matrix renormalization group