A query‐based quantum eigensolver

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On a parallel Maxwell eigensolver

Fast domain decomposition solver for internal problems of 3D hierarchical hp-FEM I. Anoufriev, V. Korneev Deriving fast domain decomposition (DD) preconditioners-solvers for hp discretizations of 2-nd order elliptic equations is still a challenge [1], although one pioneering solver of this type has been recently presented in [2] and generalized on adaptive hp discretizations in [3]. As it is we...

متن کامل

A Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation

The Jacobi-Davidson (JD) algorithm recently has gained popularity for finding a few selected interior eigenvalues of large sparse polynomial eigenvalue problems, which commonly appear in many computational science and engineering PDE based applications. As other inner–outer algorithms like Newton type method, the bottleneck of the JD algorithm is to solve approximately the inner correction equa...

متن کامل

Towards a Parallel Multilevel Preconditioned Maxwell Eigensolver

We report on a parallel implementation of the Jacobi–Davidson (JD) to compute a few eigenpairs of a large real symmetric generalized matrix eigenvalue problem

متن کامل

A Parallel Eigensolver for Dense Symmetric Matrices*

We describe a parallel algorithm for finding the eigenvalues and eigenvectors of a dense symmetric matrix. We follow the traditional three step process: we reduce the dense matrix to tridiagonal form, solve the tridiagonal problem then backtransform the result. Since the different steps have different algorithmic characteristics, this problem serves as an perfect vehicle for exploring some issu...

متن کامل

A new highly parallel non-Hermitian eigensolver

Calculating portions of eigenvalues and eigenvectors of matrices or matrix pencils has many applications. An approach to this calculation for Hermitian problems based on a density matrix has been proposed in 2009 and a software package called FEAST has been developed. The density-matrix approach allows FEAST’s implementation to exploit a key strength of modern computer architectures, namely, mu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Engineering

سال: 2020

ISSN: 2577-0470,2577-0470

DOI: 10.1002/que2.49