pith. sign in

arxiv: 1110.3646 · v2 · pith:JEMRQB2Qnew · submitted 2011-10-17 · 🪐 quant-ph · cond-mat.str-el

Density Matrix Recursion Method: Genuine Multisite Entanglement Distinguishes Odd from Even Quantum Heisenberg Ladders

classification 🪐 quant-ph cond-mat.str-el
keywords methoddensityentanglementarbitrarybipartitegenuineladderladders
0
0 comments X
read the original abstract

We introduce an analytical iterative method, the density matrix recursion method, to generate arbitrary reduced density matrices of superpositions of short-range dimer coverings on periodic or non-periodic quantum spin-1/2 ladder lattices, with an arbitrary number of legs. The method can be used to calculate bipartite as well as multipartite physical properties, including bipartite and multi-partite entanglement. We apply this technique to distinguish between even- and odd-legged ladders. Specifically, we show that while genuine multi-partite entanglement decreases with increasing system size for the even-legged ladder states, it does the opposite for odd-legged ones.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.