We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle. We find that a direct implementation of this oracle requires costly arithmetic operations. We thus reformulate the quantum walk, circumventing its implementation altogether by closely following the classical Metropolis-Hastings walk. We also present heuristic quantum algorithms that use the quantum walk in the context of discrete optimization problems and numerically study their performances. Our numerical results indicate polynomial quantum speedups in heuristic settings.

No abstract

No abstract

Abstract.A superintegrable, discrete model of the quantum isotropic oscillator in two-dimensions is introduced. The system is defined on the regular, infinite-dimensional N×N lattice. It is governed by a Hamiltonian expressed as a seven-point difference operator involving three parameters. The exact solutions of the model are given in terms of the two-variable Meixner polynomials orthogonal with respect to the negative trinomial distribution. The constants of motion of the system are constructed using the raising and lowering operators for these polynomials. They are shown to generate an su(2) invariance algebra. The two-variable Meixner polynomials are seen to support irreducible representations of this algebra. In the continuum limit, where the lattice constant tends to zero, the standard isotropic quantum oscillator in two dimensions is recovered. The limit process from the two-variable Meixner polynomials to a product of two Hermite polynomials is carried out by involving the bivariate Charlier polynomials.

No abstract