Related papers: Cryptohermitian Hamiltonians on graphs
We study a diagonalizable Hamiltonian that is not at first hermitian. Requirement that a measurement shall not change one Hamiltonian eigenstate into another one with a different eigenvalue imposes that an inner product must be defined so…
We show how graph theory concepts can provide an insight into the origin of slow dynamics in systems with kinetic constraints. In particular, we observe that slow dynamics is related to the presence of strong hierarchies between nodes on…
Hermitian Hamiltonians with time-periodic coefficients can be analyzed via Floquet theory, and have been extensively used for engineering Floquet Hamiltonians in standard quantum simulators. Generalized to non-Hermitian Hamiltonians,…
In this paper we extend general grid graphs to the grid graphs consist of polygons tiling on a plane, named polygonal grid graphs. With a cycle basis satisfied polygons tiling, we study the cyclic structure of Hamilton graphs. A Hamilton…
We strengthen and put in a broader perspective previous results of the first two authors on colliding permutations. The key to the present approach is a new non-asymptotic invariant for graphs.
Non-hermitian systems have gained a lot of interest in recent years. However, notions of chaos and localization in such systems have not reached the same level of maturity as in the Hermitian systems. Here, we consider non-hermitian…
In this paper we discuss constraints on two-dimensional quantum-mechanical systems living in domains with boundaries. The constrains result from the requirement of hermicity of corresponding Hamiltonians. We construct new two-dimensional…
Crystalline symmetries give rise to topological invariants that can distinguish quantum phases of matter. Understanding these in strongly interacting systems is an ongoing research direction requiring non-perturbative methods. Recent…
The quantization of classical theories that admit more than one Hamiltonian description is considered. This is done from a geometrical viewpoint, both at the quantization level (geometric quantization) and at the level of the dynamics of…
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with linear degrees and a $d$-dimensional random geometric graph $G^d(n,r)$, for any $d\geq1$. We obtain an asymptotically optimal bound on the…
Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schr\"odinger Hamiltonians on metric graphs, with a focus on results related to…
We provide a polynomial time algorithm to determine a cubic bipartite graph has a hamilton cycle or not.
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total…
Chaotic behavior or lack thereof in non-Hermitian systems is often diagnosed via spectral analysis of associated complex eigenvalues. Very recently, singular values of the associated non-Hermitian systems have been proposed as an effective…
In most introductory courses on quantum mechanics one is taught that the Hamiltonian operator must be Hermitian in order that the energy levels be real and that the theory be unitary (probability conserving). To express the Hermiticity of a…
We demonstrate that quantum fluctuations can cause, under certain conditions, the dynamical instability of pure states that can result in their evolution into mixed states. It is shown that the degree and type of such an instability are…
The powerful group theoretical formalism of potential algebras is extended to non-Hermitian Hamiltonians with real eigenvalues by complexifying so(2,1), thereby getting the complex algebra sl(2,\C) or $A_1$. This leads to new types of both…
The metric associated with a quasi-Hermitian Hamiltonian and its physical implications are scrutinised. Consequences of the non-uniqueness such as the question of the probability interpretation and the possible and forbidden choices of…
Recently (see quant-ph/0503040) an explicit example has been given of a PT-symmetric non-diagonalizable Hamiltonian. In this paper we show that such Hamiltonians appear as supersymmetric (SUSY) partners of Hermitian (hence diagonalizable)…
We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…