Quantum computing of delocalization in small-world networks
量子物理
2016-09-08 v1 无序系统与神经网络
统计力学
适应与自组织系统
摘要
We study a quantum small-world network with disorder and show that the system exhibits a delocalization transition. A quantum algorithm is built up which simulates the evolution operator of the model in a polynomial number of gates for exponential number of vertices in the network. The total computational gain is shown to depend on the parameters of the network and a larger than quadratic speed-up can be reached. We also investigate the robustness of the algorithm in presence of imperfections.
引用
@article{arxiv.quant-ph/0503188,
title = {Quantum computing of delocalization in small-world networks},
author = {O. Giraud and B. Georgeot and D. L. Shepelyansky},
journal= {arXiv preprint arXiv:quant-ph/0503188},
year = {2016}
}
备注
4 pages, 5 figures, research done at http://www.quantware.ups-tlse.fr/