Related papers: Generating Haar-uniform Randomness using Stochasti…
Quantum walk represents one of the most promising resources for the simulation of physical quantum systems, and has also emerged as an alternative to the standard circuit model for quantum computing. Up to now the experimental…
We present a novel scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary X and Z rotations are…
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for…
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…
We introduce an analytically treatable spin decoherence model for quantum walk on a line that yields the exact position probability distribution of an unbiased classical random walk at all-time scales. This spin decoherence model depicts a…
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Surprisingly the looking natural random walk leading to Brownian motion occurs to be often biased in a very subtle way: usually refers to only approximate fulfillment of thermodynamical principles like maximizing uncertainty. Recently, a…
We explore the use of machine-learning techniques to detect quantum speedup in random walks on graphs. Specifically, we investigate the performance of three different neural-network architectures (variations on fully connected and…
Chaotic behavior of quantum systems can be characterized by the adherence of the expectation values of given probes to moments of the Haar distribution. In this work, we analyze the behavior of several probes of chaos using a technique…
Quantum walks in atomic systems, owing to their continuous nature, are especially well-suited for the simulation of many-body physics and can potentially offer an exponential speedup in solving certain black box problems. Photonics offers…
We investigate a novel quantum random walk (QRW) model, possibly useful in quantum algorithm implementation, that achieves a quadratically faster diffusion rate compared to its classical counterpart. We evaluate its asymptotic behavior…
In the present paper, the first in a series of two, we propose a model of universal quantum computation using a fermionic/bosonic multi-particle continuous-time quantum walk with two internal states (e.g., the spin-up and down states of an…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
This work describes a new algorithm for creating a superposition over the edge set of a graph, encoding a quantum sample of the random walk stationary distribution. The algorithm requires a number of quantum walk steps scaling as…
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…
Temporal multiplexing provides an efficient and scalable approach to realize a quantum random walk with photons that can exhibit topological properties. But two dimensional time-multiplexed topological quantum walks studied so far have…
Random numbers are a valuable commodity in gaming and gambling, simulation, conventional and quantum cryptography, and in non-conventional computing schemes such as stochastic computing. We propose to generate a random bit using a position…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
Unitary $2$-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and…
In our former work (Sci. Rep. 4: 6039, 2014), we theoretically and numerically demonstrated that chaotic oscillation can be induced in a nanoscale system consisting of quantum dots between which energy transfer occurs via optical near-field…