538,032 research outputs found

    Quantum feedback with weak measurements

    Get PDF
    The problem of feedback control of quantum systems by means of weak measurements is investigated in detail. When weak measurements are made on a set of identical quantum systems, the single-system density matrix can be determined to a high degree of accuracy while affecting each system only slightly. If this information is fed back into the systems by coherent operations, the single-system density matrix can be made to undergo an arbitrary nonlinear dynamics, including for example a dynamics governed by a nonlinear Schr\"odinger equation. We investigate the implications of such nonlinear quantum dynamics for various problems in quantum control and quantum information theory, including quantum computation. The nonlinear dynamics induced by weak quantum feedback could be used to create a novel form of quantum chaos in which the time evolution of the single-system wave function depends sensitively on initial conditions.Comment: 11 pages, TeX, replaced to incorporate suggestions of Asher Pere

    Information Splitting for Big Data Analytics

    Full text link
    Many statistical models require an estimation of unknown (co)-variance parameter(s) in a model. The estimation usually obtained by maximizing a log-likelihood which involves log determinant terms. In principle, one requires the \emph{observed information}--the negative Hessian matrix or the second derivative of the log-likelihood---to obtain an accurate maximum likelihood estimator according to the Newton method. When one uses the \emph{Fisher information}, the expect value of the observed information, a simpler algorithm than the Newton method is obtained as the Fisher scoring algorithm. With the advance in high-throughput technologies in the biological sciences, recommendation systems and social networks, the sizes of data sets---and the corresponding statistical models---have suddenly increased by several orders of magnitude. Neither the observed information nor the Fisher information is easy to obtained for these big data sets. This paper introduces an information splitting technique to simplify the computation. After splitting the mean of the observed information and the Fisher information, an simpler approximate Hessian matrix for the log-likelihood can be obtained. This approximated Hessian matrix can significantly reduce computations, and makes the linear mixed model applicable for big data sets. Such a spitting and simpler formulas heavily depends on matrix algebra transforms, and applicable to large scale breeding model, genetics wide association analysis.Comment: arXiv admin note: text overlap with arXiv:1605.0764

    On the design of optimal input signals in system identification

    Get PDF
    The problem of designing optimal inputs in the identification of linear systems with unknown random parameters is considered using a Bayesian approach. The information matrix, which is positive definite for the class of systems analyzed, gives a measure of performance for the system inputs. The computation of the optimal closed-loop input mappings is shown to be a nontrivial exercise in adaptive control. Deterministic optimal inputs are shown to be easily computable. Numerical examples are given. A Kalman filter is used to estimate the parameters. A necessary condition for the Kalman filter not to diverge when applying linear feedback is also given

    Computing diagonal form and Jacobson normal form of a matrix using Gr\"obner bases

    Get PDF
    In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of Jacobson normal form and also used for the computation of Smith normal form in the commutative case. We propose a general framework for handling, among other, operator algebras with rational coefficients. We employ special "polynomial" strategy in Ore localizations of non-commutative GG-algebras and show its merits. In particular, for a given matrix MM we provide an algorithm to compute U,VU,V and DD with fraction-free entries such that UMV=DUMV=D holds. The polynomial approach allows one to obtain more precise information, than the rational one e. g. about singularities of the system. Our implementation of polynomial strategy shows very impressive performance, compared with methods, which directly use fractions. In particular, we experience quite moderate swell of coefficients and obtain uncomplicated transformation matrices. This shows that this method is well suitable for solving nontrivial practical problems. We present an implementation of algorithms in SINGULAR:PLURAL and compare it with other available systems. We leave questions on the algorithmic complexity of this algorithm open, but we stress the practical applicability of the proposed method to a bigger class of non-commutative algebras

    Random Beamforming over Quasi-Static and Fading Channels: A Deterministic Equivalent Approach

    Full text link
    In this work, we study the performance of random isometric precoders over quasi-static and correlated fading channels. We derive deterministic approximations of the mutual information and the signal-to-interference-plus-noise ratio (SINR) at the output of the minimum-mean-square-error (MMSE) receiver and provide simple provably converging fixed-point algorithms for their computation. Although these approximations are only proven exact in the asymptotic regime with infinitely many antennas at the transmitters and receivers, simulations suggest that they closely match the performance of small-dimensional systems. We exemplarily apply our results to the performance analysis of multi-cellular communication systems, multiple-input multiple-output multiple-access channels (MIMO-MAC), and MIMO interference channels. The mathematical analysis is based on the Stieltjes transform method. This enables the derivation of deterministic equivalents of functionals of large-dimensional random matrices. In contrast to previous works, our analysis does not rely on arguments from free probability theory which enables the consideration of random matrix models for which asymptotic freeness does not hold. Thus, the results of this work are also a novel contribution to the field of random matrix theory and applicable to a wide spectrum of practical systems.Comment: to appear in IEEE Transactions on Information Theory, 201
    • …
    corecore