Mean hitting times of quantum Markov chains in terms of generalized inverses

DOI10.1007/S11128-019-2370-YMaRDI QIDQ2106035OpenAlexWikidataFDO

Authors Carlos F. Lardizabal

Publication date 8 December 2022

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.01313

zbMATH Keywords

Markov chainsquantum channelscompletely positive mapquantum random walks

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Mean hitting time formula for positive maps
• Quantum Markov chains
• QUANTUM HITTING TIME ON THE COMPLETE GRAPH
• Quantum Markov chains associated with Open Quantum random walks
• Quantum Markov fields on graphs

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 3648910 (Why is no real title available?)
• scientific article; zbMATH DE number 4145061 (Why is no real title available?)
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 1302910 (Why is no real title available?)
• scientific article; zbMATH DE number 1161555 (Why is no real title available?)
• scientific article; zbMATH DE number 1866308 (Why is no real title available?)
• A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks
• A new type of limit theorems for the one-dimensional quantum random walk
• A pathwise ergodic theorem for quantum trajectories
• Approximate quantum Markov chains
• Central limit theorem for reducible and irreducible open quantum walks
• Central limit theorems for open quantum random walks and quantum measurement records
• Discrete quantum walks hit exponentially faster
• Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
• Generalized inverses and their application to applied probability problems
• Generalized inverses: theory and computations
• Homogeneous open quantum random walks on a lattice
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• On a class of quantum channels, open random walks and recurrence
• One-dimensional quantum walks
• Open quantum random walks
• Open quantum random walks, quantum Markov chains and recurrence
• Open quantum random walks: ergodicity, hitting times, gambler's ruin and potential theory
• Open quantum random walks: reducibility, period, ergodic properties
• Parametric quantum search algorithm by CP maps: algebraic, geometric and complexity aspects
• Passage times, exit times and Dirichlet problems for open quantum walks
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum Markov chains
• Quantum optical implementation of open quantum walks
• Quantum recurrence of a subspace and operator-valued Schur functions
• Quantum walks and search algorithms
• Quantum walks: a comprehensive review
• Recurrence for discrete time unitary evolutions
• Site recurrence of open and unitary quantum walks on the line
• Stopping times for quantum Markov chains
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains

Cited in

(5)

• Mean hitting times of quantum Markov chains in terms of generalized inverses
• On stopping rules for tree-indexed quantum Markov chains
• Mean hitting time formula for positive maps
• A new definition of hitting time and an embedded Markov chain in continuous-time quantum walks
• Hitting time expressions for quantum channels: beyond the irreducible case and applications to unitary walks

This page was built for publication: Mean hitting times of quantum Markov chains in terms of generalized inverses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106035)