Related papers: Iterative methods for computing U-eigenvalues of n…
This paper is concerned with the nonnegative inverse eigenvalue problem of finding a nonnegative matrix such that its spectrum is the prescribed self-conjugate set of complex numbers. We first reformulate the nonnegative inverse eigenvalue…
Ever since entanglement was identified as a computational and cryptographic resource, effort has been made to find an efficient way to tell whether a given density matrix represents an unentangled, or separable, state. Essentially, this is…
This paper studies how to compute all real eigenvalues of a symmetric tensor. As is well known, the largest or smallest eigenvalue can be found by solving a polynomial optimization problem, while the other middle eigenvalues can not. We…
We propose an algorithm for general nonlinear eigenvalue problems to compute physically relevant eigenvalues within a chosen contour. Eigenvalue information is explored by contour integration incorporating different weight functions. The…
We ask the question whether for a given unitary representation $U$ the associated operator $\rho_{U}\in\operatorname{Mor}(U,U^{c\, c})$ has spectrum invariant under inversion -- in this case we say that $\rho_{U}$ has symmetric eigenvalues.…
We present a variational algorithm for fault tolerant quantum computing to solve a system of linear equations which directly maximises the parameters of the target fidelity. This so-called measurement test algorithm can be applied to any…
In this article we are interested for the numerical study of nonlinear eigenvalue problems. We begin with a review of theoretical results obtained by functional analysis methods, especially for the Schrodinger pencils. Some recall are given…
This paper studies tensor eigenvalue complementarity problems. Basic properties of standard and complementarity tensor eigenvalues are discussed. We formulate tensor eigenvalue complementarity problems as constrained polynomial…
Several tensor eigenpair definitions have been put forth in the past decade, but these can all be unified under generalized tensor eigenpair framework, introduced by Chang, Pearson, and Zhang (2009). Given mth-order, n-dimensional…
We present a new framework for computing Z-eigenvectors of general tensors based on numerically integrating a dynamical system that can only converge to a Z-eigenvector. Our motivation comes from our recent research on spacey random walks,…
In this short note, we present a novel method for computing exact lower and upper bounds of eigenvalues of a symmetric tridiagonal interval matrix. Compared to the known methods, our approach is fast, simple to present and to implement, and…
This paper presents a novel and efficient approach for the computation of energy eigenvalues in quantum semiconductor heterostructures. Accurate determination of the electronic states in these heterostructures is crucial for understanding…
The quantum model of a cluster, consisting of A identical particles, coupled by the internal pair interactions and affected by the external field of a target, is considered. A symbolic-numerical algorithm for generating A-1-dimensional…
Entanglement forging based variational algorithms leverage the bi-partition of quantum systems for addressing ground state problems. The primary limitation of these approaches lies in the exponential summation required over the numerous…
We present an index-based tensorial formulation for computing eigenvalues of charge operators acting on arbitrary tensor representations of unitary gauge groups. The construction follows directly from the action of Cartan generators on…
In this paper, the concepts of Pareto $H$-eigenvalue and Pareto $Z$-eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a…
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 consider the eigenvectors of symmetric matrices with independent heavy tailed entries, such as matrices with entries in the domain of attraction of $\alpha$-stable laws, or adjacencymatrices of Erdos-Renyi graphs. We denote by…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
A method allowing to increase a computational efficiency of evaluation of non-local characteristics of a pair of qubits is described. The method is based on the construction of coordinates on a generic section of 2-qubit's entanglement…