The problem of calculating the eigensystem of a general complex matrix is well known. In many cases, however, the eigensystem is poorly determined numerically in the sense that small changes in the ...

Let X, Y be two subspaces of summability domains of matrices with real or complex entries determined by speeds of the convergence, i.e.; by monotonically increasing positive sequences λ and μ. In this ...

Abstract: This paper focuses on optimizing the Matrix-Power Kernel (MPK), which relies on a series of Sparse Matrix-Vector multiplications (SpMVs) using the same sparse matrix. MPK is a crucial ...

Abstract: Multi-view Subspace Clustering (MVSC) effectively aggregating multiple data sources to promise clustering performance. Recently, various anchor-based variants have been introduced to ...

This study demonstrates how integrating decoherence-free subspaces with dynamical decoupling enhances quantum state fidelity, offering a practical route to more noise-resilient quantum computing ...

In a study published in Reports on Progress in Physics, research teams led by Academician GUO Guangcan and Prof. LIU Biheng from the University of Science and Technology of China (USTC) of the Chinese ...