Unitary and Open Scattering Quantum Walks on Graphs
- URL: http://arxiv.org/abs/2409.08428v1
- Date: Thu, 12 Sep 2024 23:25:57 GMT
- Title: Unitary and Open Scattering Quantum Walks on Graphs
- Authors: Alain Joye,
- Abstract summary: We study a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices.
We show that Scattering Quantum Walks encompass several known Quantum Walks.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We study a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the edges of the graph, with a scattering process at each vertex governed by the scattering matrix assigned to it. We show that Scattering Quantum Walks encompass several known Quantum Walks. Additionally, we introduce two classes of Open Scattering Quantum Walks on arbitrary graphs, also parameterized by scattering matrices: one class defined on the edges and the other on the vertices of the graph. We show that these walks give rise to proper Quantum Channels and describe their main spectral and dynamical properties, relating them to naturally associated classical Markov chains.
Related papers
- Third quantization of open quantum systems: new dissipative symmetries
and connections to phase-space and Keldysh field theory formulations [77.34726150561087]
We reformulate the technique of third quantization in a way that explicitly connects all three methods.
We first show that our formulation reveals a fundamental dissipative symmetry present in all quadratic bosonic or fermionic Lindbladians.
For bosons, we then show that the Wigner function and the characteristic function can be thought of as ''wavefunctions'' of the density matrix.
arXiv Detail & Related papers (2023-02-27T18:56:40Z) - A family of quantum walks on a finite graph corresponding to the
generalized weighted zeta function [0.0]
The result enables us to obtain the characteristic of the transition matrix of the quantum walk.
We treat finite graphs allowing multi-edges and multi-loops.
arXiv Detail & Related papers (2022-11-02T06:08:41Z) - Spectral bounds for the quantum chromatic number of quantum graphs [0.0]
We obtain lower bounds for the classical and quantum number of a quantum graph using eigenvalues of the quantum adjacency matrix.
We generalize all the spectral bounds given by Elphick and Wocjan to the quantum graph setting.
Our results are achieved using techniques from linear algebra and a complete definition of quantum graph coloring.
arXiv Detail & Related papers (2021-12-03T05:36:21Z) - Quantum information spreading in a disordered quantum walk [50.591267188664666]
We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern.
We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport.
Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
arXiv Detail & Related papers (2020-10-20T20:03:19Z) - Unraveling the topology of dissipative quantum systems [58.720142291102135]
We discuss topology in dissipative quantum systems from the perspective of quantum trajectories.
We show for a broad family of translation-invariant collapse models that the set of dark state-inducing Hamiltonians imposes a nontrivial topological structure on the space of Hamiltonians.
arXiv Detail & Related papers (2020-07-12T11:26:02Z) - Continuous-time quantum walks in the presence of a quadratic
perturbation [55.41644538483948]
We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$.
We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
arXiv Detail & Related papers (2020-05-13T14:53:36Z) - Dirac Particles in Transparent Quantum Graphs: Tunable transport of
relativistic quasiparticles in branched structures [0.0]
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points.
The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the Dirac equation on metric graphs.
arXiv Detail & Related papers (2020-04-16T15:35:56Z) - Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer.
The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
arXiv Detail & Related papers (2020-03-25T02:46:14Z) - Search on Vertex-Transitive Graphs by Lackadaisical Quantum Walk [0.0]
The lackadaisical quantum walk is a discrete-time, coined quantum walk on a graph.
It can improve spatial search on the complete graph, discrete torus, cycle, and regular complete bipartite graph.
We present a number of numerical simulations supporting this hypothesis.
arXiv Detail & Related papers (2020-02-26T00:10:38Z) - From stochastic spin chains to quantum Kardar-Parisi-Zhang dynamics [68.8204255655161]
We introduce the asymmetric extension of the Quantum Symmetric Simple Exclusion Process.
We show that the time-integrated current of fermions defines a height field which exhibits a quantum non-linear dynamics.
arXiv Detail & Related papers (2020-01-13T14:30:36Z) - Discrete-Time Quantum Walks on Oriented Graphs [0.0]
We define discrete-time quantum walks on arbitrary oriented graphs.
We introduce a parameter, called alpha, that quantifies the amount of orientation.
arXiv Detail & Related papers (2020-01-13T01:42:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.