Phase diagram for the Grover algorithm with static imperfections
| dc.creator | Pomeransky, A. A. | |
| dc.creator | Zhirov, O. V. | |
| dc.creator | Shepelyansky, D. L. | |
| dc.date | 2004-03-19 | |
| dc.date.accessioned | 2026-07-07T06:09:20Z | |
| dc.date.available | 2026-07-07T06:09:20Z | |
| dc.description | We study effects of static inter-qubit interactions on the stability of the Grover quantum search algorithm. Our numerical and analytical results show existence of regular and chaotic phases depending on the imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $ε_c / ε$ for $ε\gtrsim 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed. | |
| dc.description | 4 pages, 4 figs, research at http://www.quantware.ups-tlse.fr | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0403138 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0403138 | |
| dc.identifier | Eur. Phys. J. D 31, 131-135 (2004) | |
| dc.identifier | doi:10.1140/epjd/e2004-00113-4 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/91923 | |
| dc.subject | Quantum Physics | |
| dc.title | Phase diagram for the Grover algorithm with static imperfections | |
| dc.type | text |