اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA CMV--based eigensolver for companion matrices
160
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a companion matrix we design a fast and computationally simple structured QR iteration.
قيم البحث
اقرأ أيضاً
Companion matrices of the second type are characterized by properties that involve bilinear maps.
Reflectionless CMV matrices are studied using scattering theory. By changing a single Verblunsky coefficient a full-line CMV matrix can be decoupled and written as the sum of two half-line operators. Explicit formulas for the scattering matrix associ
ated to the coupled and decoupled operators are derived. In particular, it is shown that a CMV matrix is reflectionless iff the scattering matrix is off-diagonal which in turn provides a short proof of an important result of [Breuer-Ryckman-Simon]. These developments parallel those recently obtained for Jacobi matrices.
Contour integration schemes are a valuable tool for the solution of difficult interior eigenvalue problems. However, the solution of many large linear systems with multiple right hand sides may prove a prohibitive computational expense. The number of
right hand sides, and thus, computational cost may be reduced if the projected subspace is created using multiple moments. In this work, we explore heuristics for the choice and application of moments with respect to various other important parameters in a contour integration scheme. We provide evidence for the expected performance, accuracy, and robustness of various schemes, showing that good heuristic choices can provide a scheme featuring good properties in all three of these measures.
We consider the spectral and dynamical properties of one-dimensional quantum walks placed into homogenous electric fields according to a discrete version of the minimal coupling principle. We show that for all irrational fields the absolutely continu
ous spectrum of these systems is empty, and prove Anderson localization for almost all (irrational) fields. This result closes a gap which was left open in the original study of electric quantum walks: a spectral and dynamical characterization of these systems for typical fields. Additionally, we derive an analytic and explicit expression for the Lyapunov exponent of this model. Making use of a connection between quantum walks and CMV matrices our result implies Anderson localization for CMV matrices with a particular choice of skew-shift Verblunsky coefficients as well as for quasi-periodic unitary band matrices.
Solving eigenvalue problems is crucially important for both classical and quantum applications. Many well-known numerical eigensolvers have been developed, including the QR and the power methods for classical computers, as well as the quantum phase e
stimation(QPE) method and the variational quantum eigensolver for quantum computers. In this work, we present an alternative type of quantum method that uses fixed-point quantum search to solve Type II eigenvalue problems. It serves as an important complement to the QPE method, which is a Type I eigensolver. We find that the effectiveness of our method depends crucially on the appropriate choice of the initial state to guarantee a sufficiently large overlap with the unknown target eigenstate. We also show that the quantum oracle of our query-based method can be efficiently constructed for efficiently-simulated Hamiltonians, which is crucial for analyzing the total gate complexity. In addition, compared with the QPE method, our query-based method achieves a quadratic speedup in solving Type II problems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
