Impact of the malicious input data modification on the efficiency of quantum spatial search
arXiv:1802.10041 · doi:10.1007/s11128-019-2459-3
Abstract
In this paper we demonstrate that the efficiency of quantum algorithms can be significantly altered by malicious manipulation of the input data. We exemplify the possibility of attacks on quantum spatial search based on Szegedy walk. We achieve this by proposing a framework suitable for analysing efficiency of attacks on quantum search algorithms. We provide the analysis of proposed attacks for different models of random graphs.
References in corpus (12)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Hacking commercial quantum cryptography systems by tailored bright illumination
- Quantum Computational Supremacy
- Spatial search by quantum walk
- Universal blind quantum computation
- Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
- Spatial search by quantum walk is optimal for almost all graphs
- Optimal quantum spatial search on random temporal networks
- Equivalence of Szegedy's and Coined Quantum Walks
- Stationary States in Quantum Walk Search
- Vertices cannot be hidden from quantum spatial search for almost all random graphs