2000 character limit reached
Hermitian dynamics in a class of pseudo-Hermitian networks
Published 21 Jul 2011 in quant-ph | (1107.4311v2)
Abstract: We investigate the connection between pseudo-Hermitian and Hermitian descriptions for a lattice, which consists of a set of isomorphic pseudo-Hermitian clusters. We show that such non-Hermitian systems can act as Hermitian systems. This is made possible by considering the dynamics of a state involving the superposition of a single eigenmode of each isomorphic clusters. It still holds when multiple eigenmodes are involved when additional restriction on the state is imposed. This Hermitian dynamics is demonstrated for the case of an exactly solvable PT-symmetric ladder system.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.