Year: 2005
Type: article
Abstract: 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 an 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 speedup can be reached. We also investigate the robustness of the algorithm in presence of imperfections.
Source: Physical Review E
Authors: O. Giraud, B. Georgeot, D. L. Shepelyansky
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1963840417
