Steady states of continuous-time open quantum walks

@article{Liu2017SteadySO,
  title={Steady states of continuous-time open quantum walks},
  author={C. Liu and R. Balu},
  journal={Quantum Information Processing},
  year={2017},
  volume={16},
  pages={1-11}
}
  • C. Liu, R. Balu
  • Published 2017
  • Mathematics, Physics, Computer Science
  • Quantum Information Processing
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… Expand
Short-time behavior of continuous-time quantum walks on graphs
Dynamical evolution of systems with sparse Hamiltonians can always be recognized as continuous time quantum walks (CTQWs) on graphs. In this paper, we analyze the short time asymptotics of CTQWs. InExpand
Quantum Markov processes on graphs, monitoring and hitting times
We make use of matrix representations of completely positive maps in order to study open quantum dynamics on graphs, with emphasis on quantum walks and the associated trajectories obtained via aExpand
Hitting statistics from quantum jumps
We define the hitting time for a model of continuous-time open quantum walks in terms of quantum jumps. Our starting point is a master equation in Lindblad form, which can be taken as the quantumExpand
On The Generators of Quantum Dynamical Semigroups
In recent years, digraph induced generators of quantum dynamical semigroups have been introduced and studied, particularly in the context of unique relaxation and invariance. We define the class ofExpand
GKSL generators and digraphs: computing invariant states
In recent years, digraph induced generators of quantum dynamical semigroups have been introduced and studied, particularly in the context of unique relaxation and invariance. In this article weExpand
O ct 2 01 8 GKSL GENERATORS AND DIGRAPHS : COMPUTING INVARIANT STATES
In recent years, digraph induced generators of quantum dynamical semigroups have been introduced and studied, particularly in the context of unique relaxation and invariance. In this article weExpand
Limit properties of global interaction stochastic quantum walks on directed graphs
TLDR
It is proved that in the cases of strongly connected and a class of weakly connected directed graphs, local environment interaction evolution is relaxing, and in the case of undirected graphs, global environment interaction development is convergent. Expand
Open quantum walks
Open quantum walks (OQWs) are a class of quantum walks, which are purely driven by the interaction with the dissipative environment. In this paper, we review theoretical advances on the foundationsExpand
Quantum Stochastic Walk models for quantum state discrimination
Abstract Quantum Stochastic Walks (QSW) allow for a generalization of both quantum and classical random walks by describing the dynamic evolution of an open quantum system on a network, with nodesExpand
Physical realization of topological quantum walks on IBM-Q and beyond
We discuss an efficient physical realization of topological quantum walks on a finite lattice. The $N$-point lattice is realized with $\log_2 N$ qubits, and the quantum circuit utilizes a number ofExpand
...
1
2
...

References

SHOWING 1-10 OF 17 REFERENCES
Microscopic derivation of open quantum walks
Open Quantum Walks (OQWs) are exclusively driven by dissipation and are formulated as completely positive trace preserving (CPTP) maps on underlying graphs. The microscopic derivation of discrete andExpand
Continuous Time Open Quantum Random Walks and Non-Markovian Lindblad Master Equations
A new type of quantum random walks, called Open Quantum Random Walks, has been developed and studied in Attal et al. (Open quantum random walks, preprint) and (Central limit theorems for open quantumExpand
Continuous-time quantum walks: Models for coherent transport on complex networks
Abstract This paper reviews recent advances in continuous-time quantum walks (CTQW) and their application to transport in various systems. The introduction gives a brief survey of the historicalExpand
Open Quantum Random Walks
A new model of quantum random walks is introduced, on lattices as well as on finite graphs. These quantum random walks take into account the behavior of open quantum systems. They are the exactExpand
Quantum walks: a comprehensive review
TLDR
This paper has reviewed several algorithms based on both discrete- and continuous-time quantum walks as well as a most important result: the computational universality of both continuous- and discrete- time quantum walks. Expand
Open Quantum Walks on Graphs
Open quantum walks (OQW) are formulated as quantum Markov chains on graphs. It is shown that OQWs are a very useful tool for the formulation of dissipative quantum computing algorithms and forExpand
Decoherence in quantum walks – a review
  • V. Kendon
  • Computer Science, Physics
  • Mathematical Structures in Computer Science
  • 2007
TLDR
This paper reviews the work on decoherence, and more generally on non-unitary evolution, in quantum walks and suggests what future questions might prove interesting to pursue in this area. Expand
Quantum Stochastic Walks: A Generalization of Classical Random Walks and Quantum Walks
We introduce the quantum stochastic walk (QSW), which determines the evolution of a generalized quantum-mechanical walk on a graph that obeys a quantum stochastic equation of motion. Using anExpand
On the generators of quantum dynamical semigroups
The notion of a quantum dynamical semigroup is defined using the concept of a completely positive map. An explicit form of a bounded generator of such a semigroup onB(ℋ) is derived. This is a quantumExpand
Quantum computation and decision trees
Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if theExpand
...
1
2
...