Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Physics Communications

Quantum walk as generalized evolution and measurement device

Xiang Zhan

Published Aug 1, 2019• 2 citations
Publisher

Abstract

Abstract We show that arbitrary quantum evolution, both unitary and non-unitary ones, can be efficiently realized via one-dimensional quantum walk. This is done based on the equivalence between quantum evolution and positive-operated valued measurements, and an algorithm of properly controlling one-dimensional discrete-time quantum walk to realize arbitrary positive-operated valued measurements. Furthermore, our method based on one-dimensional quantum walk can be easily generalized to other platforms Our method enriches technics for quantum information processes, and the applications of quantum walk.

DOI
10.1088/2399-6528/ab3c00

Related papers

Quantum Walk as a Generalized Measuring Device

Paweł Kurzyński, Antoni Wójcik

We show that a one-dimensional discrete time quantum walk can be used to implement a generalized measurement in terms of a positive operator value measure (POVM) on a single qubit. More precisely, we show that for a single qubit any set of rank 1 and rank 2 POVM elements can be generated by a properly engineered quantum walk. In such a scenario the measurement of a particle at a position x=i corresponds to a measurement of a POVM element E_{i} on a qubit. Since the idea of quantum walks originates from the von Neumann model of measurement, in which the change of the position of the pointer depends on the state of the system that is being measured, we argue that von Neumann measurements can be naturally extended to POVMs if one includes the internal evolution of the system in the model.

arXiv:1208.1800•Physical Review Letters•May 14, 2013•75 citations

Generalized Quantum Measurements on a Higher-Dimensional System via Quantum Walks

Xiaowei Wang, Xiang Zhan, Yulin Li +6 more

Quantum measurements play a fundamental role in quantum mechanics. Especially, generalized quantum measurements provide a powerful and versatile tool to extract information from quantum systems. However, how to realize them on an arbitrary higher-dimensional quantum system remains a challenging task. Here we propose a simple recipe for the implementation of a general positive-operator valued measurement (POVM) on a higher-dimensional quantum system via a one-dimensional discrete-time quantum walk with a two-dimensional coin. Furthermore, using single photons and linear optics, we realize experimentally a symmetric, informationally complete (SIC) POVM on a three-dimensional system with high fidelity. As an application, we realize a qutrit state tomography with SIC-POVM and confirm that the infidelity scaling achieved by the qutrit SIC-POVM is as good as that based on mutually unbiased bases. Our study paves the way to explore physics and information in higher-dimensional quantum systems and finds applications in various quantum information processing tasks that rely on generalized quantum measurements.

Physical Review Letters•Oct 10, 2023•33 citations

Experimental realization of a generalized measuring device via a one-dimensional photonic quantum walk

Zhihao Bian, Rong Zhang, Qin, Hao +3 more

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.

arXiv:1410.2407•Oct 9, 2014•1 citation

Quantum walks can unitarily match random walks on finite graphs

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

Quantum and random walks were proven to be equivalent on finite graphs by demonstrating how to construct a time-dependent random walk sharing the exact same evolution of vertex probability of any given discrete-time coined quantum walk. Such equivalence stipulated a deep connection between the processes that is far stronger than simply considering quantum walks as quantum analogues of random walks. This article expands on the connection between quantum and random walks by demonstrating a procedure that constructs a time-dependent quantum walk matching the evolution of vertex probability of any given random walk in a unitary way. It is a trivial fact that a quantum walk measured at all time steps of its evolution degrades to a random walk. More interestingly, the method presented describes a quantum walk that matches a random walk without measurement operations, such that the unitary evolution of the quantum walk captures the probability evolution of the random walk. The construction procedure is general, covering both homogeneous and non-homogeneous random walks. For the homogeneous random walk case, the properties of unitary evolution imply that the quantum walk described is time-dependent since homogeneous quantum walks do not converge for arbitrary initial conditions

•Mar 11, 2021•1 citation

Quantum Walks: Theory, Application, and Implementation

Albert T. Schmitz

The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the quantum walk. The first part is the theory of the quantum walk. This includes definitions and considerations for the various incarnations of the discrete-time quantum walk and a discussion on the general method for connecting the continuous-time and discrete-time versions. As a result, it is shown that most versions of the discrete-time quantum walk can be put into a general form and this can be used to simulate any continuous-time quantum walk. The second part uses these results for a hypothetical application. The application presented is a search algorithm that appears to scale in the time for completion independent of the size of the search space. This behavior is then elaborated upon and shown to have general qualitative agreement with simulations to within the approximations that are made. The third part introduces a method of implementation. Given a universal quantum computer, the method is discussed and shown to simulate an arbitrary discrete-time quantum walk. Some of the benefits of this method are that half the unitary evolution can be achieved without the use of any gates and there may be some possibility for error detection. The three parts combined suggest a possible experiment, given a quantum computing scheme of sufficient robustness.

•Jan 1, 2016•1 citation

Determinate arbitrary quantum state engineering through one-dimensional quantum walks

Yu Wang, Meng Li, Yuanyuan Zhao

