23 resultados para Quantum computational complexity
Resumo:
Usually in the calculation of valence subband structure for III-V direct bandgap material, axial approximation had been used in the Luttinger-Kohn model to simplify the computational efforts. In this letter, the valence subband structure for the GaInP/AlGaInP strained and lattice-matched quantum wells was calculated without axial approximation, on the basis of 6x6 Luttinger-Kohn Hamiltonian including strain and spin-orbit splitting effects. The numerical simulation results were presented with help of the finite-difference methods. The calculation results with/without axial approximation were compared and the effect of axial approximation on the valence subband structure was discussed in detail. The results indicated that there was a strong warping in the GaInP valence band, and axial approximation can lead to an error when k was not equal to zero, especially for compressively strained and lattice-matched GaInP/AlGaInP quantum wells.
Resumo:
We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N ( 2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.
Resumo:
Recognizing the computational difficulty due to the exponential behavior of the evanescent states in the calculations of the electron transmission in waveguide structures, the authors propose two transfer matrix methods and apply them to investigate the influence of the evanescent states on the electron wave propagation. The study shows that the effect of the evanescent states on the electron transport is obvious when the electron energy is close to the subband minima. The results show that the calculated transmissions are much enhanced if the evanescent states are omitted in the calculations. For the multiple-stub structures, it is found that the connecting channel length has a critical effect on the electron transmission depending on it larger or smaller than the attenuation lengths of evanescent states. Based on the study of the evanescent states, a new kind of waveguide structures which exhibit quantum modulated transistor action is proposed. (C) 1997 American Institute of Physics.