2016/05/17 by Avatar Tulsi, Tulsi, Avatar
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1605.05013
This is a preliminary draft. Comments are most welcome
arxiv created 2016/05/17 · openalex publication_date 2016/05/17 · arxiv updated 2016/05/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider quantum search on graphs. Recently, it has been shown that the graph properties like connectivity, global symmetry, or regularity cannot serve as a reliable criteria that must be satisfied by a graph to allow a successful quantum search. It is an open question whether it is possible to find such a criteria. We solve this question by giving an affirmative answer.