Linear Open Quantum Walks
- Linear open quantum walks are discrete-time quantum stochastic processes driven by CPTP dynamics and structured via Kraus operators.
- They exhibit rich recurrence, mixing, and fluctuation phenomena influenced by spectral properties and environmental dissipation.
- Applications span quantum state engineering, dissipative quantum computation, and decoherence control through tailored coin designs.
A linear open quantum walk (OQW) is a discrete-time quantum stochastic process in which a quantum walker with internal degrees of freedom propagates on a graph under the action of a completely positive trace-preserving (CPTP) map, with evolution entirely governed by environmental dissipation rather than unitary dynamics. The linear OQW framework is mathematically equivalent to a quantum Markov chain on the state space , where is the coin (internal) Hilbert space and the position Hilbert space associated to vertex set (or, for the integer line, ). The key ingredients are Kraus operators constructed by factoring site-to-site transitions into coin transformations and position shifts. This structure underlies rich recurrence, mixing, and fluctuation phenomena distinct from those seen in unitary quantum walks, with behavior strongly influenced by the spectral properties of underlying superoperators and environmental coupling.
1. CPTP Evolution and Kraus Formalism
Let be a finite-dimensional internal Hilbert space and a position space with basis . The state at discrete time is a density matrix , frequently of block-diagonal form:
Transitions correspond to the application of a CPTP map:
with Kraus operators
where each is the coin-jump operator associated with move . The normalization condition
ensures trace preservation, and the map is linear and completely positive by construction (Sinayskiy et al., 2014).
2. Site Recurrence Notions: Monitored and Pólya (SJK)
Site recurrence in OQWs is analyzed via two notions:
- Monitored recurrence: One tracks the first-return to a site by monitoring at each step. Define as the set of operator strings corresponding to first hitting at time , and for initial coin state :
The site is monitored-recurrent if for all internal densities.
- Pólya (SJK) recurrence: Let be the probability of occupying site at step starting from density at , and define the Pólya number:
Site is SJK-recurrent for if , which is equivalent to (Carvalho et al., 2016). This mirrors classical return criteria extended to CPTP dynamics.
3. Relation to Unitary Quantum Walks: Interference Effects and Monitored Recurrence
For walks induced by the same pair of matrices , one can analyze the correspondence between OQW and unitary coined quantum walks (UQWs). If is unitary, the UQW's monitored-return probability for pure initial state at site $0$ is:
where are appropriate return operators involving projections onto the monitored site. It is shown that
where is the OQW monitored-return probability, and is an additive "interference term" resulting from coherences between distinct return paths. If , monitored recurrence in the unitary walk implies monitored recurrence in the open walk, and vice versa, highlighting the role of environmental decoherence in modifying recurrence thresholds (Carvalho et al., 2016).
4. Open-Quantum Kac Lemma: Expected Return Times
An "open quantum" version of Kac's lemma relates expected first-return times to stationary probabilities. For an irreducible OQW with a unique stationary state , and internal density at site ,
where is the expected return time at for a monitored recurrent state. This generalizes classical Kac's lemma, adapting it to CPTP dynamics and block-diagonal stationary states (Carvalho et al., 2016).
5. Examples of Site Recurrence Criteria
Several explicit constructions illustrate recurrence and transience in linear OQWs:
- Hadamard OQW on (coin dimension ): Operators
$R=\frac{1}{\sqrt{2}}\begin{pmatrix}1&1\0&0\end{pmatrix},\quad L=\frac{1}{\sqrt{2}}\begin{pmatrix}0&0\1&-1\end{pmatrix}$
yield monitored-recurrence at the origin for all coin states, but the associated unitary coined walk is not monitored-recurrent due to destructive interference.
- Bit-flip OQW: With
the site is recurrent iff , corresponding to balanced coin parameters.
- Classical coin example (finite three-site chain): Explicit stationary distribution and Kac lemma formulae determine expected return times, with for site $0$ if transition probability from $1$ to $0$ (Carvalho et al., 2016).
6. Recurrence Criteria, Spectral Analysis, and Drift
From a spectral perspective, recurrence/transience in linear OQWs hinges on the drift induced by the underlying auxiliary coin map and the structure of invariant states. For a homogeneous OQW on :
- If the drift vanishes for the unique steady-state coin , the walk is recurrent.
- Nonzero drift yields transience, with ballistic escape and finite total return probabilities (Loebens, 2 Jan 2025).
The recurrence classification can be generalized via block decompositions in reducible coins, with site recurrence determined locally in each invariant sector.
7. Physical Implications and Generalizations
Site recurrence properties are closely tied to transport and localization in dissipative quantum systems, impacting topics from quantum state engineering to dissipative quantum computation (Sinayskiy et al., 2014, Attal et al., 2014). OQWs interpolate between classical random walks and unitary quantum walks, acting as an archetype for quantum stochastic processes with environmental noise. These recurrence phenomena can be tuned via coin design, topology, and dissipation rates, with applications to mixing speed, decoherence control, and quantum algorithm efficiency. The formalism connects deeply to renewal theory, operator-valued generating functions, and effective "thermodynamic" behavior under CPTP dynamics (Grünbaum et al., 2017).
References:
- (Sinayskiy et al., 2014) Open Quantum Walks: a short introduction
- (Carvalho et al., 2016) Site recurrence of open and unitary quantum walks on the line
- (Loebens, 2 Jan 2025) Recurrence Criteria for Reducible Homogeneous Open Quantum Walks on the Line
- (Grünbaum et al., 2017) A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks