相关论文: Equal Superposition Transformations and Quantum Ra…
Quantum walks behave differently from what we expect and their probability distributions have unique structures. They have localization, singularities, a gap, and so on. Those features have been discovered from the view point of mathematics…
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…
When confined to a topological environment consisting of a cycle coupled with a half-line, quantum walks exhibit long-term statistical tendencies which differ dramatically from the tendencies of classical random walks in the same…
Coined discrete-time quantum walks are studied using simple deterministic dynamical systems as coins whose classical limit can range from being integrable to chaotic. It is shown that a Loschmidt echo like fidelity plays a central role and…
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…
We study numerically the behavior of continuous-time quantum walks over networks which are topologically equivalent to square lattices. On short time scales, when placing the initial excitation at a corner of the network, we observe a fast,…
We look at two possible routes to classical behavior for the discrete quantum random walk on the line: decoherence in the quantum ``coin'' which drives the walk, or the use of higher-dimensional coins to dilute the effects of interference.…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
We report the successful generation of an entangled multiparticle quantum superposition of pure photon states. They result from a multiple (universal} cloning of a single photon qubit by a high gain, quantum-injected parametric amplifier.…
In the note we show how the choice of the initial states can influence the evolution of time-averaged probability distribution of the quantum walk on even cycles.
Quantum walks with long-range steps $R^{-\gamma}$ ($R$ being the distance between sites) on a discrete line behave in similar ways for all $\gamma\geq2$. This is in contrast to classical random walks, which for $\gamma >3$ belong to a…
It is shown how to construct quantum random walks with particles in an arbitrary faithful normal state. A convergence theorem is obtained for such walks, which demonstrates a thermalisation effect: the limit cocycle obeys a quantum…
The two major discrete time formulations for quantum walks, coined and scattering, are unitarily equivalent for arbitrary position dependent transition amplitudes and any topology (PRA {\bf 80}, 052301 (2009)). Although the proof explicit…
We introduce some new perfect state transfer and teleportation schemes by quantum walks with two coins. Encoding the transferred information in coin 1 state and alternatively using two coin operators, we can perfectly recover the…
There are presently two models for quantum walks on graphs. The "coined" walk uses discrete time steps, and contains, besides the particle making the walk, a second quantum system, the coin, that determines the direction in which the…
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…
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…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
We consider a process of noncolliding $q$-exchangeable random walks on $\mathbb{Z}$ making steps $0$ (straight) and $-1$ (down). A single random walk is called $q$-exchangeable if under an elementary transposition of the neighboring steps…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…