Search NASA⌕ Search

Engineering topics

Kiss, T

Publications and source records attributed to Kiss, T.

Recurrences in three-state quantum walks on a plane

We analyze the role of dimensionality in the time evolution of discrete-time quantum walks through the example of the three-state walk on a two-dimensional triangular lattice. We show that the three-state Grover walk does not lead to trapping (localization) or recurrence to the origin, in sharp contrast to the Grover walk on the two-dimensional square lattice. We determine the power-law scaling of the probability at the origin with the method of stationary phase. We prove that only a special subclass of coin operators can lead to recurrence, and there are no coins that lead to localization. The propagation for the recurrent subclass of coins is quasi-one dimensional.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polya number of the continuous-time quantum walks

We propose a definition for the Polya number of continuous-time quantum walks to characterize their recurrence properties. The definition involves a series of measurements on the system, each carried out on a different member from an ensemble in order to minimize the disturbance caused by it. We examine various graphs, including the ring, the line, the higher-dimensional integer lattices, and a number of other graphs, and we calculate their Polya number. For the timing of the measurements, a Poisson process as well as regular timing are discussed. We find that the speed of decay for the probability at the origin is the key for recurrence.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering quantum random-walk search with errors

We analyze the realization of a quantum-walk search algorithm in a passive, linear optical network. The specific model enables us to consider the effect of realistic sources of noise and losses on the search efficiency. Photon loss uniform in all directions is shown to lead to the rescaling of search time. Deviation from directional uniformity leads to the enhancement of the search efficiency compared to uniform loss with the same average. In certain cases even increasing loss in some of the directions can improve search efficiency. We show that while we approach the classical limit of the general search algorithm by introducing random phase fluctuations, its utility for searching is lost. Using numerical methods, we found that for static phase errors the averaged search efficiency displays a damped oscillatory behavior that asymptotically tends to a nonzero value.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