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 and transition from low energy level to high energy level, thus obtaining the physical process of quantum walking along a straight line under the condition of equal probability. Then, the optical radiation in the quantum walk is mapped into a Gaussian pulse of the electric field, and the Maxwell's equation is solved by the three dimensional finite-difference time-domain method to obtain the spatial electric distributio. Finally, the physical process ofquantum walking on two parallel lines is further discussed, involving some physical properties such as electromagnetic coupling or coherence, quantum state exchange and so on. The electric field coupling between two lines can be calculated by FDTD, which provides a useful tool for the design and analysis of quantum devices.
The largest ensemble of qubits which satisfy the general transformation of equal superposition is obtained by different methods, namely, linearity, no-superluminal signalling and non-increase of entanglement under LOCC. We also consider the associated quantum random walk and show that all unitary balanced coins give the same asymmetric spatial probability distribution. It is further illustrated that unbalanced coins, upon appropriate superposition, lead to new unbiased walks which have no classical analogues.
We study electric quantum walks in two dimensions considering Grover, Alternate, Hadamard, and DFT quantum walks. In the Grover walk the behaviour under an electric field is easy to summarize: when the field direction coincides with the x or y axes, it produces a transient trapping of the probability distribution along the direction of the field, while when it is directed along the diagonals, a perfect 2D trapping is frustrated. The analysis of the alternate walk helps to understand the behaviour of the Grover walk as both walks are partially equivalent; in particular, it helps to understand t…
We prove that a quantum walk can detect the presence of a marked element in a graph in $O(\sqrt{WR})$ steps for any initial probability distribution on vertices. Here, $W$ is the total weight of the graph, and $R$ is the effective resistance. This generalizes the result by Szegedy that is only applicable if the initial distribution is stationary. We describe a time-efficient quantum algorithm for 3-distinctness based on these ideas.
We report on the experimental realization of electric quantum walks, which mimic the effect of an electric field on a charged particle in a lattice. Starting from a textbook implementation of discrete-time quantum walks, we introduce an extra operation in each step to implement the effect of the field. The recorded dynamics of such a quantum particle exhibits features closely related to Bloch oscillations and interband tunneling. In particular, we explore the regime of strong fields, demonstrating contrasting quantum behaviors: quantum resonances vs. dynamical localization depending on whether…
We examine an unexplored quantum phenomenon we call oscillatory localization, where a discrete-time quantum walk with Grover's diffusion coin jumps back and forth between two vertices. We then connect it to the power dissipation of a related electric network. Namely, we show that there are only two kinds of oscillating states, called uniform states and flip states, and that the projection of an arbitrary state onto a flip state is bounded by the power dissipation of an electric circuit. By applying this framework to states along a single edge of a graph, we show that low effective resistance i…
We consider the Szegedy walk on graphs adding infinite length tails to a finite internal graph. We assume that on these tails, the dynamics is given by the free quantum walk. We set the $\ell^\infty$-category initial state so that the internal graph receives time independent input from the tails, say $\boldsymbolα_{in}$, at every time step. We show that the response of the Szegedy walk to the input, which is the output, say $\boldsymbolβ_{out}$, from the internal graph to the tails in the long time limit, is drastically changed depending on the reversibility of the underlying random walk. If t…
Quantum transport properties of electron systems driven by strong electric fields are studied by mapping the Landau-Zener transition dynamics to a quantum walk on a semi-infinite one-dimensional lattice with a reflecting boundary, where the sites correspond to energy levels and the boundary the ground state. Quantum interference induces a distribution localized around the ground state, and when the electric field is strengthened, a delocalization transition occurs describing breakdown of the original electron system.
The Polya number of a classical random walk on a regular lattice is known to depend solely on the dimension of the lattice. For one and two dimensions it equals one, meaning unit probability to return to the origin. This result is extremely sensitive to the directional symmetry, any deviation from the equal probability to travel in each direction results in a change of the character of the walk from recurrent to transient. Applying our definition of the Polya number to quantum walks on a line we show that the recurrence character of quantum walks is more stable against bias. We determine the r…
We study one-dimensional quantum walks in a homogeneous electric field. The field is given by a phase which depends linearly on position and is applied after each step. The long time propagation properties of this system, such as revivals, ballistic expansion and Anderson localization, depend very sensitively on the value of the electric field $Φ$, e.g., on whether $Φ/(2π)$ is rational or irrational. We relate these properties to the continued fraction expansion of the field. When the field is given only with finite accuracy, the beginning of the expansion allows analogous conclusions about th…
A simple coined quantum walk in one dimension can be characterized by a $SU(2)$ operator with three parameters which represents the coin toss. However, different such coin toss operators lead to equivalent dynamics of the quantum walker. In this manuscript we present the unitary equivalence classes of quantum walks and show that all the nonequivalent quantum walks can be distinguished by a single parameter. Moreover, we argue that the electric quantum walks are equivalent to quantum walks with time dependent coin toss operator.
The continuous limit of quantum walks (QWs) on the line is revisited through a recently developed method. In all cases but one, the limit coincides with the dynamics of a Dirac fermion coupled to an artificial electric and/or relativistic gravitational field. All results are carefully discussed and illustrated by numerical simulations.
We consider the spectral and dynamical properties of one-dimensional quantum walks placed into homogenous electric fields according to a discrete version of the minimal coupling principle. We show that for all irrational fields the absolutely continuous spectrum of these systems is empty, and prove Anderson localization for almost all (irrational) fields. This result closes a gap which was left open in the original study of electric quantum walks: a spectral and dynamical characterization of these systems for typical fields. Additionally, we derive an analytic and explicit expression for the L…
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 implementing a generalized measurement in terms of positive operator value measurement on a single qubit. The measurement of the single-photons' positions corresponds to a measurement of an element of the positive operator value measurement on the polarizations of the single-photons.
Institute of Theoretical Physics, University of Amsterdam（阿姆斯特丹大学理论物理研究所）；QuSoft, CWI（QuSoft，荷兰数学与计算机科学研究中心）；IRIF & CNRS（IRIF与法国国家科学研究中心）；Toyota Motor Europe, Materials Engineering Division（丰田汽车欧洲公司材料工程部门）；Department of Chemistry and Pharmaceutical Sciences, Vrije Universiteit（自由大学化学与药学系）；KdVI, University of Amsterdam（阿姆斯特丹大学KdVI）
We provide an explanation of recent experimental results of Xue et al., where full revivals in a time-dependent quantum walk model with a periodically changing coin are found. Using methods originally developed for "electric" walks with a space-dependent, rather than a time-dependent coin, we provide a full explanation of the observations of Xue et al. We extend the analysis from periodic time-dependence to quasi-periodic behaviour with periods incommensurate to the step size. Spectral analysis, one of the principal tools for the study of electric walks, fails for time-dependent systems, but w…
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes.
The main results on quantum walk search are scattered over different, incomparable frameworks, most notably the hitting time framework, originally by Szegedy, the electric network framework by Belovs, and the MNRS framework by Magniez, Nayak, Roland and Santha. As a result, a number of pieces are currently missing. For instance, the electric network framework allows quantum walks to start from an arbitrary initial state, but it only detects marked elements. In recent work by Ambainis et al., this problem was resolved for the more restricted hitting time framework, in which quantum walks must s…
We use quantum walks to construct a new quantum algorithm for element distinctness and its generalization. For element distinctness (the problem of finding two equal items among N given items), we get an O(N^{2/3}) query quantum algorithm. This improves the previous O(N^{3/4}) query quantum algorithm of Buhrman et.al. (quant-ph/0007016) and matches the lower bound by Shi (quant-ph/0112086). The algorithm also solves the generalization of element distinctness in which we have to find k equal items among N items. For this problem, we get an O(N^{k/(k+1)}) query quantum algorithm.
In this theoretical study, we analyze quantum walks on complex networks, which model network-based processes ranging from quantum computing to biology and even sociology. Specifically, we analytically relate the average long time probability distribution for the location of a unitary quantum walker to that of a corresponding classical walker. The distribution of the classical walker is proportional to the distribution of degrees, which measures the connectivity of the network nodes and underlies many methods for analyzing classical networks including website ranking. The quantum distribution b…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional $LC$ electric circuit can simulate a Schrödinger equation and hence a quantum walk. Especially, we propose a physical realization of a set of universal quantum gates consisting of the CNOT, Hadamard and $π/4$ phase-shift gates with the use of telegrapher wires and mixing bridges. Furthermore, we construct the $π/2^{n}$ phase-shift gate for an arbitrary integ…
We study Lévy walks in quenched disordered one-dimensional media, with scatterers spaced according to a long-tailed distribution. By analyzing the scaling relations for the random-walk probability and for the resistivity in the equivalent electric problem, we obtain the asymptotic behavior of the mean square displacement as a function of the exponent characterizing the scatterers distribution. We demonstrate that in quenched media different average procedures can display different asymptotic behavior. In particular, we estimate the moments of the displacement averaged over processes starting f…
Discrete-time quantum walks (DTQWs) in random artificial electric and gravitational fields are studied analytically and numerically. The analytical computations are carried by a new method which allows a direct exact analytical determination of the equations of motion obeyed by the average density operator. It is proven that randomness induces decoherence and that the quantum walks behave asymptotically like classical random walks. Asymptotic diffusion coefficients are computed exactly. The continuous limit is also obtained and discussed.
Quantum walks are processes that model dynamics in coherent systems. Their experimental implementations proved key to unveil novel phenomena in Floquet topological insulators. Here we realize a photonic quantum walk in the presence of a synthetic gauge field, which mimics the action of an electric field on a charged particle. By tuning the energy gaps between the two quasi-energy bands, we investigate intriguing system dynamics characterized by the interplay between Bloch oscillations and Landau-Zener transitions. When both gaps at quasi-energy values 0 and $π$ are vanishingly small, the Floqu…
