An improved algorithm for computing hitting probabilities of quantum walks

DOI10.1016/J.PHYSA.2022.127009OpenAlexW4210570243MaRDI QIDQ2116548FDOQ2116548

Authors: Yanbing Zhang, Ting-Ting Song, Zhihao Wu 

Publication date: 17 March 2022

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2022.127009

zbMATH Keywords

random walksquantum computationquantum walks

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX)

Cites Work

• Quantum cryptography based on Bell’s theorem
• Exponential algorithmic speedup by a quantum walk
• Quantum cryptography: public key distribution and coin tossing
• Quantum walks: a comprehensive review
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• One-dimensional quantum walks with absorbing boundaries
• The structures of state space concerning quantum dynamical semigroups
• Reachability Probabilities of Quantum Markov Chains
• A new \(n\)-party quantum secret sharing model based on multiparty entangled states
• Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision
• Decomposition of quantum Markov chains and its applications
• Semi-quantum private comparison protocol of size relation with \(d\)-dimensional Bell states
• Quantum particle swarm optimization algorithm with the truncated mean stabilization strategy
• Novel quantum image compression and encryption algorithm based on DQWT and 3D hyper-chaotic Hénon map
• An improved quantum algorithm for support matrix machines

Cited In (1)

• Optimizing the walk coin in the quantum random walk search algorithm

This page was built for publication: An improved algorithm for computing hitting probabilities of quantum walks

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