Related papers: Staggered quantum walks with superconducting micro…
With the increasing crossover between quantum information and machine learning, quantum simulation of neural networks has drawn unprecedentedly strong attention, especially for the simulation of associative memory in Hopfield neural…
We analyze the quantum walk in higher spatial dimensions and compare classical and quantum spreading as a function of time. Tensor products of Hadamard transformations and the discrete Fourier transform arise as natural extensions of the…
We propose a modified version of the quantum walk-based search algorithm created by Shenvi, Kempe and Whaley, also known as the SKW algorithm. In our version of the algorithm, we modified the evolution operator of the system so that it is…
We implement a quantum walk in phase space with a new mechanism based on the superconducting resonator-assisted double quantum dots. By analyzing the hybrid system, we obtain the necessary factors of realization of a quantum walk in phase…
We consider discrete-time evolution equations in which the stochastic operator of a classical random walk is replaced by a unitary operator. Such a problem has gained much attention as a framework for coined quantum walks that are essential…
Recent advance in quantum simulations of interacting photons using superconducting circuits offers opportunities for investigating the Bose-Hubbard model in various geometries with hopping coefficients and self-interactions tuned to both…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
Quantum walks provide a versatile framework for probing the structural and dynamical properties of complex systems ranging from biological networks to synthetic materials. However, their realization on current noisy pre-fault-tolerant…
We consider a decentralized learning setting in which data is distributed over nodes in a graph. The goal is to learn a global model on the distributed data without involving any central entity that needs to be trusted. While gossip-based…
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…
We propose a Kuramoto model of coupled oscillators on a time-varying graph, whose dynamics is dictated by a Markov process in the space of graphs. The simplest representative is considering a base graph and then the subgraph determined by…
Transformers are increasingly employed for graph data, demonstrating competitive performance in diverse tasks. To incorporate graph information into these models, it is essential to enhance node and edge features with positional encodings.…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
We propose a robust and efficient way to store and transport quantum information via one-dimensional discrete time quantum walks. We show how to attain an effective dispersionless wave packet evolution using only two types of local unitary…
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…
Discrete-time quantum walks can be regarded as quantum dynamical simulators since they can simulate spatially discretized Schr\"{o}dinger, massive Dirac, and Klein-Gordon equations. Here, two different types of Fibonacci discrete-time…
In this paper we define a quantum stochastic walk on arbitrary directed graph with super-diffusive propagation on a line graph. Our model is based on global environment interaction QSW, which is known to have ballistic propagation. However…
Quantum walks subject to decoherence generically suffer the loss of their genuine quantum feature, a quadratically faster spreading compared to classical random walks. This intuitive statement has been verified analytically for certain…
We investigate the transport and entanglement properties exhibited by quantum walks with coin operators concatenated in a space-time fractal structure. Inspired by recent developments in photonics, we choose the paradigmatic Sierpinski…
We devise a protocol to build 1D time-dependent quantum walks in 1D maximizing the spatial spread throughout the procedure. We allow only one of the physical parameters of the coin-tossing operator to vary, i.e. the angle $\theta$, such…