Related papers: Generalized Householder Transformations for the Co…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
Exactly-solvable Hamiltonians that can be diagonalized using relatively simple unitary transformations are of great use in quantum computing. They can be employed for decomposition of interacting Hamiltonians either in Trotter-Suzuki…
In the context of the factorization method, we investigate the pseudo- Hermitian coherent states and its Hermitian counterpart coherent states under the generalized quantum condition in the framework of a position-dependent mass. By…
We examine the properties and consequences of pseudo-supersymmetry for quantum systems admitting a pseudo-Hermitian Hamiltonian. We explore the Witten index of pseudo-supersymmetry and show that every pair of diagonalizable (not necessarily…
In the presence of Lindblad decoherence, i.e. dissipative effects in an open quantum system due to interaction with an environment, we examine the transition probabilities between the eigenstates in the two-level quantum system described by…
We propose a quantum algorithm for finding eigenvalues of non-unitary matrices. We show how to construct, through interactions in a quantum system and projective measurements, a non-Hermitian or non-unitary matrix and obtain its eigenvalues…
This paper presents a fast, randomized divide-and-conquer algorithm for the definite generalized eigenvalue problem, which corresponds to pencils $(A,B)$ in which $A$ and $B$ are Hermitian and the Crawford number $\gamma(A,B) =…
Exact diagonalization is a powerful numerical method to study isolated quantum many-body systems. This paper provides a review of numerical algorithms to diagonalize the Hamiltonian matrix. Symmetry and the conservation law help us perform…
Quantum Signal Processing (QSP) and Quantum Singular Value Transformation (QSVT) provide an efficient framework for implementing polynomials of block-encoded matrices, and thus offer a systematic approach to quantum algorithm design.…
We propose a fault-tolerant implementation of the quantum Householder reflection, which is a key operation in various quantum algorithms, quantum-state engineering, generation of arbitrary unitaries, and entanglement characterization. We…
We survey some of the main conceptual developments in the study of PT-symmetric and pseudo-Hermitian Hamiltonian operators that have taken place during the past ten years or so. We offer a precise mathematical description of a quantum…
This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…
In recent decades, an important shift has taken place with the growing role of non-Hermitian quantum mechanics. What makes this framework remarkable is that the eigenvalues of the Hamiltonians involved can still be real, just as in the…
In this work we revisit the arithmetic and bit complexity of Hermitian eigenproblems. Recently, [BGVKS, FOCS 2020] proved that a (non-Hermitian) matrix can be diagonalized with a randomized algorithm in $O(n^{\omega}\log^2(n/\epsilon))$…
The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean…
Quasi-Hermitian quantum systems, including $\mathcal{PT}$-symmetric ones, can be mapped to equivalent Hermitian systems via a similarity transformation that redefines the inner product with a positive-definite metric operator. Although an…
An approximate method is suggested to obtain analytical expressions for the eigenvalues and eigenfunctions of the some quantum optical models. The method is based on the Lie-type transformation of the Hamiltonians. In a particular case it…
This work presents a novel approach to compute the eigenvalues of non-Hermitian matrices using an enhanced shifted QR algorithm. The existing QR algorithms fail to converge early in the case of non-hermitian matrices, and our approach shows…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian…