Quantum hitting time according to a given distribution

DOI10.1080/03081087.2024.2349197MaRDI QIDQ6939437zbMATH OpenFDO

Authors Paola Boito, Gianna M. Del Corso

Publication date 21 August 2025

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2024.2349197

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Random walks on graphs (05C81) Theory of computing (68Qxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Cites work

• An Edge Centrality Measure Based on the Kemeny Constant
• Centrality measure in graphs
• Directed forests and the constancy of Kemeny's constant
• Discrete quantum walks hit exponentially faster
• Effective graph resistance
• Hitting and commute times in large random neighborhood graphs
• Hitting times for second-order random walks
• scientific article; zbMATH DE number 5485493 (Why is no real title available?)
• scientific article; zbMATH DE number 878897 (Why is no real title available?)
• Kemeny's constant and the effective graph resistance
• Maximum hitting time for random walks on graphs
• Minimizing Effective Resistance of a Graph
• On the hitting times of quantum versus random walks
• On the hitting times of quantum versus random walks
• Quantum walk and its application domains: a systematic review
• Quantum walks and search algorithms
• Quantum walks can find a marked element on any graph
• Quantum walks: a comprehensive review
• Search via Quantum Walk
• Why is Kemeny's constant a constant?

This page was built for publication: Quantum hitting time according to a given distribution

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