Entanglement induced by spontaneous emission in spatially extended two-atom systems

The role of the collective antisymmetric state in entanglement creation by spontaneous emission in a system of two non-overlapping two-level atoms has been investigated. Populations of the collective atomic states and the Wootters entanglement measure (concurrence) for two sets of initial atomic conditions are calculated and illustrated graphically. Calculations include the dipole-dipole interaction and a spatial separation between the atoms that the antisymmetric state of the system is included throughout even for small interatomic separations. It is shown that spontaneous emission can lead to a transient entanglement between the atoms even if the atoms were prepared initially in an unentangled state. It is found that the ability of spontaneous emission to create transient entanglement relies on the absence of population in the collective symmetric state of the system. For the initial state of only one atom excited, entanglement builds up rapidly in time and reaches a maximum for parameter values corresponding roughly to zero population in the symmetric state. On the other hand, for the initial condition of both atoms excited, the atoms remain unentangled until the symmetric state is depopulated. A simple physical interpretation of these results is given in terms of the diagonal states of the density matrix of the system. We also study entanglement creation in a system of two non-identical atoms of different transition frequencies. It is found that the entanglement between the atoms can be enhanced compared to that for identical atoms, and can decay with two different time scales resulting from the coherent transfer of the population from the symmetric to the antisymmetric state. In addition, it was found that a decaying initial entanglement between the atoms can display a revival behaviour.

Entangled two-photon source using biexciton emission of an asymmetric quantum dot in a cavity

A semiconductor based scheme has been proposed for generating entangled photon pairs from the radiative decay of an electrically pumped biexciton in a quantum dot. Symmetric dots produce polarization entanglement, but experimentally realized asymmetric dots produce photons entangled in both polarization and frequency. In this work, we investigate the possibility of erasing the “which-path” information contained in the frequencies of the photons produced by asymmetric quantum dots to recover polarization-entangled photons. We consider a biexciton with nondegenerate intermediate excitonic states in a leaky optical cavity with pairs of degenerate cavity modes close to the nondegenerate exciton transition frequencies. An open quantum system approach is used to compute the polarization entanglement of the two-photon state after it escapes from the cavity, measured by the visibility of two-photon interference fringes. We explicitly relate the two-photon visibility to the degree of the Bell-inequality violation, deriving a threshold at which Bell-inequality violations will be observed. Our results show that an ideal cavity will produce maximally polarization-entangled photon pairs, and even a nonideal cavity will produce partially entangled photon pairs capable of violating a Bell-inequality.

Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Nanostructures, Semicrytalline Morphology, and Nanoscale Confinement Effect on the Crystallization Kinetics in Self-Organized Block Copolymer/Thermoset Blends

This work reports the first instance of self-organized thermoset blends containing diblock copolymers with a crystallizable thermoset-immiscible block. Nanostructured thermoset blends of bisphenol A-type epoxy resin (ER) and a low-molecular-weight (M-n = 1400) amphiphilic polyethylene-block-poly(ethylene oxide) (EEO) symmetric diblock copolymer were prepared using 4,4'-methylenedianiline (MDA) as curing agent and were characterized by transmission electron microscopy (TEM), atomic force microscopy (AFM), small-angle X-ray scattering (SAXS), and differential scanning calorimetry (DSC). All the MDA-cured ER/EEO blends do not show macroscopic phase separation but exhibit microstructures. The ER selectively mixes with the epoxy-miscible PEO block in the EEO diblock copolymer whereas the crystallizable PE blocks that are immiscible with ER form separate microdomains at nanoscales in the blends. The PE crystals with size on nanoscales are formed and restricted within the individual spherical micelles in the nanostructured ER/EEO blends with EEO content up to 30 wt %. The spherical micelles are highly aggregated in the blends containing 40 and 50 wt % EEO. The PE dentritic crystallites exist in the blend containing 50 wt % EEO whereas the blends with even higher EEO content are completely volume-filled with PE spherulites. The semicrystalline microphase-separated lamellae in the symmetric EEO diblock copolymer are swollen in the blend with decreasing EEO content, followed by a structural transition to aggregated spherical micellar phase morphology and, eventually, spherical micellar phase morphology at the lowest EEO contents. Three morphological regimes are identified, corresponding precisely to the three regimes of crystallization kinetics of the PE blocks. The nanoscale confinement effect on the crystallization kinetics in nanostructured thermoset blends is revealed for the first time. This new phenomenon is explained on the basis of homogeneous nucleation controlled crystallization within nanoscale confined environments in the block copolymer/thermoset blends.

Common multiples of complete graphs and a 4-cycle

A graph G is a common multiple of two graphs H-1 and H-2 if there exists a decomposition of G into edge-disjoint copies of H-1 and also a decomposition of G into edge-disjoint copies of H-2. In this paper, we consider the case where H-1 is the 4-cycle C-4 and H-2 is the complete graph with n vertices K-n. We determine, for all positive integers n, the set of integers q for which there exists a common multiple of C-4 and K-n having precisely q edges. (C) 2003 Elsevier B.V. All rights reserved.

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 16 (mod 24), thus providing a new family of uniform 3 -factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. (C) 2004 Wiley Periodicals, Inc.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

