47,236 research outputs found

    A practical, unitary simulator for non-Markovian complex processes

    Full text link
    Stochastic processes are as ubiquitous throughout the quantitative sciences as they are notorious for being difficult to simulate and predict. In this letter we propose a unitary quantum simulator for discrete-time stochastic processes which requires less internal memory than any classical analogue throughout the simulation. The simulator's internal memory requirements equal those of the best previous quantum models. However, in contrast to previous models it only requires a (small) finite-dimensional Hilbert space. Moreover, since the simulator operates unitarily throughout, it avoids any unnecessary information loss. We provide a stepwise construction for simulators for a large class of stochastic processes hence directly opening the possibility for experimental implementations with current platforms for quantum computation. The results are illustrated for an example process.Comment: 12 pages, 5 figure

    Minimal Permutations and 2-Regular Skew Tableaux

    Get PDF
    Bouvel and Pergola introduced the notion of minimal permutations in the study of the whole genome duplication-random loss model for genome rearrangements. Let Fd(n)\mathcal{F}_d(n) denote the set of minimal permutations of length nn with dd descents, and let fd(n)=∣Fd(n)∣f_d(n)= |\mathcal{F}_d(n)|. They derived that fnβˆ’2(n)=2nβˆ’(nβˆ’1)nβˆ’2f_{n-2}(n)=2^{n}-(n-1)n-2 and fn(2n)=Cnf_n(2n)=C_n, where CnC_n is the nn-th Catalan number. Mansour and Yan proved that fn+1(2n+1)=2nβˆ’2nCn+1f_{n+1}(2n+1)=2^{n-2}nC_{n+1}. In this paper, we consider the problem of counting minimal permutations in Fd(n)\mathcal{F}_d(n) with a prescribed set of ascents. We show that such structures are in one-to-one correspondence with a class of skew Young tableaux, which we call 22-regular skew tableaux. Using the determinantal formula for the number of skew Young tableaux of a given shape, we find an explicit formula for fnβˆ’3(n)f_{n-3}(n). Furthermore, by using the Knuth equivalence, we give a combinatorial interpretation of a formula for a refinement of the number fn+1(2n+1)f_{n+1}(2n+1).Comment: 19 page

    Energy-based Structure Prediction for d(Al70Co20Ni10)

    Full text link
    We use energy minimization principles to predict the structure of a decagonal quasicrystal - d(AlCoNi) - in the Cobalt-rich phase. Monte Carlo methods are then used to explore configurations while relaxation and molecular dynamics are used to obtain a more realistic structure once a low energy configuration has been found. We find five-fold symmetric decagons 12.8 A in diameter as the characteristic formation of this composition, along with smaller pseudo-five-fold symmetric clusters filling the spaces between the decagons. We use our method to make comparisons with a recent experimental approximant structure model from Sugiyama et al (2002).Comment: 10pp, 2 figure

    Peculiar Behavior of Si Cluster Ions in Solid Al

    Full text link
    A peculiar ion behavior is found in a Si cluster, moving with a speed of ~0.22c (c: speed of light) in a solid Al plasma: the Si ion, moving behind the forward moving Si ion closely in a several angstrom distance in the cluster, feels the wake field generated by the forward Si. The interaction potential on the rear Si may balance the deceleration backward force by itself with the acceleration forward force by the forward Si in the longitudinal moving direction. The forward Si would be decelerated normally. However, the deceleration of the rear Si, moving behind closely, would be reduced significantly, and the rear Si may catch up and overtake the forward moving Si in the cluster during the Si cluster interaction with the high-density Al plasma
    • …
    corecore