Partition-based discrete-time quantum walks
From MaRDI portal
Publication:1654075
Abstract: We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.
Recommendations
Cites work
- A note on the spectral mapping theorem of quantum walk models
- A remark on zeta functions of finite graphs via quantum walks
- A short course on topological insulators. Band structure and edge states in one and two dimensions
- Coins make quantum walks faster
- Connecting coined quantum walks with Szegedy's model
- Efficient quantum circuits for Szegedy quantum walks
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
- Five-diagonal matrices and zeros of orthogonal polynomials on the unit circle
- Generator of an abstract quantum walk
- Gridline graphs: A review in two dimensions and an extension to higher dimensions
- scientific article; zbMATH DE number 3181 (Why is no real title available?)
- scientific article; zbMATH DE number 3282537 (Why is no real title available?)
- Physical implementation of quantum walks
- Quantum graph walks. I: Mapping to quantum walks
- Quantum Walks
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum walks on graphs
- Realistic quantum probability
- Scattering theory and discrete-time quantum walks
- The CGMV method for quantum walks
- The staggered quantum walk model
- Three routes to the exact asymptotics for the one-dimensional quantum walk
- Unitary equivalent classes of one-dimensional quantum walks
Cited in
(20)- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- Quantum walks on hypergraphs
- Quantum walks on embeddings
- A quantum searching model finding one of the edges of a subgraph in a complete graph
- Quantum walks with memory provided by parity of memory
- A quantum walk induced by Hoffman graphs and its periodicity
- Eigenbasis of the evolution operator of 2-tessellable quantum walks
- The staggered quantum walk model
- Supersymmetry for chiral symmetric quantum walks
- The Witten index for 1D supersymmetric quantum walks with anisotropic coins
- Szegedy quantum walks with memory on regular graphs
- Generating highly entangled states via discrete-time quantum walks with Parrondo sequences
- On the equivalence between quantum and random walks on finite graphs
- Eigenvalues of quantum walk induced by recurrence properties of the underlying birth and death process: application to computation of an edge state
- Crossovers induced by discrete-time quantum walks
- Projection theorem for discrete-time quantum walks
- Spatial search on Johnson graphs by discrete-time quantum walk
- Discretization of continuous-time quantum walks via the staggered model with Hamiltonians
- Hamiltonians of bipartite walks
- The absolute zeta function with respect to a bipartite walk on a bipartite graph
This page was built for publication: Partition-based discrete-time quantum walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1654075)