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.

Multidimensional quantum walks can exhibit highly nontrivial topological structure, providing a powerful tool for simulating quantum information and transport systems. We present a flexible implementation of a two-dimensional (2D) optical quantum walk on a lattice, demonstrating a scalable quantum walk on a nontrivial graph structure. We realized a coherent quantum walk over 12 steps and 169 positions by using an optical fiber network. With our broad spectrum of quantum coins, we were able to simulate the creation of entanglement in bipartite systems with conditioned interactions. Introducing dynamic control allowed for the investigation of effects such as strong nonlinearities or two-particle scattering. Our results illustrate the potential of quantum walks as a route for simulating and understanding complex quantum systems.

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.

Boson Sampling has emerged as a tool to explore the advantages of quantum over classical computers as it does not require a universal control over the quantum system, which favours current photonic experimental platforms. Here, we introduce Gaussian Boson Sampling, a classically hardto-solve problem that uses squeezed states as a non-classical resource. We relate the probability to measure specific photon patterns from a general Gaussian state in the Fock basis to a matrix function called the hafnian, which answers the last remaining question of sampling from Gaussian states. Based on this result, we design Gaussian Boson Sampling, a #P hard problem, using squeezed states. This approach leads to a more efficient photonic boson sampler with significant advantages in generation probability and measurement time over currently existing protocols.

We analyze the recurrence probability (Pólya number) for d-dimensional unbiased quantum walks. A sufficient condition for a quantum walk to be recurrent is derived. As a by-product we find a simple criterion for localization of quantum walks. In contrast with classical walks, where the Pólya number is characteristic for the given dimension, the recurrence probability of a quantum walk depends in general on the topology of the walk, choice of the coin and the initial state. This allows us to change the character of the quantum walk from recurrent to transient by altering the initial state.