4 February 2010 in Physical Review Letters
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, opening the way for the implementation of a quantum-walk-based search algorithm.
6 May 2011 in Physical Review Letters
We investigate the impact of decoherence and static disorder on the dynamics of quantum particles moving in a periodic lattice. Our experiment relies on the photonic implementation of a one-dimensional quantum walk. The pure quantum evolution is characterized by a ballistic spread of a photon's wave packet along 28 steps. By applying controlled time-dependent operations we simulate three different environmental influences on the system, resulting in a fast ballistic spread, a diffusive classical walk, and the first Anderson localization in a discrete quantum walk architecture.
28 January 2009 in Physical Review A
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.Comment: 7 pages, 2 figures. Major revision according to referee repor
27 September 2017 in Physical Review A
Quantum walks constitute a versatile platform for simulating transport phenomena on discrete graphs including topological material properties while providing a high control over the relevant parameters at the same time. To experimentally access and directly measure the topological invariants of quantum walks, we implement the scattering scheme proposed by Tarasinski et al. [ Phys. Rev. A 89, 042327 (2014)] in a photonic time multiplexed quantum walk experiment. The tunable coin operation provides opportunity to reach distinct topological phases, and accordingly to observe the corresponding topological phase transitions. The ability to read-out the position and the coin state distribution, complemented by explicit interferometric sign measurements, allowed the reconstruction of the scattered reflection amplitudes and thus the computation of the associated bulk topological invariants. As predicted, we also find localized states at the edges between two bulks belonging to different topological phases. In order to analyze the impact of disorder, we have measured invariants of two different types of disordered samples in large ensemble measurements, demonstrating their constancy in one disorder regime and a continuous transition with increasing disorder strength for the second disorder sample.
1 June 2016 in New Journal of Physics
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for studying various applications. Here, we present time-multiplexed finite quantum walks of variable size, the preparation of non-localised input states and their dynamical evolution. As a further application, we implement a state transfer scheme for an arbitrary input state to two different output modes. The presented experiments rely on the full dynamical control of a time-multiplexed quantum walk, which includes adjustable coin operation as well as the possibility to flexibly configure the underlying graph structures.