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.

arXiv comment15 pages, 10 figures

References in corpus (80)

• Quantum Computing in the NISQ era and beyond
• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• Cavity quantum electrodynamics for superconducting electrical circuits: an architecture for quantum computation
• Probing many-body dynamics on a 51-atom quantum simulator
• Quantum Communication Through an Unmodulated Spin Chain
• Experimental One-Way Quantum Computing
• Multiple Particle Interference and Quantum Error Correction
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• A Quantum Random Walk Search Algorithm
• Observation of a Many-Body Dynamical Phase Transition with a 53-Qubit Quantum Simulator
• Dynamical decoupling and noise spectroscopy with a superconducting flux qubit
• Grover's quantum searching algorithm is optimal
• 1/f noise: implications for solid-state quantum information
• Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
• A 10-qubit solid-state spin register with quantum memory up to one minute
• Grover Algorithm with zero theoretical failure rate
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• A Single-Atom Quantum Memory
• Sudden Death of Entanglement: Classical Noise Effects
• Quantum channels and memory effects
• Characterization of addressability by simultaneous randomized benchmarking
• Open-System Dynamics of Entanglement
• Entanglement enhanced information transmission over a quantum channel with correlated noise
• Characterizing large-scale quantum computers via cycle benchmarking
• Fault-tolerant quantum computation with long-range correlated noise
• Quantum Channels with Memory
• Complete 3-Qubit Grover Search on a Programmable Quantum Computer
• Efficient learning of quantum noise
• Detecting crosstalk errors in quantum information processors
• 1/f Flux Noise in Josephson Phase Qubits
• Completely positive maps with memory
• Non-Markovian dynamics of a qubit
• Implementation of Grover's Quantum Search Algorithm in a Scalable System
• Implementation of quantum search algorithm using classical Fourier optics
• Grover's search algorithm: An optical approach
• Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
• Unital Quantum Channels - Convex Structure and Revivals of Birkhoff's Theorem
• Direct randomized benchmarking for multi-qubit devices
• Implementation of a three-quantum-bit search algorithm
• Dynamical description of quantum computing: generic nonlocality of quantum noise
• 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
• Quantum channels with a finite memory
• Non-Markovianity of colored noisy channels
• Non-Markovian evolution: a quantum walk perspective
• Quantum Error Correction in Spatially Correlated Quantum Noise
• Probing context-dependent errors in quantum processors
• Arbitrary phase rotation of the marked state can not be used for Grover's quantum search algorithm
• Time-evolution of tripartite quantum discord and entanglement under local and non-local random telegraph noise
• Mixing properties of stochastic quantum Hamiltonians
• The effect of unitary noise on Grover's quantum search algorithm
• Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
• Quantum Stabilizer Codes for Correlated and Asymmetric Depolarizing Errors
• Dynamical Memory Effects in Correlated Quantum Channels
• Quantum circuit implementation of the Hamiltonian versions of Grover's algorithm
• Experimental realization of a continuous version of the Grover algorithm
• Noise effect on Grover algorithm
• Entanglement-enhanced classical capacity of two-qubit quantum channels with memory: the exact solution
• Decoherence and Programmable Quantum Computation
• Noise in Grover's Quantum Search Algorithm
• Decoherence of two entangled spin qubits coupled to an interacting sparse nuclear spin bath: application to nitrogen vacancy centers
• High-fidelity spatial and polarization addressing of Ca-43 qubits using near-field microwave control
• Decoherence on Grover's quantum algorithm: perturbative approach
• Noise effects in the quantum search algorithm from the computational complexity point of view
• Error tolerance in an NMR Implementation of Grover's Fixed-Point Quantum Search Algorithm
• Hamiltonian Formulation of Quantum Error Correction and Correlated Noise: The Effects Of Syndrome Extraction in the Long Time Limit
• The dynamics of two entangled qubits exposed to classical noise: role of spatial and temporal noise correlations
• Grover search under localized dephasing
• Impact of correlations and heavy-tails on quantum error correction
• Noise gates for decoherent quantum circuits
• Grover's search with local and total depolarizing channel errors
• Effective qubit dephasing induced by spectator-qubit relaxation
• SchWARMA: A model-based approach for time-correlated noise in quantum circuits
• Fault-ignorant Quantum Search
• The phase/state duality in reversible circuit design
• Exact decoherence dynamics of $1/f$ noise
• Experimental implementation of generalized Grover's algorithm of multiple marked states and its application
• Preparation of GHZ states via Grover's quantum searching algorithm

Cited by in corpus (1)

• Optimization of probabilistic quantum search algorithm with a priori information