Generalized James' effective Hamiltonian method
نویسندگان
چکیده
منابع مشابه
An iterative method for the Hermitian-generalized Hamiltonian solutions to the inverse problem AX=B with a submatrix constraint
In this paper, an iterative method is proposed for solving the matrix inverse problem $AX=B$ for Hermitian-generalized Hamiltonian matrices with a submatrix constraint. By this iterative method, for any initial matrix $A_0$, a solution $A^*$ can be obtained in finite iteration steps in the absence of roundoff errors, and the solution with least norm can be obtained by choosing a special kind of...
متن کاملEffective Hamiltonian of Electroweak Penguin for Hadronic b Quark Decays
In this research we work with the effective Hamiltonian and the quark model. We investigate the decay rates of matter-antimatter of quark. We describe the effective Hamiltonian theory and apply this theory to the calculation of current-current ( ), QCD penguin ( ), magnetic dipole ( ) and electroweak penguin ( ) decay rates. The gluonic penguin structure of hadronic decays is studied thro...
متن کاملGeneralized Quantum Search Hamiltonian
There are hamiltonians that solve a search problem of finding one of N items in O( √ N) steps. They are hamiltonians to describe an oscillation between two states. In this paper we propose a generalized search hamiltonian, Hg. Then the known search hamiltonians become special cases of Hg. From the generalized search hamiltonian, we present remarkable results that searching with 100% is subject ...
متن کاملGeneralized honeycomb torus is Hamiltonian
Generalized honeycomb torus is a candidate for interconnection network architectures, which includes honeycomb torus, honeycomb rectangular torus, and honeycomb parallelogramic torus as special cases. Existence of Hamiltonian cycle is a basic requirement for interconnection networks since it helps map a “token ring” parallel algorithm onto the associated network in an efficient way. Cho and Hsu...
متن کاملHyper-Hamiltonian generalized Petersen graphs
Assume that n and k are positive integers with n ≥ 2k + 1. A non-hamiltonian graph G is hypo hamiltonian if G − v is hamiltonian for any v ∈ V (G). It is proved that the generalized Petersen graph P (n, k) is hypo hamiltonian if and only if k = 2 and n ≡ 5 (mod 6). Similarly, a hamiltonian graph G is hyper hamiltonian if G−v is hamiltonian for any v ∈ V (G). In this paper, we will give some nec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2017
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.95.032124