Steiner trade spectra of complete partite graphs

The Steiner trade spectrum of a simple graph G is the set of all integers t for which there is a simple graph H whose edges can be partitioned into t copies of G in two entirely different ways. The Steiner trade spectra of complete partite graphs were determined in all but a few cases in a recent paper by Billington and Hoffman (Discrete Math. 250 (2002) 23). In this paper we resolve the remaining cases. (C) 2004 Elsevier B.V. All rights reserved.

Full S matrix calculation via a single real-symmetric Lanczos recursion: The Lanczos artificial boundary inhomogeneity method

We present an efficient and robust method for the calculation of all S matrix elements (elastic, inelastic, and reactive) over an arbitrary energy range from a single real-symmetric Lanczos recursion. Our new method transforms the fundamental equations associated with Light's artificial boundary inhomogeneity approach [J. Chem. Phys. 102, 3262 (1995)] from the primary representation (original grid or basis representation of the Hamiltonian or its function) into a single tridiagonal Lanczos representation, thereby affording an iterative version of the original algorithm with greatly superior scaling properties. The method has important advantages over existing iterative quantum dynamical scattering methods: (a) the numerically intensive matrix propagation proceeds with real symmetric algebra, which is inherently more stable than its complex symmetric counterpart; (b) no complex absorbing potential or real damping operator is required, saving much of the exterior grid space which is commonly needed to support these operators and also removing the associated parameter dependence. Test calculations are presented for the collinear H+H-2 reaction, revealing excellent performance characteristics. (C) 2004 American Institute of Physics.

On the possibility of elastic strain localisation in a fault

The phenomenon of strain localisation is often observed in shear deformation of particulate materials, e.g., fault gouge. This phenomenon is usually attributed to special types of plastic behaviour of the material (e.g., strain softening or mismatch between dilatancy and pressure sensitivity or both). Observations of strain localisation in situ or in experiments are usually based on displacement measurements and subsequent computation of the displacement gradient. While in conventional continua the symmetric part of the displacement gradient is equal to the strain, it is no longer the case in the more realistic descriptions within the framework of generalised continua. In such models the rotations of the gouge particles are considered as independent degrees of freedom the values of which usually differ from the rotation of an infinitesimal volume element of the continuum, the latter being described for infinitesimal deformations by the non-symmetric part of the displacement gradient. As a model for gouge material we propose a continuum description for an assembly of spherical particles of equal radius in which the particle rotation is treated as an independent degree of freedom. Based on this model we consider simple shear deformations of the fault gouge. We show that there exist values of the model parameters for which the displacement gradient exhibits a pronounced localisation at the mid-layers of the fault, even in the absence of inelasticity. Inelastic effects are neglected in order to highlight the role of the independent rotations and the associated additional parameters. The localisation-like behaviour occurs if (a) the particle rotations on the boundary of the shear layer are constrained (this type of boundary condition does not exist in a standard continuum) and (b) the contact moment-or bending stiffness is much smaller than the product of the effective shear modulus of the granulate and the square of the width of the gouge layer. It should be noted however that the virtual work functional is positive definite over the range of physically meaningful parameters (here: contact stiffnesses, solid volume fraction and coordination number) so that strictly speaking we are not dealing with a material instability.

Some equitably 3-colourable cycle decompositions of complete equipartite graphs

Let G be a graph in which each vertex has been coloured using one of k colours, say c(1), c(2),.. , c(k). If an m-cycle C in G has n(i) vertices coloured c(i), i = 1, 2,..., k, and vertical bar n(i) - n(j)vertical bar <= 1 for any i, j is an element of {1, 2,..., k}, then C is said to be equitably k-coloured. An m-cycle decomposition C of a graph G is equitably k-colourable if the vertices of G can be coloured so that every m-cycle in W is equitably k-coloured. For m = 3, 4 and 5 we completely settle the existence question for equitably 3-colourable m-cycle decompositions of complete equipartite graphs. (c) 2005 Elsevier B.V. All rights reserved.

Recursive filtering of images with symmetric extension

Recursive filters are widely used in image analysis due to their efficiency and simple implementation. However these filters have an initialisation problem which either produces unusable results near the image boundaries or requires costly approximate solutions such as extending the boundary manually. In this paper, we describe a method for the recursive filtering of symmetrically extended images for filters with symmetric denominator. We begin with an analysis of symmetric extensions and their effect on non-recursive filtering operators. Based on the non-recursive case, we derive a formulation of recursive filtering on symmetric domains as a linear but spatially varying implicit operator. We then give an efficient method for decomposing and solving the linear implicit system, along with a proof that this decomposition always exists. This decomposition needs to be performed only once for each dimension of the image. This yields a filtering which is both stable and consistent with the ideal infinite extension. The filter is efficient, requiring less computation than the standard recursive filtering. We give experimental evidence to verify these claims. (c) 2005 Elsevier B.V. All rights reserved.

Packing lambda-fold complete multipartite graphs with 4-cycles

A maximum packing of any lambda-fold complete multipartite graph (where there are lambda edges between any two vertices in different parts) with edge-disjoint 4- cycles is obtained and the size of each minimum leave is given. Moreover, when lambda =2, maximum 4-cycle packings are found for all possible leaves.