相关论文: Absorption problems for quantum walks in one dimen…

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…

Quantum walks have by now been realized in a large variety of different physical settings. In some of these, particularly with trapped ions, the walk is implemented in phase space, where the corresponding position states are not orthogonal.…

Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and…

We introduce a continuous-time quantum walk on an ultrametric space corresponding to the set of p-adic integers and compute its time-averaged probability distribution. It is shown that localization occurs for any location of the ultrametric…

The first general analytic solutions for the one-dimensional walk in position and momentum space are derived. These solutions reveal, among other things, new symmetry features of quantum walk probability densities and further insight into…

Recently, the quaternionic quantum walk was formulated by the first author as a generalization of discrete-time quantum walks. We treat the right eigenvalue problem of quaternionic matrices to analysis the spectra of its transition matrix.…

We study a 2-D disordered time-discrete quantum walk based on 1-D `generalized elephant quantum walk' where an entangling coin operator is assumed and which paves the way to a new set of properties. We show that considering a given disorder…

Quantum walks in an elaborately designed graph, is a powerful tool simulating physical and topological phenomena, constructing analog quantum algorithms and realizing universal quantum computing. Integrated photonics technology has emerged…

We experimentally demonstrate a quantum walk on a line in phase space using one and two trapped ion. A walk with up to 23 steps is realized by subjecting an ion to state-dependent displacement operations interleaved with quantum coin…

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

Inspired by the classical phenomenon of random walk, the concept of quantum walk has emerged recently as a powerful platform for the dynamical simulation of complex quantum systems, entanglement production and universal quantum computation.…

In this work we study quantum algorithms for Hopcroft's problem which is a fundamental problem in computational geometry. Given $n$ points and $n$ lines in the plane, the task is to determine whether there is a point-line incidence. The…

We study a generalized Hadamard walk in one dimension with three inner states. The particle governed by the three-state quantum walk moves, in superposition, both to the left and to the right according to the inner state. In addition to…

The quantum walk was originally proposed as a quantum mechanical analogue of the classical random walk, and has since become a powerful tool in quantum information science. In this paper, we show that discrete time quantum walks provide a…

We implement the proof of principle for the quantum walk of one ion in a linear ion trap. With a single-step fidelity exceeding 0.99, we perform three steps of an asymmetric walk on the line. We clearly reveal the differences to its…

We investigate quantum walks in multiple dimensions with different quantum coins. We augment the model by assuming that at each step the amplitudes of the coin state are multiplied by random phases. This model enables us to study in detail…

The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…

We put forward a new, versatile and highly-scalable experimental setup for the realization of discrete two-dimensional quantum random walks with a single-qubit coin and tunable degree of decoherence. The proposed scheme makes use of a small…

We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…

Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…