Efficient generation of arbitrary superposed quantum states in high-dimensional systems is crucial for various quantum technologies but remains fundamentally challenging because of the intricate and extensive parameter control. In this work, we propose a generalized discrete one-dimensional quantum walk model with time- and position-dependent coin operations, and varied shift lengths. This approach enables deterministic and direct preparation of any qudit state | ϕ 〉 = ∑ k = 0 d − 1 a k | k 〉 using binary or ternary tree structures, without solving quadratic equations. Our method requires only O ( log d ) steps and O ( d ) coin operations, significantly reducing the resource requirements compared to the previous approach of O ( d ) steps and O ( d 2 ) coin operations. Additionally, we propose an experimental scheme based on successive interferometers, demonstrating that our method is compatible with current state-of-the-art experimental technologies. This efficient method for preparing quantum superposition states lays a foundation for advancing quantum technologies, with broad applications in quantum information processing.

Physical Review Research•May 29, 2025•1 citation
Abstract We show that arbitrary quantum evolution, both unitary and non-unitary ones, can be efficiently realized via one-dimensional quantum walk. This is done based on the equivalence between quantum evolution and positive-operated valued measurements, and an algorithm of properly controlling one-dimensional discrete-time quantum walk to realize arbitrary positive-operated valued measurements. Furthermore, our method based on one-dimensional quantum walk can be easily generalized to other platforms Our method enriches technics for quantum information processes, and the applications of quantum walk.
We show that a one-dimensional discrete time quantum walk can be used to implement a generalized measurement in terms of a positive operator value measure (POVM) on a single qubit. More precisely, we show that for a single qubit any set of rank 1 and rank 2 POVM elements can be generated by a properly engineered quantum walk. In such a scenario the measurement of a particle at a position x=i corresponds to a measurement of a POVM element E_{i} on a qubit. Since the idea of quantum walks originates from the von Neumann model of measurement, in which the change of the position of the pointer depends on the state of the system that is being measured, we argue that von Neumann measurements can be naturally extended to POVMs if one includes the internal evolution of the system in the model.
Quantum measurements play a fundamental role in quantum mechanics. Especially, generalized quantum measurements provide a powerful and versatile tool to extract information from quantum systems. However, how to realize them on an arbitrary higher-dimensional quantum system remains a challenging task. Here we propose a simple recipe for the implementation of a general positive-operator valued measurement (POVM) on a higher-dimensional quantum system via a one-dimensional discrete-time quantum walk with a two-dimensional coin. Furthermore, using single photons and linear optics, we realize experimentally a symmetric, informationally complete (SIC) POVM on a three-dimensional system with high fidelity. As an application, we realize a qutrit state tomography with SIC-POVM and confirm that the infidelity scaling achieved by the qutrit SIC-POVM is as good as that based on mutually unbiased bases. Our study paves the way to explore physics and information in higher-dimensional quantum systems and finds applications in various quantum information processing tasks that rely on generalized quantum measurements.
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.
Quantum and random walks were proven to be equivalent on finite graphs by demonstrating how to construct a time-dependent random walk sharing the exact same evolution of vertex probability of any given discrete-time coined quantum walk. Such equivalence stipulated a deep connection between the processes that is far stronger than simply considering quantum walks as quantum analogues of random walks. This article expands on the connection between quantum and random walks by demonstrating a procedure that constructs a time-dependent quantum walk matching the evolution of vertex probability of any given random walk in a unitary way. It is a trivial fact that a quantum walk measured at all time steps of its evolution degrades to a random walk. More interestingly, the method presented describes a quantum walk that matches a random walk without measurement operations, such that the unitary evolution of the quantum walk captures the probability evolution of the random walk. The construction procedure is general, covering both homogeneous and non-homogeneous random walks. For the homogeneous random walk case, the properties of unitary evolution imply that the quantum walk described is time-dependent since homogeneous quantum walks do not converge for arbitrary initial conditions
The quantum walk is a method for conceptualizing and designing quantum computing algorithms and it comes in two forms: the continuous-time and discrete-time quantum walk. The thesis is organized into three parts, each of which looks to develop the concept and uses of the quantum walk. The first part is the theory of the quantum walk. This includes definitions and considerations for the various incarnations of the discrete-time quantum walk and a discussion on the general method for connecting the continuous-time and discrete-time versions. As a result, it is shown that most versions of the discrete-time quantum walk can be put into a general form and this can be used to simulate any continuous-time quantum walk. The second part uses these results for a hypothetical application. The application presented is a search algorithm that appears to scale in the time for completion independent of the size of the search space. This behavior is then elaborated upon and shown to have general qualitative agreement with simulations to within the approximations that are made. The third part introduces a method of implementation. Given a universal quantum computer, the method is discussed and shown to simulate an arbitrary discrete-time quantum walk. Some of the benefits of this method are that half the unitary evolution can be achieved without the use of any gates and there may be some possibility for error detection. The three parts combined suggest a possible experiment, given a quantum computing scheme of sufficient robustness.
Efficient generation of arbitrary superposed quantum states in high-dimensional systems is crucial for various quantum technologies but remains fundamentally challenging because of the intricate and extensive parameter control. In this work, we propose a generalized discrete one-dimensional quantum walk model with time- and position-dependent coin operations, and varied shift lengths. This approach enables deterministic and direct preparation of any qudit state | ϕ 〉 = ∑ k = 0 d − 1 a k | k 〉 using binary or ternary tree structures, without solving quadratic equations. Our method requires only O ( log d ) steps and O ( d ) coin operations, significantly reducing the resource requirements compared to the previous approach of O ( d ) steps and O ( d 2 ) coin operations. Additionally, we propose an experimental scheme based on successive interferometers, demonstrating that our method is compatible with current state-of-the-art experimental technologies. This efficient method for preparing quantum superposition states lays a foundation for advancing quantum technologies, with broad applications in quantum information processing.