We study the importance of interference for the performance of Shor's factoring algorithm and Grover's search algorithm using a recently proposed interference measure. To this aim we introduce systematic unitary errors, random unitary errors, and decoherence processes in these algorithms. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum computation decreases. For decoherence due to phase flip errors, interference is destroyed for small error probabilities, and converted into destructive interference for error probabilities approaching 1, leading to success probabilities which can even drop below the classical value. Our results show that in general, interference is necessary in order for a quantum algorithm to outperform classical computation, but large amounts of interference are not sufficient and can even lead to destructive interference with worse than classical success rates.
It is found that systematic errors in phase inversions and random errors in Hadmard-Walsh transformations are the dominant gate imperfection in Grover's quantum search algorithm. They lead to reductions in the maximum probability of the marked state and affect the efficiency of the algorithm. Given the degree of inaccuracy, we find that to guarantee a half-rate of success, the size of the database should be on the order of $O(1/{\ensuremath{\delta}}^{2}),$ where $\ensuremath{\delta}$ is the uncertainty.
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
nq as
εc∼nq−3/2. In the regular phase
(ε<εc) the algorithm remains robust against imperfections showing the efficiency gain
εc/ε for
ε>2−nq/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.
We analyze the robustness of Grover's quantum search algorithm performed by a quantum register under a possibly time-correlated noise acting locally on the qubits. We model the noise as originating from an arbitrary but fixed unitary evolution
U of some noisy qubits. The noise can occur with some probability in the interval between any pair of consecutive noiseless Grover evolutions. Although each run of the algorithm is a unitary process, the noise model leads to decoherence when all possible runs are considered. We derive a set of unitary
U's, called good noises, for which the success probability of the algorithm at any given time remains unchanged with varying nontrivial total number
m of noisy qubits in the register. The result holds irrespective of the presence of any time correlations in the noise. We show that only when
U is either of the Pauli matrices ${\ensuremath{\sigma}}_{x}$ and ${\ensuremath{\sigma}}_{z}$ (which give rise to
m-qubit bit-flip and phase-damping channels, respectively, in the time-correlation-less case), the algorithm's success probability stays unchanged when increasing or decreasing
m. In contrast, when
U is the Pauli matrix ${\ensuremath{\sigma}}_{y}$ (giving rise to
m-qubit bit-phase flip channel in the time-correlation-less case), the success probability at all times stays unaltered as long as the parity (even or odd) of the total number
m remains the same. This asymmetry between the Pauli operators stems from the inherent symmetry-breaking existing within the Grover circuit. We further show that the positions of the noisy sites are irrelevant in the case of any of the Pauli noises. The results are illustrated in the cases of time-correlated and time-correlation-less noise. We find that the former case leads to a better performance of the noisy algorithm. We also discuss physical scenarios where our chosen noise model is of relevance.
Ideal quantum algorithms usually assume that quantum computing is performed continuously by a sequence of unitary transformations. However, there always exist idle finite time intervals between consecutive operations in a realistic quantum computing process. During these delays, coherent errors will accumulate from the dynamical phases of the superposed wave functions. Here we explore the sensitivity of Shor's quantum factoring algorithm to such errors. Our results clearly show a severe sensitivity of Shor's factorization algorithm to the presence of delay times between successive unitary transformations. Specifically, in the presence of these coherent errors, the probability of obtaining the correct answer decreases exponentially with the number of qubits of the work register. A particularly simple phase-matching approach is proposed in this paper to avoid or suppress these coherent errors when using Shor's algorithm to factorize integers. The robustness of this phase-matching condition is evaluated analytically and numerically for the factorization of several integers: 4, 15, 21, and 33.