Phase diagram for the Grover algorithm with static imperfections

Abstract

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 $\epsilon$. The critical border ${\epsilon }_c$ between two phases drops polynomially with the number of qubits $n_q$ as ${\epsilon }_c\sim n_q^{-3/2}$. In the regular phase $(\epsilon <{\epsilon }_c)$ the algorithm remains robust against imperfections showing the efficiency gain ${\epsilon }_c/\epsilon$ for $\epsilon \gtrsim 2^{-n_q/2}$. In the chaotic phase $(\epsilon >{\epsilon }_c)$ the algorithm is completely destroyed.

4 pages, 4 figs, research at http://www.quantware.ups-tlse.fr

References in corpus (15)

• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• Quantum Chaos Border for Quantum Computing
• Quantum computers in phase space
• Emergence of Quantum Chaos in Quantum Computer Core and How to Manage It
• Efficient Quantum Computing of Complex Dynamics
• Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
• Quantum computation with phase drift errors
• Emergence of Fermi-Dirac Thermalization in the Quantum Computer Core
• Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat
• Delocalization border and onset of chaos in a model of quantum computation
• Imperfection effects for multiple applications of the quantum wavelet transform
• Quantum computation of the Anderson transition in presence of imperfections
• Quantum Chaos and Quantum Algorithms
• A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations

Cited by in corpus (5)

• Noise effect on Grover algorithm
• Dissipative decoherence in the Grover algorithm
• Quantum chaos algorithms and dissipative decoherence with quantum trajectories
• Effects of imperfections for Shor's factorization algorithm
• Noise resilience and entanglement evolution in two non-equivalent classes of quantum algorithms