Dissipative decoherence in the Grover algorithm

Abstract

Using the methods of quantum trajectories we study effects of dissipative decoherence on the accuracy of the Grover quantum search algorithm. The dependence on the number of qubits and dissipation rate are determined and tested numerically with up to 16 qubits. As a result, our numerical and analytical studies give the universal law for decay of fidelity and probability of searched state which are induced by dissipative decoherence effects. This law is in agreement with the results obtained previously for quantum chaos algorithms.

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

References in corpus (20)

• Quantum Mechanics helps in searching for a needle in a haystack
• A simple model of quantum trajectories
• Quantum Chaos Border for Quantum Computing
• Emergence of Quantum Chaos in Quantum Computer Core and How to Manage It
• Efficient Quantum Computing of Complex Dynamics
• Quantum state diffusion, localization and computation
• Factoring in a Dissipative Quantum Computer
• Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
• Quantum computation with phase drift errors
• Quantum error correction of coherent errors by randomization
• Controlling quantum systems by embedded dynamical decoupling schemes
• Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat
• Effects of noise on quantum error correction algorithms
• Simulating noisy quantum protocols with quantum trajectories
• A quantitative model for the effective decoherence of a quantum computer with imperfect unitary operations
• Dynamical Imperfections in quantum computers
• Quantum chaos algorithms and dissipative decoherence with quantum trajectories
• Error Avoiding Quantum Codes and Dynamical Stabilization of Grover's Algorithm
• Phase diagram for the Grover algorithm with static imperfections
• Strange attractor simulated on a quantum computer

Cited by in corpus (8)

• Noise effect on Grover algorithm
• Synchnonization, zero-resistance states and rotating Wigner crystal
• Noise effects in the quantum search algorithm from the computational complexity point of view
• Complementarity between Success Probability and Coherence in Grover Search Algorithm
• Effects of imperfections for Shor's factorization algorithm
• Robust quantum searching with spontaneously decaying qubits
• Simulation of static and random errors on Grover's search algorithm implemented in a Ising nuclear spin chain quantum computer with few qubits
• Performance of Grover's search algorithm with diagonalizable collective noises