Quantum kinetic theory of shift current electron pumping in semiconductors

We develop a theory of laser beam generation of shift currents in non-centrosymmetric semiconductors. The currents originate when the excited electrons transfer between different bands or scatter inside these bands, and asymmetrically shift their centers of mass in elementary cells. Quantum kinetic equations for hot-carrier distributions and expressions for the induced currents are derived by nonequilibrium Green functions. In applications, we simplify the approach to the Boltzmann limit and use it to model laser-excited GaAs in the presence of LO phonon scattering. The shift currents are calculated in a steady-state regime.Comment: 23 pages, 5 figures (Latex

Generalized gradient expansions in quantum transport equations

Gradient expansions in quantum transport equations of a Kadanoff-Baym form have been reexamined. We have realized that in a consistent approach the expansion should be performed also inside of the self-energy in the scattering integrals of these equations. In the first perturbation order this internal expansion gives new correction terms to the generalized Boltzman equation. These correction terms are found here for several typical systems. Possible corrections to the theory of a linear response to weak electric fields are also discussed.Comment: 20 pages, latex, to appear in Journal of Statistical Physics, March (1997

Electron-Phonon Interacation in Quantum Dots: A Solvable Model

The relaxation of electrons in quantum dots via phonon emission is hindered by the discrete nature of the dot levels (phonon bottleneck). In order to clarify the issue theoretically we consider a system of $N$ discrete fermionic states (dot levels) coupled to an unlimited number of bosonic modes with the same energy (dispersionless phonons). In analogy to the Gram-Schmidt orthogonalization procedure, we perform a unitary transformation into new bosonic modes. Since only $N(N+1)/2$ of them couple to the fermions, a numerically exact treatment is possible. The formalism is applied to a GaAs quantum dot with only two electronic levels. If close to resonance with the phonon energy, the electronic transition shows a splitting due to quantum mechanical level repulsion. This is driven mainly by one bosonic mode, whereas the other two provide further polaronic renormalizations. The numerically exact results for the electron spectral function compare favourably with an analytic solution based on degenerate perturbation theory in the basis of shifted oscillator states. In contrast, the widely used selfconsistent first-order Born approximation proves insufficient in describing the rich spectral features.Comment: 8 pages, 4 figure

Optical excitations in hexagonal nanonetwork materials

Optical excitations in hexagonal nanonetwork materials, for example, Boron-Nitride (BN) sheets and nanotubes, are investigated theoretically. The bonding of BN systems is positively polarized at the B site, and is negatively polarized at the N site. There is a permanent electric dipole moment along the BN bond, whose direction is from the B site to the N site. When the exciton hopping integral is restricted to the nearest neighbors, the flat band of the exciton appears at the lowest energy. The higher optical excitations have excitation bands similar to the electronic bands of graphene planes and carbon nanotubes. The symmetry of the flat exciton band is optically forbidden, indicating that the excitons related to this band will show quite long lifetime which will cause strong luminescence properties.Comment: 4 pages; 3 figures; proceedings of "XVIth International Winterschool on Electronic Properties of Novel Materials (IWEPNM2002)

Approximately coloring graphs without long induced paths

It is an open problem whether the 3-coloring problem can be solved in polynomial time in the class of graphs that do not contain an induced path on $t$ vertices, for fixed $t$. We propose an algorithm that, given a 3-colorable graph without an induced path on $t$ vertices, computes a coloring with $\max\{5,2\lceil{\frac{t-1}{2}}\rceil-2\}$ many colors. If the input graph is triangle-free, we only need $\max\{4,\lceil{\frac{t-1}{2}}\rceil+1\}$ many colors. The running time of our algorithm is $O((3^{t-2}+t^2)m+n)$ if the input graph has $n$ vertices and $m$ edges

Fullerene graphs have exponentially many perfect matchings

A fullerene graph is a planar cubic 3-connected graph with only pentagonal and hexagonal faces. We show that fullerene graphs have exponentially many perfect matchings.Comment: 7 pages, 3 figure

Impact Ionization in ZnS

The impact ionization rate and its orientation dependence in k space is calculated for ZnS. The numerical results indicate a strong correlation to the band structure. The use of a q-dependent screening function for the Coulomb interaction between conduction and valence electrons is found to be essential. A simple fit formula is presented for easy calculation of the energy dependent transition rate.Comment: 9 pages LaTeX file, 3 EPS-figures (use psfig.sty), accepted for publication in PRB as brief Report (LaTeX source replaces raw-postscript file

Synthesis and tomographic characterization of the displaced Fock state of light

Displaced Fock states of the electromagnetic field have been synthesized by overlapping the pulsed optical single-photon Fock state |1> with coherent states on a high-reflection beamsplitter and completely characterized by means of quantum homodyne tomography. The reconstruction reveals highly non-classical properties of displaced Fock states, such as negativity of the Wigner function and photon number oscillations. This is the first time complete tomographic reconstruction has been performed on a highly non-classical optical state

List coloring in the absence of a linear forest.

The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)⊆{1,…,k}. Let Pn denote the path on n vertices, and G+H and rH the disjoint union of two graphs G and H and r copies of H, respectively. For any two fixed integers k and r, we show that Listk-Coloring can be solved in polynomial time for graphs with no induced rP1+P5, hereby extending the result of Hoàng, Kamiński, Lozin, Sawada and Shu for graphs with no induced P5. Our result is tight; we prove that for any graph H that is a supergraph of P1+P5 with at least 5 edges, already List 5-Coloring is NP-complete for graphs with no induced H

Complete population transfer in a degenerate 3-level atom

We find conditions required to achieve complete population transfer, via coherent population trapping, from an initial state to a designated final state at a designated time in a degenerate 3-level atom, where transitions are caused by an external interaction. Complete population transfer from an initially occupied state 1 to a designated state 2 occurs under two conditions. First, there is a constraint on the ratios of the transition matrix elements of the external interaction. Second, there is a constraint on the action integral over the interaction, or "area", corresponding to the phase shift induced by the external interaction. Both conditions may be expressed in terms of simple odd integers.Comment: 22 pages, 4 figure