Related papers: Non-interacting multi-particle quantum random walk…
Full control over the dynamics of interacting, indistinguishable quantum particles is an important prerequisite for the experimental study of strongly correlated quantum matter and the implementation of high-fidelity quantum information…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
We report on the theoretical analysis of bosonic and fermionic non-interacting systems in a discrete two-particle quantum walk affected by different kinds of disorder. We considered up to 100-step QWs with a spatial, temporal and…
We show a simulation of quantum random walks with multiple photons using a staggered array of 50/50 beam splitters with a bank of detectors at any desired level. We discuss the multiphoton interference effects that are inherent to this…
The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph.…
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional "collision"- like interference in the quantum…
Quantum walks have emerged as an interesting alternative to the usual circuit model for quantum computing. While still universal for quantum computing, the quantum walk model has very different physical requirements, which lends itself more…
The article deals with one- and two-particle quantum walks on a graph with Braess-like topology and analyzes the issue of network congestion in the quantum world. Our approach to the study of congestion in quantum networks is based on the…
Quantum particles are known to be faster than classical when they propagate stochastically on certain graphs. A time needed for a particle to reach a target node on a distance, the hitting time, can be exponentially less for quantum walks…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…
We investigate quantum superposition effects in two-dimensional quantum walks of identical particles with different statistics under particle exchange, starting from various different initial configurations. To characterize interparticle…
Quantum walks of interacting particles may display non-trivial features due to the interplay between the statistical nature and the many-body interactions associated to them. We analyze the quantum walk of interacting defects on top of an…
With photonics, the quantum computational advantage has been demonstrated on the task of boson sampling. Next, developing quantum-enhanced approaches for practical problems becomes one of the top priorities for photonic systems. Quantum…
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum algorithms. Here we use numerical simulations to study the properties of discrete, coined quantum walks. We investigate the variation in the…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
Quantum walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
In this article, we give a first example of a pair of quantum isomorphic, non-isomorphic strongly regular graphs, that is, non-isomorphic strongly regular graphs having the same homomorphism counts from all planar graphs. The pair consists…
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links.…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…