Grover’s search algorithm and similar techniques are widely used in quantum information science. Communication lines with the so-called oracle are one of inevitable vulnerabilities of quantum search. The impact of localized dephasing and amplitude damping on Grover’s algorithm had already been discussed in recent literature. In this paper, we study the influence of depolarization in the oracle-box wires on the search process. It is shown that even low level of noise is sufficient to degenerate Grover’s algorithm. Complementarity relations between the relative entropy of coherence and the success probability in the presence of depolarization are studied as well.
Grover’s search algorithm and similar techniques are widely used in quantum information science. Communication lines with the so-called oracle are one of inevitable vulnerabilities of quantum search. The impact of localized dephasing and amplitude damping on Grover’s algorithm had already been discussed in recent literature. In this paper, we study the influence of depolarization in the oracle-box wires on the search process. It is shown that even low level of noise is sufficient to degenerate Grover’s algorithm. Complementarity relations between the relative entropy of coherence and the success probability in the presence of depolarization are studied as well.
We address the case in which querying the oracle in Grover’s algorithm is exposed to noise including phase distortions. The oracle-box wires can be altered by an opposing party that tries to prevent reception of correct data from the oracle. This situation reflects an experienced truth that any access to prophetic knowledge cannot be common and direct. To study this problem, we introduce a simple model of collective phase distortions on the basis of a phase-damping channel. In the model, the probability of success is not altered via the oracle-box wires per se . Phase distortions of the considered type can hardly be detected via any one-time query to the oracle. However, the probability of success is significantly changed when such errors are introduced as an intermediate step in the Grover iteration. We investigate the probability of success with respect to variations of the parameter that characterizes the amount of phase errors. It turns out that the probability of success decreases significantly even if the error is not very high. Moreover, this probability quickly reduces to the value of one half, which corresponds to the completely mixed state. We also study trade-off relations between quantum coherence and the probability of success in the presence of noise of the considered type.
Grover's algorithm searches an unstructured database with a number of oracle queries that grows only as the square root of its size. Noise erodes this advantage, and we ask, analytically, how quickly. When a depolarizing channel acts on the whole register after every gate layer, it commutes with the gates, and the noisy state is the noiseless one with a coherent weight that decays geometrically with depth. The Grover rotation is not slowed. Its weight decays, the best stopping point moves earlier, and the expected query cost keeps its square-root scaling only while the accumulated noise over the circuit stays small. For independent errors on the qubits we show that the ideal Grover operator freezes any amplitude pushed out of the two-dimensional search plane. This gives the exact effect of a single error: phase flips do most damage early in the search, bit flips late, and combined errors at any time. For large databases it also reduces the noisy search to Bloch-type equations for the part of the state that stays in the plane, in which the algorithm is a rotation and the noise appears as leakage and dephasing. We derive the rates for bit-flip, phase-flip, depolarizing, and amplitude-damping noise and solve the equations. Local noise acts, to leading order, like a global channel strengthened by the number of qubits, so the tolerable error per qubit falls faster than the inverse square root of the database size by one power of the register size. For coherent errors in the rotation angle we bound the success probability by a band that widens linearly with depth. Our results recover, in closed form, scalings found earlier for particular noise models, and they explain why some errors are more harmful than others.
Abstract In quantum computing, Grover's technique is extremely vulnerable to several kinds of quantum noise in practice, which can seriously impair its functionality. This study examines how the algorithm's success probabilities is affected by several types of noise, such as rotational error, thermal noise, Two-State Purity (TSP) error, decay and decoherence, and depolarization variables. The findings demonstrate that the algorithm can accomplish flawless amplification of the goal state with negligible mistakes in non-target states when it is executed without noise. The most notable decrease among the noise kinds is caused by decay and decoherence errors and depolarization factors, which lower the likelihood of correctly detecting the target state from 1.0 to roughly 0.885 and 0.968, respectively. Thermal noise, TSP error, and rotational error, on the other hand, have less severe impacts and result in lesser deviations in both target and non-target states. These results demonstrate how crucial quantum error correction and noise reduction techniques are to guaranteeing Grover's algorithm's scalability and dependability in noisy quantum environments. To fully utilize the algorithm's promise in practical applications on both present-day and next quantum technology, these issues must be mitigated.
Abstract When quantum computing becomes a wide-spread commercial reality, Quantum Search Algorithms (QSA) and especially Grover’s QSA will inevitably be one of their main applications, constituting their cornerstone. Most of the literature assumes that the quantum circuits are free from decoherence. Practically, decoherence will remain unavoidable as is the Gaussian noise of classic circuits imposed by the Brownian motion of electrons, hence it may have to be mitigated. In this contribution, we investigate the effect of quantum noise on the performance of QSAs, in terms of their success probability as a function of the database size to be searched, when decoherence is modelled by depolarizing channels’ deleterious effects imposed on the quantum gates. Moreover, we employ quantum error correction codes for limiting the effects of quantum noise and for correcting quantum flips. More specifically, we demonstrate that, when we search for a single solution in a database having 4096 entries using Grover’s QSA at an aggressive depolarizing probability of 10−3, the success probability of the search is 0.22 when no quantum coding is used, which is improved to 0.96 when Steane’s quantum error correction code is employed. Finally, apart from Steane’s code, the employment of Quantum Bose-Chaudhuri-Hocquenghem (QBCH) codes is also considered.
We consider quantum search algorithms that have access to a noisy oracle that, for every oracle call, with probability p>0 completely depolarizes the query registers, while otherwise working properly. Previous results had not ruled out quantum O(n)-query algorithms in this setting, even for constant p. We show that, for all p≤0.99, the quantum noisy-query complexity of the unstructured search is Θ~(max{np,n}). The lower bound Ω(max{np,n}) holds also for the dephasing noise and even when, for every oracle call, the algorithm is provided with a flag indicating whether the error has occurred.
Abstract Grover’s quantum search algorithm promises a quadratic speedup for unstructured search over its classical counterpart. But this advantage is affected by noise acting on the search space. Here, we show that a quantum switch can act as a resource to mitigate the effects of noise. In this scenario, the noise is modeled by a depolarizing channel, which coherently acts on the entire quantum register. We show that a quantum switch can significantly reduce the error in Grover’s search algorithm. We consider the success probability of finding the marked item as the sole quantifier of diminishing the effect of noise in the search space in the presence of quantum switch. We propose two frameworks for the application of quantum switches. In the first framework, we apply the superposition of channel’s orders in the form of a switch and do a post-selection at every iteration of the applications of the Grover operator. In the second framework, we delay this measurement and post-selection until the very end. The number of post selections is minimal in the second scenario, and hence the noise reduction can be attributed more to the presence of quantum switch. We illustrate with an example of significant advantage in the success probability of Grover’s algorithm using quantum switch.