2,669 research outputs found

    Qubit Complexity of Continuous Problems

    Get PDF
    The number of qubits used by a quantum algorithm will be a crucial computational resource for the foreseeable future. We show how to obtain the classical query complexity for continuous problems. We then establish a simple formula for a lower bound on the qubit complexity in terms of the classical query complexityComment: 6 pages, 2 figure

    Associated Polynomials and Uniform Methods for the Solution of Linear Problems

    Get PDF
    To every polynomial P of degree n we associate a sequence of n-1 polynomials of increasing degree which we call the associated polynomials of P. The associated polynomials depend in a particularly simple way on the coefficients of P. These polynomials have appeared in many guises in the literature, usually related to some particular application and most often going unrecognized. They have been called Horner polynomials and Laguerre polynomials. Often what occurs is not an associated polynomial itself but a number which is an associated polynomial evaluated at a zero of P. The properties of associated polynomials have never been investigated in themselves. We shall try to demonstrate that associated polynomials provide a useful unifying concept. Although many of the results of this paper are new, we shall also present known results in our framework
    corecore