اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn approximate diagonalization method for large scale Hamiltonians
136
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An approximate diagonalization method is proposed that combines exact diagonalization and perturbation expansion to calculate low energy eigenvalues and eigenfunctions of a Hamiltonian. The method involves deriving an effective Hamiltonian for each eigenvalue to be calculated, using perturbation expansion, and extracting the eigenvalue from the diagonalization of the effective Hamiltonian. The size of the effective Hamiltonian can be significantly smaller than that of the original Hamiltonian, hence the diagonalization can be done much faster. We compare the results of our method with those obtained using exact diagonalization and quantum Monte Carlo calculation for random problem instances with up to 128 qubits.
قيم البحث
اقرأ أيضاً
We study Bayesian inference methods for solving linear inverse problems, focusing on hierarchical formulations where the prior or the likelihood function depend on unspecified hyperparameters. In practice, these hyperparameters are often determined v
ia an empirical Bayesian method that maximizes the marginal likelihood function, i.e., the probability density of the data conditional on the hyperparameters. Evaluating the marginal likelihood, however, is computationally challenging for large-scale problems. In this work, we present a method to approximately evaluate marginal likelihood functions, based on a low-rank approximation of the update from the prior covariance to the posterior covariance. We show that this approximation is optimal in a minimax sense. Moreover, we provide an efficient algorithm to implement the proposed method, based on a combination of the randomized SVD and a spectral approximation method to compute square roots of the prior covariance matrix. Several numerical examples demonstrate good performance of the proposed method.
We demonstrate a method that merges the quantum filter diagonalization (QFD) approach for hybrid quantum/classical solution of the time-independent electronic Schrodinger equation with a low-rank double factorization (DF) approach for the representat
ion of the electronic Hamiltonian. In particular, we explore the use of sparse compressed double factorization (C-DF) truncation of the Hamiltonian within the time-propagation elements of QFD, while retaining a similarly compressed but numerically converged double-factorized representation of the Hamiltonian for the operator expectation values needed in the QFD quantum matrix elements. Together with significant circuit reduction optimizations and number-preserving post-selection/echo-sequencing error mitigation strategies, the method is found to provide accurate predictions for low-lying eigenspectra in a number of representative molecular systems, while requiring reasonably short circuit depths and modest measurement costs. The method is demonstrated by experiments on noise-free simulators, decoherence- and shot-noise including simulators, and real quantum hardware.
Ground states of local Hamiltonians can be generally highly entangled: any quantum circuit that generates them (even approximately) must be sufficiently deep to allow coupling (entanglement) between any pair of qubits. Until now this property was not
known to be robust - the marginals of such states to a subset of the qubits containing all but a small constant fraction of them may be only locally entangled, and hence approximable by shallow quantum circuits. In this work we construct a family of 16-local Hamiltonians for which any 1-10^{-9} fraction of qubits of any ground state must be highly entangled. This provides evidence that quantum entanglement is not very fragile, and perhaps our intuition about its instability is an artifact of considering local Hamiltonians which are not only local but spatially local. Formally, it provides positive evidence for two wide-open conjectures in condensed-matter physics and quantum complexity theory which are the qLDPC conjecture, positing the existence of good quantum LDPC codes, and the NLTS conjecture due to Freedman and Hastings positing the existence of local Hamiltonians in which any low-energy state is highly-entangled. Our Hamiltonian is based on applying the hypergraph product by Tillich and Zemor to a classical locally testable code. A key tool in our proof is a new lower bound on the vertex expansion of the output of low-depth quantum circuits, which may be of independent interest.
In this work we construct an approximate time evolution operator for a system composed by two coupled Jaynes-Cummings Hamiltonians. We express the full time evolution operator as a product of exponentials and we analyze the validity of our approximat
ions contrasting our analytical results with those obtained by purely numerical methods.
Here we focus on the measurement induced nonlocality and present a redefinition in terms of the skew information subject to a broken observable. It is shown that the obtained quantity possesses an obvious operational meaning, can tackle the noncontra
ctivity of the measurement induced nonlocality and has analytic expressions for many quantum states. Most importantly, an inverse approximate joint diagonalization algorithm, due to its simplicity, high efficiency, stability, and state independence, is presented to provide almost analytic expressions for any quantum state, which can also shed light on other aspects in physics.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
