Decomposition of time-covariant operations on quantum systems with continuous and/or discrete energy spectrum

Every completely positive map G that commutes which the Hamiltonian time evolution is an integral or sum over (densely defined) CP-maps G_\sigma where \sigma is the energy that is transferred to or taken from the environment. If the spectrum is non-degenerated each G_\sigma is a dephasing channel followed by an energy shift. The dephasing is given by the Hadamard product of the density operator with a (formally defined) positive operator. The Kraus operator of the energy shift is a partial isometry which defines a translation on R with respect to a non-translation-invariant measure. As an example, I calculate this decomposition explicitly for the rotation invariant gaussian channel on a single mode. I address the question under what conditions a covariant channel destroys superpositions between mutually orthogonal states on the same orbit. For channels which allow mutually orthogonal output states on the same orbit, a lower bound on the quantum capacity is derived using the Fourier transform of the CP-map-valued measure (G_\sigma).Comment: latex, 33 pages, domains of unbounded operators are now explicitly specified. Presentation more detailed. Implementing the shift after the dephasing is sometimes more convenien

A method for dense packing discovery

The problem of packing a system of particles as densely as possible is foundational in the field of discrete geometry and is a powerful model in the material and biological sciences. As packing problems retreat from the reach of solution by analytic constructions, the importance of an efficient numerical method for conducting \textit{de novo} (from-scratch) searches for dense packings becomes crucial. In this paper, we use the \textit{divide and concur} framework to develop a general search method for the solution of periodic constraint problems, and we apply it to the discovery of dense periodic packings. An important feature of the method is the integration of the unit cell parameters with the other packing variables in the definition of the configuration space. The method we present led to improvements in the densest-known tetrahedron packing which are reported in [arXiv:0910.5226]. Here, we use the method to reproduce the densest known lattice sphere packings and the best known lattice kissing arrangements in up to 14 and 11 dimensions respectively (the first such numerical evidence for their optimality in some of these dimensions). For non-spherical particles, we report a new dense packing of regular four-dimensional simplices with density $\phi=128/219\approx0.5845$ and with a similar structure to the densest known tetrahedron packing.Comment: 15 pages, 5 figure

Modeling Heterogeneous Materials via Two-Point Correlation Functions: I. Basic Principles

Heterogeneous materials abound in nature and man-made situations. Examples include porous media, biological materials, and composite materials. Diverse and interesting properties exhibited by these materials result from their complex microstructures, which also make it difficult to model the materials. In this first part of a series of two papers, we collect the known necessary conditions on the standard two-point correlation function S2(r) and formulate a new conjecture. In particular, we argue that given a complete two-point correlation function space, S2(r) of any statistically homogeneous material can be expressed through a map on a selected set of bases of the function space. We provide new examples of realizable two-point correlation functions and suggest a set of analytical basis functions. Moreover, we devise an efficient and isotropy- preserving construction algorithm, namely, the Lattice-Point algorithm to generate realizations of materials from their two- point correlation functions based on the Yeong-Torquato technique. Subsequent analysis can be performed on the generated images to obtain desired macroscopic properties. These developments are integrated here into a general scheme that enables one to model and categorize heterogeneous materials via two-point correlation functions.Comment: 37 pages, 26 figure

Working time satisfaction in aging nurses

Satisfaction with working time could represent an index of good balance between work and life and predict satisfactory work ability and endurance of aged workers. This study is aimed at checking whether elderly nurses who were satisfied with working hours had a better work ability index than those unsatisfied, and finding which factors were related to satisfaction of working time with reference to general \u201cwell being\u201d and/or \u201cprivate life\u201d. The study sample consisted of 3,174 female nurses recruited in six European countries within the Nurses\u2019 Early Exit Study. All were rotating shiftworkers (nights included) and 12.95 % were over 45 years of age. A composite questionnaire, including demands at work and in private life, working conditions, individual resources and alternatives to nursing profession, was administered to the participants at baseline and 1 yr later (Time 1). Work ability index (WAI) at time 1 was used as outcome, whereas age groups and satisfaction of working time at baseline were used as predictors, after adjusting for family status and number of children < 7yrs of age. Also \u201csatisfaction with working time\u201d at Time 1 was used as outcome, whereas working hours, job demand, leisure time, influence on planning rotas, family status, number of children, work/family conflicts, sleep at Time 0 were included as potential determinants. Conditional Random Forest analysis was used to evaluate high, moderate or weak importance of these determinants. Nurses satisfied with working time at time 0 showed a higher WAI (time1) than those unsatisfied in all age groups, also over 50. Less work/family conflicts and better quality and quantity sleep turned out to be the best predictors of satisfaction with working time. Consistently, the importance of the other predictors differs when the outcome is \u201csatisfaction with working time\u201d related to general well-being rather than to private life

Finite-Dimensional Bicomplex Hilbert Spaces

This paper is a detailed study of finite-dimensional modules defined on bicomplex numbers. A number of results are proved on bicomplex square matrices, linear operators, orthogonal bases, self-adjoint operators and Hilbert spaces, including the spectral decomposition theorem. Applications to concepts relevant to quantum mechanics, like the evolution operator, are pointed out.Comment: 21 page

Non-mean-field theory of anomalously large double-layer capacitance

Mean-field theories claim that the capacitance of the double-layer formed at a metal/ionic conductor interface cannot be larger than that of the Helmholtz capacitor, whose width is equal to the radius of an ion. However, in some experiments the apparent width of the double-layer capacitor is substantially smaller. We propose an alternate, non-mean-field theory of the ionic double-layer to explain such large capacitance values. Our theory allows for the binding of discrete ions to their image charges in the metal, which results in the formation of interface dipoles. We focus primarily on the case where only small cations are mobile and other ions form an oppositely-charged background. In this case, at small temperature and zero applied voltage dipoles form a correlated liquid on both contacts. We show that at small voltages the capacitance of the double-layer is determined by the transfer of dipoles from one electrode to the other and is therefore limited only by the weak dipole-dipole repulsion between bound ions, so that the capacitance is very large. At large voltages the depletion of bound ions from one of the capacitor electrodes triggers a collapse of the capacitance to the much smaller mean-field value, as seen in experimental data. We test our analytical predictions with a Monte Carlo simulation and find good agreement. We further argue that our ``one-component plasma" model should work well for strongly asymmetric ion liquids. We believe that this work also suggests an improved theory of pseudo-capacitance.Comment: 19 pages, 14 figures; some Monte Carlo results and a section about aqueous solutions adde

Statistics of lattice animals (polyominoes) and polygons

We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the growth constant of lattice animals and confirms to a very high degree of certainty that the generating function has a logarithmic divergence. We prove the bound $\tau > 3.90318.$ We also calculate the radius of gyration of both lattice animals and polygons enumerated by area. The analysis of the radius of gyration series yields the estimate $\nu = 0.64115(5)$, for both animals and polygons enumerated by area. The mean perimeter of polygons of area $n$ is also calculated. A number of new amplitude estimates are given.Comment: 10 pages, 2 eps figure