Steady states of continuous-time open quantum walks

Article

Abstract

Continuous-time open quantum walks (CTOQW) are introduced as the formulation of quantum dynamical semigroups of trace-preserving and completely positive linear maps (or quantum Markov semigroups) on graphs. We show that a CTOQW always converges to a steady state regardless of the initial state when a graph is connected. When the graph is both connected and regular, it is shown that the steady state is the maximally mixed state. As shown by the examples in this article, the steady states of CTOQW can be very unusual and complicated even though the underlying graphs are simple. The examples demonstrate that the structure of a graph can affect quantum coherence in CTOQW through a long-time run. Precisely, the quantum coherence persists throughout the evolution of the CTOQW when the underlying topology is certain irregular graphs (such as a path or a star as shown in the examples). In contrast, the quantum coherence will eventually vanish from the open quantum system when the underlying topology is a regular graph (such as a cycle).

Keywords

Semigroups on graphs Continuous-time open quantum walks Steady states 

References

  1. 1.
    Gorini, V., Kossakowski, A., Sudarshan, E.C.G.: Completely positive dynamical semigroups on N-level systems. J. Math. Phys. 17, 821–825 (1976)ADSMathSciNetCrossRefGoogle Scholar
  2. 2.
    Lindblad, G.: On the generators of quantum dynamical semigroups. Commun. Math. Phys. 48, 119–130 (1976)ADSMathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Breuer, H.-P., Petruccione, F.: The Theory of Open Quantum Systems. Oxford University Press, Oxford (2006)MATHGoogle Scholar
  4. 4.
    Wolf, M.M.: Quantum channels & operations. Lecture Notes. www.nbi.dk/~ wolf /notes.pdf (2010)
  5. 5.
    Aldous, D., Fill, J.A.: Markov Chains and Random Walks on Graphs, Unfinished Monograph (this is recompiled version, 2014). www.stat.berkeley.edu/~aldous/RWG/book.pdf (2002)
  6. 6.
    Muelken, O., Blumen, A.: Continuous-time quantum walks: models for coherent transport on complex networks. Phys. Rep. 502, 37–87 (2011)ADSMathSciNetCrossRefGoogle Scholar
  7. 7.
    Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)MATHGoogle Scholar
  8. 8.
    Whitfield, J.D., Rodrguez-Rosario, C.A., Aspuru-Guzik, A.: Quantum stochastic walks: a generalization of classical random walks and quantum walks. Phys. Rev. A 81(2), 022323 (2010)ADSCrossRefGoogle Scholar
  9. 9.
    Pellegrini, C.: Continuous time open quantum random walks and non-Markovian Lindblad master equations. J. Stat. Phys. 154, 838–865 (2014)ADSMathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Attal, S., Petruccione, F., Sinayskiy, I.: Open quantum walks on graphs. Phys. Lett. A 376, 1545 (2012)ADSMathSciNetCrossRefMATHGoogle Scholar
  11. 11.
    Attal, S., Petruccione, F., Sabot, C., Sinayskiy, I.: Open quantum random walks. J. Stat. Phys. 147, 832 (2012)ADSMathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Sinayskiy, I., Petruccione, F.: Microscopic derivation of open quantum walks. Phys. Rev. A 92, 032105 (2015)ADSMathSciNetCrossRefGoogle Scholar
  13. 13.
    Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58, 915 (1998)ADSMathSciNetCrossRefGoogle Scholar
  14. 14.
    Kendon, V.: Decoherence in quantum walks—a review. Math. Struct. Comput. Sci. 17(6), 1169–1220 (2006)MathSciNetMATHGoogle Scholar
  15. 15.
    Venegas-Andraca, S.E.: Quantum walks: a comprehensive review. Quantum Inf. Process. 11(5), 1015–1106 (2012)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Rivas, A., Huelga, S.F.: Open Quantum Systems. An Introduction. Springer, Heidelberg (2011)MATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2017

Authors and Affiliations

  1. 1.Department of MathematicsBowie State UniversityBowieUSA
  2. 2.U.S. Army Research LaboratoryComputational and Information Sciences DirectorateAdelphiUSA

Personalised recommendations