https://doi.org/10.1140/epjd/e2004-00113-4
Phase diagram for the Grover algorithm with static imperfections
1
Laboratoire de Physique Théorique,
UMR 5152 du CNRS, Université P. Sabatier, 31062 Toulouse Cedex 4, France
2
Budker Institute of Nuclear Physics, 630090 Novosibirsk, Russia
Corresponding author: a dima@irsamc.ups-tlse.fr
Received:
3
May
2004
Revised:
1
July
2004
Published online:
31
August
2004
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 
between two phases drops polynomially
with the
number of qubits nq as 
.
In the regular phase 
the algorithm remains
robust against imperfections showing the efficiency gain 
for 
.
In the chaotic phase 
the algorithm
is completely destroyed.
PACS: 03.67.Lx – Quantum Computation / 24.10.Cn – Many-body theory / 73.43.Nq – Quantum phase transitions
© EDP Sciences, Società Italiana di Fisica, Springer-Verlag, 2004
