Simulation of static and random errors on Grover's search algorithm implemented in a Ising nuclear spin chain quantum computer with few qubits
arXiv:0902.0471 · doi:10.1088/0953-4075/43/8/085508
Abstract
We consider Grover's search algorithm on a model quantum computer implemented on a chain of four or five nuclear spins with first and second neighbour Ising interactions. Noise is introduced into the system in terms of random fluctuations of the external fields. By averaging over many repetitions of the algorithm, the output state becomes effectively a mixed state. We study its overlap with the nominal output state of the algorithm, which is called fidelity. We find either an exponential or a Gaussian decay for the fidelity as a function of the strength of the noise, depending on the type of noise (static or random) and whether error supression is applied (the 2pi k-method) or not.
18 pages, 8 figures, extensive revision with new figures
References in corpus (13)
- Dynamics of Loschmidt echoes and fidelity decay
- Grover Algorithm with zero theoretical failure rate
- Decoherence, Entanglement and Irreversibility in Quantum Dynamical Systems with Few Degrees of Freedom
- A random matrix formulation of fidelity decay
- Quantum chaos and random matrix theoryfor fidelity decay in quantum computationswith static imperfections
- Noise effect on Grover algorithm
- Implementation of three-qubit Grover search in cavity QED
- Dissipative decoherence in the Grover algorithm
- Numerical simulation of a Controlled-Controlled-Not (CCN) quantum gate in a chain of three interacting nuclear spins system
- Simulation of Grover's quantum search algorithm in a Ising nuclear spin chain quantum computer with first and second nearest neighbour couplings
- Quantum computation in a Ising spin chain taking into account second neighbor couplings
- Quantum Dynamics Against a Noisy Background
- Method for implementation of universal quantum logic gates in a scalable Ising spin quantum computer