Related papers: Solution of the Matrix Hamiltonians via asymptotic…
In this note, we propose a symplectic algorithm for the stable manifolds of the Hamilton-Jacobi equations combined with an iterative procedure in [Sakamoto-van~der Schaft, IEEE Transactions on Automatic Control, 2008]. Our algorithm…
A powerful method for calculating the eigenvalues of a Hamiltonian operator consists of converting the energy eigenvalue equation into a matrix equation by means of an appropriate basis set of functions. The convergence of the method can be…
Adiabatic elimination is a standard tool in quantum optics, which produces an effective Hamiltonian for a relevant subspace of states, incorporating effects of its coupling to states with much higher unperturbed energy. It shares with…
Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorithms" performs when we apply it to solve the Eigen-Problem of…
A generalization of the quantum Rabi model is obtained by replacing the linear (dipole) coupling between the two-level system and the radiation mode by a non-linear expression in the creation and annihilation operators, corresponding to…
Finding eigenvalue distributions for a number of sparse random matrix ensembles can be reduced to solving nonlinear integral equations of the Hammerstein type. While a systematic mathematical theory of such equations exists, it has not been…
It has been argued that despite remarkable success, existing random matrix theories are not adequate to describe disordered conductors in the metallic regime, due to the presence of certain two-body interactions in the effective Hamiltonian…
In this paper we propose a systematic method to solve the inverse dynamical problem for a quantum system governed by the von Neumann equation: to find a class of Hamiltonians reproducing a prescribed time evolution of a pure or mixed state…
Quantum algorithms for solving linear systems of equations have generated excitement because of the potential speed-ups involved and the importance of solving linear equations in many applications. However, applying these algorithms can be…
Complex valued systems with an indefinite matrix term arise in important applications such as for certain time-harmonic partial differential equations such as the Maxwell's equation and for the Helmholtz equation. Complex systems with…
Quantum algorithms have been developed for efficiently solving linear algebra tasks. However, they generally require deep circuits and hence universal fault-tolerant quantum computers. In this work, we propose variational algorithms for…
We use generalized Chebyshev polynomials, associated with the root system $A_2$, to provide a new semi-iterative method for accelerating simple iterative methods for solving linear systems. We apply this semi-iterative method to the Jacobi…
In this article, we study and settle several structural questions concerning the exact solvability of the Olshanetsky-Perelomov quantum Hamiltonians corresponding to an arbitrary root system. We show that these operators can be written as…
In this paper we give the asymptotic behavior of type I multiple orthogonal polynomials for a Nikishin system of order two with two disjoint intervals. We use the Riemann-Hilbert problem for multiple orthogonal polynomials and the steepest…
In this paper, we introduce a randomized algorithm for solving the non-symmetric eigenvalue problem, referred to as randomized Implicitly Restarted Arnoldi (rIRA). This method relies on using a sketch-orthogonal basis during the Arnoldi…
Analytic interpolation problems with rationality and derivative constraints occur in many applications in systems and control. In this paper we present a new method for the multivariable case, which generalizes our previous results on the…
We transform the problem of solving linear system of equations $A\mathbf{x}=\mathbf{b}$ to a problem of finding the right singular vector with singular value zero of an augmented matrix $C$, and present two quantum algorithms for solving…
The notions of weak and strong minimizability of a matrix intertwining operator are introduced. Criterion of strong minimizability of a matrix intertwining operator is revealed. Criterion and sufficient condition of existence of a constant…
We report a new analytical method for solution of a wide class of second-order differential equations with eigenvalues replaced by arbitrary functions. Such classes of problems occur frequently in Quantum Mechanics and Optics. This approach…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support an infinite tridiagonal matrix representation of the wave operator. The class of solutions obtained as such…