Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0403138 · The European Physical Journal D

Phase diagram for the Grover algorithm with static imperfections

A. A. Pomeransky, O. V. Zhirov, Dima L. Shepelyansky

Published Aug 30, 2004• 13 citations
arXivHTMLPDF
DOI
10.1140/epjd/e2004-00113-4

Related papers

Computational leakage: Grover's algorithm with imperfections

Pil Hun Song, Ilki Kim

arXiv:quant-ph/0010075•The European Physical Journal D•May 1, 2003•17 citations

Quantum phase estimation algorithm in presence of static imperfections

I. García-Mata, Dima L. Shepelyansky

arXiv:0711.1756•The European Physical Journal D•Mar 11, 2008•5 citations

Phase Condition for the Grover Algorithm

D.-F. Li, Xiumei Li, Hongtao Huang

arXiv:quant-ph/0107010•Theoretical and Mathematical Physics•Sep 1, 2005•9 citations

Phase matching in Grover's algorithm

Panchi Li, Shiyong Li

Physics Letters A•Feb 14, 2007•35 citations

Comparison of efficiency of Grover algorithm and AS algorithm when phase-error is cosidered

Hiroshi Nishikawa, Satoshi Iriyama, Masanori Ohya

IEICE Technical Report; IEICE Tech. Rep.•Jul 14, 2005•0 citations

Effects of decoherence and imperfections for quantum algorithms

A. A. Pomeransky, O. V. Zhirov, Dima L. Shepelyansky

We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static 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 $ε> 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.

arXiv:quant-ph/0407264•Jul 30, 2004•4 citations
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength εεε. The critical border εcε_cεc​ between two phases drops polynomially with the number of qubits nqn_qnq​ as εc∼nq−3/2ε_c \sim n_q^{-3/2}εc​∼nq−3/2​. In the regular phase (ε<εc)(ε< ε_c)(ε<εc​) the algorithm remains robust against imperfections showing the efficiency gain εc/εε_c / εεc​/ε for ε>2−nq/2ε> 2^{-n_q/2}ε>2−nq​/2. In the chaotic phase (ε>εc)(ε> ε_c)(ε>εc​) the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.