113 resultados para Discrete polynomial transforms
Resumo:
We establish a mapping between a continuous-variable (CV) quantum system and a discrete quantum system of arbitrary dimension. This opens up the general possibility to perform any quantum information task with a CV system as if it were a discrete system. The Einstein-Podolsky-Rosen state is mapped onto the maximally entangled state in any finite-dimensional Hilbert space and thus can be considered as a universal resource of entanglement. An explicit example of the map and a proposal for its experimental realization are discussed.
Resumo:
The full-dimensional time-dependent Schrodinger equation for the electronic dynamics of single-electron systems in intense external fields is solved directly using a discrete method. Our approach combines the finite-difference and Lagrange mesh methods. The method is applied to calculate the quasienergies and ionization probabilities of atomic and molecular systems in intense static and dynamic electric fields. The gauge invariance and accuracy of the method is established. Applications to multiphoton ionization of positronium, the hydrogen atom and the hydrogen molecular ion are presented. At very high laser intensity, above the saturation threshold, we extend the method using a scaling technique to estimate the quasienergies of metastable states of the hydrogen molecular ion. The results are in good agreement with recent experiments. (C) 2004 American Institute of Physics.
Resumo:
A flexible, mass-conservative numerical technique for solving the advection-dispersion equation for miscible contaminant transport is presented. The method combines features of puff transport models from air pollution studies with features from the random walk particle method used in water resources studies, providing a deterministic time-marching algorithm which is independent of the grid Peclet number and scales from one to higher dimensions simply. The concentration field is discretised into a number of particles, each of which is treated as a point release which advects and disperses over the time interval. The dispersed puff is itself discretised into a spatial distribution of particles whose masses can be pre-calculated. Concentration within the simulation domain is then calculated from the mass distribution as an average over some small volume. Comparison with analytical solutions for a one-dimensional fixed-duration concentration pulse and for two-dimensional transport in an axisymmetric flow field indicate that the algorithm performs well. For a given level of accuracy the new method has lower computation times than the random walk particle method.
Resumo:
We give an effective solution of the conjugacy problem for two-by-two matrices over the polynomial ring in one variable over a finite field.
Resumo:
A methodology for rapid silicon design of biorthogonal wavelet transform systems has been developed. This is based on generic, scalable architectures for the forward and inverse wavelet filters. These architectures offer efficient hardware utilisation by combining the linear phase property of biorthogonal filters with decimation and interpolation. The resulting designs have been parameterised in terms of types of wavelet and wordlengths for data and coefficients. Control circuitry is embedded within these cores that allows them to be cascaded for any desired level of decomposition without any interface logic. The time to produce silicon designs for a biorthogonal wavelet system is only the time required to run synthesis and layout tools with no further design effort required. The resulting silicon cores produced are comparable in area and performance to hand-crafted designs. These designs are also portable across a range of foundries and are suitable for FPGA and PLD implementations.