8,764 research outputs found

    Some Spectral and Quasi-Spectral Characterizations of Distance-Regular Graphs

    Full text link
    In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using the preintersection numbers we give some new spectral and quasi-spectral characterizations of distance-regularity, in particular for graphs with large girth or large odd-girth

    Adiabatic Quantum Computation in Open Systems

    Full text link
    We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast to closed systems, we show that a system may initially be in an adiabatic regime, but then undergo a transition to a regime where adiabaticity breaks down. As a consequence, the success of AQC depends sensitively on the competition between various pertinent rates, giving rise to optimality criteria.Comment: v2: 4 pages, 1 figure. Published versio

    Mg-Ni-H films as selective coatings: tunable reflectance by layered hydrogenation

    Get PDF
    Unlike other switchable mirrors, Mg2NiHx films show large changes in reflection that yield very low reflectance (high absorptance) at different hydrogen contents, far before reaching the semiconducting state. The resulting reflectance patterns are of interference origin, due to a self-organized layered hydrogenation mechanism that starts at the substrate interface, and can therefore be tuned by varying the film thickness. This tunability, together with the high absorptance contrast observed between the solar and the thermal energies, strongly suggests the use of these films in smart coatings for solar applications.Comment: Three two-column pages with 3 figures embedded; RevTE

    Scaling of running time of quantum adiabatic algorithm for propositional satisfiability

    Full text link
    We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows exponentially with their size. Worst case complexity of quantum adiabatic algorithm therefore seems to be exponential.Comment: 7 page

    Trees with a large Laplacian eigenvalue multiplicity

    Full text link
    In this paper, we study the multiplicity of the Laplacian eigenvalues of trees. It is known that for trees, integer Laplacian eigenvalues larger than 11 are simple and also the multiplicity of Laplacian eigenvalue 11 has been well studied before. Here we consider the multiplicities of the other (non-integral) Laplacian eigenvalues. We give an upper bound and determine the trees of order nn that have a multiplicity that is close to the upper bound n32\frac{n-3}{2}, and emphasize the particular role of the algebraic connectivity.Comment: 11 pages, 5 figure

    Flow optimization study of a batch microfluidics PET tracer synthesizing device.

    Get PDF
    We present numerical modeling and experimental studies of flow optimization inside a batch microfluidic micro-reactor used for synthesis of human-scale doses of Positron Emission Tomography (PET) tracers. Novel techniques are used for mixing within, and eluting liquid out of, the coin-shaped reaction chamber. Numerical solutions of the general incompressible Navier Stokes equations along with time-dependent elution scalar field equation for the three dimensional coin-shaped geometry were obtained and validated using fluorescence imaging analysis techniques. Utilizing the approach presented in this work, we were able to identify optimized geometrical and operational conditions for the micro-reactor in the absence of radioactive material commonly used in PET related tracer production platforms as well as evaluate the designed and fabricated micro-reactor using numerical and experimental validations

    Generating sequential space-filling designs using genetic algorithms and Monte Carlo methods

    Get PDF
    In this paper, the authors compare a Monte Carlo method and an optimization-based approach using genetic algorithms for sequentially generating space-filling experimental designs. It is shown that Monte Carlo methods perform better than genetic algorithms for this specific problem
    corecore