On the probability of finding marked connected components using quantum walks

DOI10.1134/S1995080218070144zbMath1483.68138arXiv1710.04046OpenAlexW2963190776MaRDI QIDQ1992115

Yanyan Li

Publication date: 2 November 2018

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

stationary statesquantum computingquantum walksexceptional configurations

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

Impact of the malicious input data modification on the efficiency of quantum spatial search ⋮ Upperbounds on the probability of finding marked connected components using quantum walks

Cites Work

• Quantum walks can find a marked element on any graph
• Exceptional quantum walk search on the cycle
• On the hitting times of quantum versus random walks
• Adjacent Vertices Can Be Hard to Find by Quantum Walks
• Doubling the success of quantum walk search using internal-state measurements
• Quantum Walks with Multiple or Moving Marked Locations
• Unnamed Item
• Unnamed Item

This page was built for publication: On the probability of finding marked connected components using quantum walks