Infinite boundary conditions for matrix product state calculations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix product state representations

This work gives a detailed investigation of matrix product state (MPS) representations for pure multipartite quantum states. We determine the freedom in representations with and without translation symmetry, derive respective canonical forms and provide efficient methods for obtaining them. Results on frustration free Hamiltonians and the generation of MPS are extended, and the use of the MPS-r...

متن کامل

Boundary conditions at spatial infinity for fields in Casimir calculations

The importance of imposing proper boundary conditions for fields at spatial infinity in the Casimir calculations is elucidated. PACS numbers: 11.10.Gh; 42.50.Pq; 03.70.+k; 03.65.Sq, 11.30.Ly

متن کامل

Matrix Albedo for Discrete Ordinates Infinite-medium Boundary Condition

Discrete ordinates problems with an infinite exterior medium (reflector) can be more efficiently computed by eliminating grid cells in the exterior medium and applying a matrix albedo boundary condition. The albedo matrix is a discretized bidirectional reflection distribution function (BRDF) that accounts for the angular quadrature set, spatial quadrature method, and spatial grid that would hav...

متن کامل

Matrix product states for dynamical simulation of infinite chains.

We propose a new method for computing the ground state properties and the time evolution of infinite chains based on a transverse contraction of the tensor network. The method does not require finite size extrapolation and avoids explicit truncation of the bond dimension along the evolution. By folding the network in the time direction prior to contraction, time-dependent expectation values and...

متن کامل

Infinite-state games with finitary conditions

We study two-player zero-sum games over infinite-state graphs with boundedness conditions. Our first contribution is about the strategy complexity, i.e the memory required for winning strategies: we prove that over general infinite-state graphs, memoryless strategies are sufficient for finitary Büchi games, and finite-memory suffices for finitary parity games. We then study pushdown boundedness...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review B

سال: 2012

ISSN: 1098-0121,1550-235X

DOI: 10.1103/physrevb.86.245107