Related papers: Tweezer-programmable 2D quantum walks in a Hubbard…
Classical optics can be used to efficiently implement certain quantum information processing tasks with a high degree of control, for example, one-dimensional quantum walks through the space of orbital angular momentum of light directed by…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…
In this paper we isolate the combinatorial property responsible (at least in part) for the computational speedups recently observed in some quantum walk algorithms. We find that continuous-time quantum walks can exploit the covering space…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In…
Optical tweezer arrays have transformed atomic and molecular physics, now forming the backbone for a range of leading experiments in quantum computing, simulation, and metrology. Typical experiments trap tens to hundreds of atomic qubits,…
A quantum computing algorithm for rhythm generation is presented, which aims to expand and explore quantum computing applications in the arts, particularly in music. The algorithm maps quantum random walk trajectories onto a rhythmspace --…
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…
The subject of this paper is a kind of dynamical systems called quantum walks. We study one-dimensional homogeneous analytic quantum walks U. We explain how to identify the space of all the uniform intertwining operators between these…
Quantum computation and quantum communication are expected to provide users with capabilities inaccessible by classical physics. However, scalability to larger systems with many qubits is challenging. One solution is to develop a quantum…
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a search space containing a single marked element only. We show…
We present an investigation of many-particle quantum walks in systems of non-interacting distinguishable particles. Along with a redistribution of the many-particle density profile we show that the collective evolution of the many-particle…
Quantum walks (QWs) are of interest as examples of uniquely quantum behavior and are applicable in a variety of quantum search and simulation models. Implementing QWs on quantum devices is useful from both points of view. We describe a…
Large arrays of individually controlled atoms trapped in optical tweezers are a very promising platform for quantum engineering applications. However, to date, only disordered arrays have been demonstrated, due to the non-deterministic…
The experimental realization of Fermi-Hubbard tweezer arrays opens a new stage for engineering fermionic matter, where programmable lattice geometries and Hubbard model parameters are combined with single-site imaging. In order to use these…
We investigate continuous-time quantum walks of two indistinguishable particles (bosons, fermions or hard-core bosons) in one-dimensional lattices with nearest-neighbour interactions. The two interacting particles can undergo independent-…
The ability to engineer parallel, programmable operations between desired qubits within a quantum processor is central for building scalable quantum information systems. In most state-of-the-art approaches, qubits interact locally,…
Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…
Quantum state preparation in high-dimensional systems is an essential requirement for many quantum-technology applications. The engineering of an arbitrary quantum state is, however, typically strongly dependent on the experimental platform…
Quantum walks have been shown to be fruitful tools in analysing the dynamic properties of quantum systems. This article proposes to use quantum walks as an approach to Quantum Neural Networks (QNNs). QNNs replace binary McCulloch-Pitts…
Quantum random walks are the quantum counterpart of classical random walks, and were recently studied in the context of quantum computation. A quantum random walker is subject to self interference, leading to a remarkably different behavior…