Related papers: Generalized Householder Transformations for the Co…
The Hilbert space in PT-symmetric quantum mechanics is formulated as a linear vector space with a dynamic inner product. The most general PT-symmetric matrix Hamiltonians are constructed for 2*2 and 3*3 cases. In the former case, the…
We give two characterization theorems for pseudo-Hermitian (possibly nondiagonalizable) Hamiltonians with a discrete spectrum that admit a block-diagonalization with finite-dimensional diagonal blocks. In particular, we prove that for such…
We study certain linear and antilinear symmetry generators and involution operators associated with pseudo-Hermitian Hamiltonians and show that the theory of pseudo-Hermitian operators provides a simple explanation for the recent results of…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…
We show that similarity (or equivalent) transformations enable one to construct non-Hermitian operators with real spectrum. In this way we can also prove and generalize the results obtained by other authors by means of a gauge-like…
Non-Hermitian generalized eigenvalue problems (GEPs) play a significant role in many practical applications, such as mechanical engineering. Based on the generalized Schur decomposition, we propose a variational quantum algorithm for…
The Householder transformation, allowing a rewrite of probabilities into expectations of dichotomic observables, is generalized in terms of its spectral decomposition. The dichotomy is modulated by allowing more than one negative eigenvalue…
Three ways of constructing a non-Hermitian matrix with possible all real eigenvalues are discussed. They are PT symmetry, pseudo-Hermiticity, and generalized PT symmetry. Parameter counting is provided for each class. All three classes of…
We calculate the eigenvalues of some two-dimensional non-Hermitian Hamiltonians by means of a pseudospectral method and straightforward diagonalization of the Hamiltonian matrix in a suitable basis set. Both sets of results agree remarkably…
We present and analyze a simple numerical method that diagonalizes a complex normal matrix A by diagonalizing the Hermitian matrix obtained from a random linear combination of the Hermitian and skew-Hermitian parts of A.
We consider the transformation of Hamilton operators under various sets of quantum operations acting simultaneously on all adjacent pairs of particles. We find mappings between Hamilton operators analogous to duality transformations as well…
We study conformal field theories (CFTs) and their classifications from a modern perspective based on the abstract algebraic formalism of symmetries or conserved charges, known as symmetry topological field theories (SymTFTs). By studying…
Hashing is at the heart of large-scale image similarity search, and recent methods have been substantially improved through deep learning techniques. Such algorithms typically learn continuous embeddings of the data. To avoid a subsequent…
A theory of transformation is presented for the diagonalization of a Hamiltonian that is quadratic in creation and annihilation operators or in coordinates and momenta. It is the systemization and theorization of Dirac and…
Update: A time-independent $n\times n$ PT-symmetric (and symmetric) Hamiltonian is diagonalizable since it has all distinct real eigenvalues and the resulting diagonal matrix is a real symmetric matrix. The diagonalization results an…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
In the popular ${\cal PT}-$symmetry-based formulation of quantum mechanics of closed systems one can build unitary models using non-Hermitian Hamiltonians (i.e., $H \neq H^\dagger$) which are Hermitizable (so that one can write,…
Quantum inverse problem is defined as how to determine a local Hamiltonian from a single eigenstate? This question is valid not only in Hermitian system but also in non-Hermitian system. So far, most attempts are limited to Hermitian…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
Many problems in linear algebra -- such as those arising from non-Hermitian physics and differential equations -- can be solved on a quantum computer by processing eigenvalues of the non-normal input matrices. However, the existing Quantum…