Functional renormalization group for non-Hermitian and $\mathcal{PT}$ -symmetric systemsFunctional renormalization group for non-Hermitian and $\mathcal{PT}$-symmetric systems

Lukas Grunwald

We generalize the vertex expansion approach of the functional renormalization group to non-Hermitian systems. As certain anomalous expectation values might not vanish, additional terms as compared to the Hermitian case can appear in the flow equations. We investigate the merits and shortcomings of the vertex expansion for non-Hermitian systems by considering an exactly solvable $\mathcal{PT}$ -symmetric non-linear toy-model and reveal, that in this model, the fidelity of the vertex expansion in a perturbatively motivated truncation schema is comparable with that of the Hermitian case. The vertex expansion appears to be a viable method for studying correlation effects in non-Hermitian systems.We generalize the vertex expansion approach of the functional renormalization group to non-Hermitian systems. As certain anomalous expectation values might not vanish, additional terms as compared to the Hermitian case can appear in the flow equations. We investigate the merits and shortcomings of the vertex expansion for non-Hermitian systems by considering an exactly solvable $\mathcal{PT}$-symmetric non-linear toy-model and reveal, that in this model, the fidelity of the vertex expansion in a perturbatively motivated truncation schema is comparable with that of the Hermitian case. The vertex expansion appears to be a viable method for studying correlation effects in non-Hermitian systems.

May 1, 20227 citations

The Eight-Vertex Model

David A. Lavis, G. M. Bell

Springer eBooksJan 1, 19993 citations

Fast Decoding of Expander Codes

Michael C. Dowling, Shuhong Gao

Expander codes are Tanner codes defined on sparse graphs that have good expansion properties. Sipser and Spielman (1996) showed that there is a linear-time decoding algorithm for expander codes when the vertex expansion is at least 3/4 and the number of errors corrected is a constant fraction of the code length. Later, Feldman et al. (2007) gave a decoding algorithm that allows the expansion to be 2/3 + 1/(3c), where $c$ is the left degree of the underlying bipartite graph, at the expense of polynomial-time decoding complexity. Recently, Viderman (2013) further improved the expansion parameter to $2/3 - 1/(6c)$ , and the decoding algorithm runs in linear time. These results are for expander codes whose inner codes are parity-check codes. By using stronger inner codes, Chilappagari et al. (2010) showed that there is a linear-time decoding algorithm for every vertex expansion greater than 1/2. In this paper, it is shown that for every vertex expansion, there is a linear-time decoding algorithm for expander codes (using inner codes with minimum distance depending on the vertex expansion), and that the number of errors corrected is a constant fraction of the code length.Expander codes are Tanner codes defined on sparse graphs that have good expansion properties. Sipser and Spielman (1996) showed that there is a linear-time decoding algorithm for expander codes when the vertex expansion is at least 3/4 and the number of errors corrected is a constant fraction of the code length. Later, Feldman et al. (2007) gave a decoding algorithm that allows the expansion to be 2/3 + 1/(3c), where $c$ is the left degree of the underlying bipartite graph, at the expense of polynomial-time decoding complexity. Recently, Viderman (2013) further improved the expansion parameter to $2/3 - 1/(6c)$ , and the decoding algorithm runs in linear time. These results are for expander codes whose inner codes are parity-check codes. By using stronger inner codes, Chilappagari et al. (2010) showed that there is a linear-time decoding algorithm for every vertex expansion greater than 1/2. In this paper, it is shown that for every vertex expansion, there is a linear-time decoding algorithm for expander codes (using inner codes with minimum distance depending on the vertex expansion), and that the number of errors corrected is a constant fraction of the code length.

IEEE Transactions on Information TheoryJul 12, 20174 citations

The Odd Eight-Vertex Model

Fa Yueh Wu, H. Kunz

arXiv:cond-mat/0303303Journal of Statistical PhysicsAug 1, 200410 citations

Functional renormalization group for non-Hermitian and $\mathcal{PT}$ -symmetric systemsFunctional renormalization group for non-Hermitian and $\mathcal{PT}$-symmetric systems

Lukas Grunwald, V. Meden, Dante Marvin Kennes

We generalize the vertex expansion approach of the functional renormalization group to non-Hermitian systems. As certain anomalous expectation values might not vanish, additional terms as compared to the Hermitian case can appear in the flow equations. We investigate the merits and shortcomings of the vertex expansion for non-Hermitian systems by considering an exactly solvable \mathcal{PT} 𝒫 𝒯 -symmetric non-linear toy-model and reveal, that in this model, the fidelity of the vertex expansion in a perturbatively motivated truncation schema is comparable with that of the Hermitian case. The vertex expansion appears to be a viable method for studying correlation effects in non-Hermitian systems.We generalize the vertex expansion approach of the functional renormalization group to non-Hermitian systems. As certain anomalous expectation values might not vanish, additional terms as compared to the Hermitian case can appear in the flow equations. We investigate the merits and shortcomings of the vertex expansion for non-Hermitian systems by considering an exactly solvable \mathcal{PT} 𝒫 𝒯 -symmetric non-linear toy-model and reveal, that in this model, the fidelity of the vertex expansion in a perturbatively motivated truncation schema is comparable with that of the Hermitian case. The vertex expansion appears to be a viable method for studying correlation effects in non-Hermitian systems.

arXiv:2203.08108SciPost PhysicsMay 30, 20220 citations

Functional renormalization group for non-Hermitian and

\mathcal{PT}

-symmetric systems

\mathcal{PT}

-symmetric non-linear toy-model and reveal, that in this model, the fidelity of the vertex expansion in a perturbatively motivated truncation schema is comparable with that of the Hermitian case. The vertex expansion appears to be a viable method for studying correlation effects in non-Hermitian systems.

c

is the left degree of the underlying bipartite graph, at the expense of polynomial-time decoding complexity. Recently, Viderman (2013) further improved the expansion parameter to

2/3 - 1/(6c)

, and the decoding algorithm runs in linear time. These results are for expander codes whose inner codes are parity-check codes. By using stronger inner codes, Chilappagari et al. (2010) showed that there is a linear-time decoding algorithm for every vertex expansion greater than 1/2. In this paper, it is shown that for every vertex expansion, there is a linear-time decoding algorithm for expander codes (using inner codes with minimum distance depending on the vertex expansion), and that the number of errors corrected is a constant fraction of the code length.

Functional renormalization group for non-Hermitian and

\mathcal{PT}

-symmetric systems