相关论文: Equal Superposition Transformations and Quantum Ra…

We study a class of symmetric quantum walks on Hamming graphs, where the distance between vertices specifies the transition probability. A special model is the simple quantum walk on the hypercube, which has been discussed in the…

We study the set of probability distributions visited by a continuous-time quantum walk on graphs. An edge-weighted graph G is universal mixing if the instantaneous or average probability distribution of the quantum walk on G ranges over…

We consider the effect of different unitary noise mechanisms on the evolution of a quantum walk (QW) on a linear chain with a generic coin operation: (i) bit-flip channel noise, restricted to the coin subspace of the QW, and (ii)…

This paper is motivated by the following problem. Define a quantum walk on a positively weighted path (linear chain). Can the weights be tuned so that perfect state transfer occurs between the first vertex and any other position? We do not…

We investigate the ballistic spreading behavior of the one-dimensional discrete time quantum walks whose time evolution is driven by any balanced quantum coin. We obtain closed-form expressions for the long-time variance of position of…

We study the sampling complexity of a probability distribution associated with an ensemble ofidentical noninteracting bosons undergoing a quantum random walk on a one-dimensional lattice.With uniform nearest-neighbor hopping we show that…

We investigate how arbitrary number of entangled qubits affects properties of quantum walk. We consider variance, positions with non-zero probability density and entropy as criteria to determine the optimal number of entangled qubits in…

For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…

Quantum walks, being the quantum analogue of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the `glued trees' algorithm, which provides…

We investigate the intermediate permutational symmetries of a system of qubits, that lie in between the perfect symmetric and antisymmetric cases. We prove that, on average, pure states of qubits picked at random with respect to the uniform…

We present an introduction to coined quantum walks on regular graphs, which have been developed in the past few years as an alternative to quantum Fourier transforms for underpinning algorithms for quantum computation. We then describe our…

We demonstrate an implementation of unambiguous state discrimination of two equally probable single-qubit states via a one-dimensional photonic quantum walk experimentally. Furthermore we experimentally realize a quantum walk algorithm for…

Based on the three-level quantum system, when it is in resonance, according to any two lattice points closest to Hamiltonian coupling, electrons transition from high energy level to low energy level and release photons; Or absorb photons…

The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smaller Hilbert space, which is spanned merely by the site basis.…

Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…

Quantum Teleportation, the transfer of the state of one quantum system to another without direct interaction between both systems, is an important way to transmit information encoded in quantum states and to generate quantum correlations…

Quantum walks provide simple models of various fundamental processes. It is pivotal to know when the dynamics underlying a walk lead to quantum advantages just by examining its statistics. A walk with many indistinguishable particles and…

A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exact quantum analogues of classical Markov chains.…

Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…

Using electrostatic gates to control the electron positions, we present a new controlled-NOT gate based on quantum dots. The qubit states are chosen to be the spin states of an excess conductor electron in the quantum dot; and the main…