Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Non-Markovianity in Discrete-Time Open Quantum Random Walk on Arbitrary Graphs (2407.20888v2)

Published 30 Jul 2024 in quant-ph

Abstract: In this work, we present a new model of the Discrete-Time Open Quantum Walk (DTOQW) applicable to an arbitrary graph, thereby going beyond the case of quantum walks on regular graphs. We study the impact of noise in the dynamics of quantum walk by applying Kraus operators of different dimensions which are constructed using the Weyl operators. The DTOQW employs these Kraus operators as its coin operators. The walker dynamics are studied under the impact of non-Markovian amplitude damping, dephasing and depolarizing noise channels. We also implement the walk on various graphs, including path graphs, cycle graphs, star graphs, complete graphs, complete bipartite graphs, etc. We gauge the dynamics by computing coherence and fidelity at different time steps, taking into account the influence of noise. Furthermore, we compute the probability distribution at different time steps for the above noises, which represents the availability of the quantum walker at different vertices of the graph.

Citations (1)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com