Invariance of success probability in Grover's quantum search under local noise with memory

Abstract

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 the 'good noises,' for which the success probability of the algorithm at any given time remains unchanged with varying the non-trivial 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 ${\sigma }_x$ and ${\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 ${\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 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.

15 pages, 10 figures

References in corpus (23)

• Probing many-body dynamics on a 51-atom quantum simulator
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• Dynamical decoupling and noise spectroscopy with a superconducting flux qubit
• A Single-Atom Quantum Memory
• Sudden Death of Entanglement: Classical Noise Effects
• Characterization of addressability by simultaneous randomized benchmarking
• Detecting crosstalk errors in quantum information processors
• 1/f Flux Noise in Josephson Phase Qubits
• Quantum crosstalk analysis for simultaneous gate operations on superconducting qubits
• Entangled states maximize the two qubit channel capacity for some Pauli channels with memory
• Two-qubit spectroscopy of spatiotemporally correlated quantum noise in superconducting qubits
• Time-evolution of tripartite quantum discord and entanglement under local and non-local random telegraph noise
• Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
• Dynamical Memory Effects in Correlated Quantum Channels
• Noise effect on Grover algorithm
• Hamiltonian Formulation of Quantum Error Correction and Correlated Noise: The Effects Of Syndrome Extraction in the Long Time Limit
• Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm
• Impact of correlations and heavy-tails on quantum error correction
• Noise gates for decoherent quantum circuits
• Effective qubit dephasing induced by spectator-qubit relaxation
• SchWARMA: A model-based approach for time-correlated noise in quantum circuits
• The phase/state duality in reversible circuit design
• Exact decoherence dynamics of $1/f$ noise

Cited by in corpus (1)

• Optimization of probabilistic quantum search algorithm with a priori information