Related papers: The Hamiltonians generating one-dimensional discre…
A framework for statistical-mechanical analysis of quantum Hamiltonians is introduced. The approach is based upon a gradient flow equation in the space of Hamiltonians such that the eigenvectors of the initial Hamiltonian evolve toward…
An outstanding property of any Hamiltonian system is the symplecticity of its flow, namely, the continuous trajectory preserves volume in phase space. Given a symplectic but discrete trajectory generated by a transition matrix applied at a…
We obtain the complexity geometry associated with the Hamiltonian of a quantum mechanical system, specifically in cases where the Hamiltonian is explicitly time-dependent. Using Nielsen's geometric formulation of circuit complexity, we…
Discrete-time quantum walks can be regarded as quantum dynamical simulators since they can simulate spatially discretized Schr\"{o}dinger, massive Dirac, and Klein-Gordon equations. Here, two different types of Fibonacci discrete-time…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
The circuit-to-Hamiltonian construction translates dynamics (a quantum circuit and its output) into statics (the groundstate of a circuit Hamiltonian) by explicitly defining a quantum register for a clock. The standard Feynman-Kitaev…
The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…
We investigate the dynamics of discrete-time quantum walk subject to time correlated noise. Noise is described as an unitary coin-type operator before each step, and attention is focused on the noise generated by a Gaussian Ornstein…
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
We give the first example of faster transport with a quantum walk on an inherently directed graph, on the directed line with a variable number of self-loops at each vertex. These self-loops can be thought of as adding a number of small…
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By…
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a…
The effect of unitary noise on the discrete one-dimensional quantum walk is studied using computer simulations. For the noiseless quantum walk, starting at the origin (n=0) at time t=0, the position distribution Pt(n) at time t is very…
We consider the 2D alternate quantum walk on a cylinder. We concentrate on the study of the motion along the open dimension, in the spirit of looking at the closed coordinate as a small or "hidden" extra dimension. If one starts from…
A discrete-time Quantum Walk (QW) is essentially an operator driving the evolution of a single particle on the lattice, through local unitaries. Some QWs admit a continuum limit, leading to well-known physics partial differential equations,…
We extend the idea of a discrete-time quantum walk on a graph by placing a qubit on each vertex, and allowing the walker to interact with the qubit at its current position. We show that allowing for a controlled-Z interaction at each time…
Quantum computation can be achieved by preparing an appropriate initial product state of qudits and then letting it evolve under a fixed Hamiltonian. The readout is made by measurement on individual qudits at some later time. This approach…
We study a pair of canonoid (fouled) Hamiltonians of the harmonic oscillator which provide, at the classical level, the same equation of motion as the conventional Hamiltonian. These Hamiltonians, say $K_{1}$ and $K_{2}$, result to be…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…
Continuous-time quantum walks and adiabatic quantum evolution are two general techniques for quantum computing, both of which are described by Hamiltonians that govern their evolutions by Schr\"odinger's equation. In the former, the…