Related papers: How to Test for Diagonalizability: The Discretized…
The entanglement characteristics of two qubits are encoded in the invariants of the adjoint action of SU(2) x SU(2) group on the space of density matrices defined as the space of positive semi-definite Hermitian matrices. The corresponding…
Quantum tunneling across double potential barriers is studied. With the assumption that the real space is a continuum, it is rigorously proved that large barriers of arbitrary shapes can be penetrated by low-energy particles with a…
We introduce right eigenvalues and subeigenvalues for square dual complex matrices. An $n \times n$ dual complex Hermitian matrix has exactly $n$ right eigenvalues and subeigenvalues, which are all real. The Hermitian matrix is positive…
In order to obtain stable and accurate general relativistic simulations, re-formulations of the Einstein equations are necessary. In a series of our works, we have proposed using eigenvalue analysis of constraint propagation equations for…
Matrix polynomials with unitary/doubly stochastic coefficients form the subject matter of this manuscript. We prove that if $P(\lambda)$ is a quadratic matrix polynomial whose coefficients are either unitary matrices or doubly stochastic…
Quantum Krylov subspace diagonalization is a prominent candidate for early fault tolerant quantum simulation of many-body and molecular systems, but so far the focus has been mainly on computing ground-state energies. We go beyond this by…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…
When can one change the diagonal of a matrix without changing its spectrum? We completely answer this question over an algebraically closed field of characteristic zero or larger than the size of the matrix: An $n \times n$ matrix $A$…
The family of complex PT-symmetric sextic potentials is studied to show that for various cases the system is essentially quasi-solvable and possesses real, discrete energy eigenvalues. For a particular choice of parameters, we find that…
In this paper, we introduce properly-invariant diagonality measures of Hermitian positive-definite matrices. These diagonality measures are defined as distances or divergences between a given positive-definite matrix and its diagonal part.…
We give an explicit example of an exactly solvable PT-symmetric Hamiltonian with the unbroken PT symmetry which has one eigenfunction with the zero PT-norm. The set of its eigenfunctions is not complete in corresponding Hilbert space and it…
This paper proposes novel methods to test for simultaneous diagonalization of possibly asymmetric matrices. Motivated by various applications, a two-sample test as well as a generalization for multiple matrices are proposed. A partial…
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…
We are interested in finding a nonlinear polynomial $P$ on $\mathbb{R}^n$ that solves the minimal surface equation. Even though no explicit solution is found in this article, we investigate constraints that a polynomial solution must obey.…
Recent developments in the theory of production networks offer interesting applications and revival of input-output analysis. Some recent papers have studied the propagation of a temporary, negative shock through an input-output network.…
The two-by-two Sp(2) matrix has three parameters with unit determinant. Yet, there are no established procedures for diagonalizing this matrix. It is shown that this matrix can be written as a similarity transformation of the two-by-two…
Given a polynomial matrix P(x) of grade g and a rational function $x(y) = n(y)/d(y)$, where $n(y)$ and $d(y)$ are coprime nonzero scalar polynomials, the polynomial matrix $Q(y) :=[d(y)]^gP(x(y))$ is defined. The complete eigenstructures of…
Squared tensor networks (TNs) and their extension as computational graphs--squared circuits--have been used as expressive distribution estimators, yet supporting closed-form marginalization. However, the squaring operation introduces…
We seek to derive the probability--expressed in terms of the Hilbert-Schmidt (Euclidean or flat) metric--that a generic (nine-dimensional) real two-qubit system is separable, by implementing the well-known Peres-Horodecki test on the…