arXiv subjects

A. Gabris

Publications and source records attributed to A. Gabris.

4 recordsLinked to original sources

arXiv2010

Photons Walking the Line: A quantum walk with adjustable coin operations

We present the first robust implementation of a coined quantum walk over five steps using only passive optical elements. By employing a fiber network loop we keep the amount of required resources constant as the walker's position Hilbert space is increased. We observed a non-Gaussian distribution of the walker's final position, thus characterizing a faster spread of the photon wave-packet in comparison to the classical random walk. The walk is realized for many different coin settings and initial states, which opens the way for the implementation of a quantum walk-based search algorithm.

quant-ph↗

arXiv2008

Optimized quantum random-walk search algorithms

Shenvi, Kempe and Whaley's quantum random-walk search (SKW) algorithm [Phys. Rev. A 67, 052307 (2003)] is known to require $O(\sqrt N)$ number of oracle queries to find the marked element, where $N$ is the size of the search space. The overall time complexity of the SKW algorithm differs from the best achievable on a quantum computer only by a constant factor. We present improvements to the SKW algorithm which yield significant increase in success probability, and an improvement on query complexity such that the theoretical limit of a search algorithm succeeding with probability close to one is reached. We point out which improvement can be applied if there is more than one marked element to find.

quant-ph↗

arXiv2007

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 behaviour that asymptotically tends to a non-zero value.

quant-ph↗

arXiv2004

Vacuum induced Stark shifts for quantum logic using a collective system in a high quality dispersive cavity

A collective system of atoms in a high quality cavity can be described by a nonlinear interaction which arises due to the Lamb shift of the energy levels due to the cavity vacuum [Agarwal et al., Phys. Rev. A 56, 2249 (1997)]. We show how this collective interaction can be used to perform quantum logic. In particular we produce schemes to realize CNOT gates not only for two-qubit but also for three-qubit systems. We also discuss realizations of Toffoli gates. Our effective Hamiltonian is also realized in other systems such as trapped ions or magnetic molecules.

quant-ph↗