Coarse-Grained Picture for Controlling Complex Quantum Systems

We propose a coarse-grained picture to control ``complex'' quantum dynamics, i.e., multi-level-multi-level transition with a random interaction. Assuming that optimally controlled dynamics can be described as a Rabi-like oscillation between an initial and final state, we derive an analytic optimal field as a solution to optimal control theory. For random matrix systems, we numerically confirm that the analytic optimal field steers an initial state to a target state which both contains many eigenstates.Comment: jpsj2.cls, 2 pages, 3 figure files; appear in J. Phys. Soc. Jpn. Vol.73, No.11 (Nov. 15, 2004

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

Nanoscale Processing by Adaptive Laser Pulses

We theoretically demonstrate that atomically-precise ``nanoscale processing" can be reproducibly performed by adaptive laser pulses. We present the new approach on the controlled welding of crossed carbon nanotubes, giving various metastable junctions of interest. Adaptive laser pulses could be also used in preparation of other hybrid nanostructures.Comment: 4 pages, 4 Postscript figure

Exhaustive generation of kk-critical H\mathcal H-free graphs

We describe an algorithm for generating all $k$-critical $\mathcal H$-free graphs, based on a method of Ho\`{a}ng et al. Using this algorithm, we prove that there are only finitely many $4$-critical $(P_7,C_k)$-free graphs, for both $k=4$ and $k=5$. We also show that there are only finitely many $4$-critical graphs $(P_8,C_4)$-free graphs. For each case of these cases we also give the complete lists of critical graphs and vertex-critical graphs. These results generalize previous work by Hell and Huang, and yield certifying algorithms for the $3$-colorability problem in the respective classes. Moreover, we prove that for every $t$, the class of 4-critical planar $P_t$-free graphs is finite. We also determine all 27 4-critical planar $(P_7,C_6)$-free graphs. We also prove that every $P_{10}$-free graph of girth at least five is 3-colorable, and determine the smallest 4-chromatic $P_{12}$-free graph of girth five. Moreover, we show that every $P_{13}$-free graph of girth at least six and every $P_{16}$-free graph of girth at least seven is 3-colorable. This strengthens results of Golovach et al.Comment: 17 pages, improved girth results. arXiv admin note: text overlap with arXiv:1504.0697

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

Engineering squeezed states in high-Q cavities

While it has been possible to build fields in high-Q cavities with a high degree of squeezing for some years, the engineering of arbitrary squeezed states in these cavities has only recently been addressed [Phys. Rev. A 68, 061801(R) (2003)]. The present work examines the question of how to squeeze any given cavity-field state and, particularly, how to generate the squeezed displaced number state and the squeezed macroscopic quantum superposition in a high-Q cavity

Thermalized Displaced and Squeezed Number States in Coordinate Representation

Within the framework of thermofield dynamics, the wavefunctions of the thermalized displaced number and squeezed number states are given in the coordinate representation. Furthermore, the time evolution of these wavefunctions is considered by introducing a thermal coordinate representation, and we also calculate the corresponding probability densities, average values and variances of position coordinate, which are consistent with results in the literature.Comment: 12 pages, no figures, Revtex. v3: substantially revise

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

Reducing the clique and chromatic number via edge contractions and vertex deletions.

We consider the following problem: can a certain graph parameter of some given graph G be reduced by at least d, for some integer d, via at most k graph operations from some specified set S, for some given integer k? As graph parameters we take the chromatic number and the clique number. We let the set S consist of either an edge contraction or a vertex deletion. As all these problems are NP-complete for general graphs even if d is fixed, we restrict the input graph G to some special graph class. We continue a line of research that considers these problems for subclasses of perfect graphs, but our main results are full classifications, from a computational complexity point of view, for graph classes characterized by forbidding a single induced connected subgraph H

Properties of Squeezed-State Excitations

The photon distribution function of a discrete series of excitations of squeezed coherent states is given explicitly in terms of Hermite polynomials of two variables. The Wigner and the coherent-state quasiprobabilities are also presented in closed form through the Hermite polynomials and their limiting cases. Expectation values of photon numbers and their dispersion are calculated. Some three-dimensional plots of photon distributions for different squeezing parameters demonstrating oscillatory behaviour are given.Comment: Latex,35 pages,submitted to Quant.Semiclassical Op