Quantum search degeneration under amplitude noise in queries to the oracle
arXiv:2111.14333 · doi:10.1007/s11128-022-03501-0
Abstract
We examine how amplitude noise in queries to the oracle degrades a performance of quantum search algorithm. The Grover search and similar techniques are widely used in various quantum algorithms, including cases where rival parties are fighting over confidential data. Hence, the oracle-box wires become the subject of competing activity with an alteration of their normal functioning. Of course, many kinds of errors could arise in this way. Possible influence of dephasing on quantum search was already addressed in the literature. Amplitude damping is another type of errors that should be analyzed first. To study the problem, we introduce a simple model of collective distortions with the use of amplitude damping channel. All the quantities of interest should be considered as functions of the number of Grover's iterations. In particular, we investigate the success probability with respect to the parameter that characterizes the level of amplitude errors. The success probability degrades significantly even if the error amount is not essential. Namely, this probability soon enough reduces to a value close to one half. We also study trade-off relations between quantum coherence and the success probability in the presence of amplitude noise.
arXiv comment11 pages, two figures. Except for the style, v3 matches the journal version. arXiv admin note: text overlap with arXiv:1708.09060
References in corpus (41)
- Quantum Computing in the NISQ era and beyond
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantifying Coherence
- Quantum Coherence as a Resource
- Strengths and Weaknesses of Quantum Computing
- Trapped-Ion Quantum Computing: Progress and Challenges
- The Role of Relative Entropy in Quantum Information Theory
- Quantum information processing with superconducting circuits: a review
- On the role of entanglement in quantum computational speed-up
- Photonic quantum information processing: a review
- Grover's quantum searching algorithm is optimal
- Quantum computers can search rapidly by using almost any transformation
- Quantum computing with neutral atoms
- Quantum computers can search arbitrarily large databases by a single query
- Measures and applications of quantum correlations
- Quantum algorithms for algebraic problems
- Trace-distance measure of coherence
- Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation
- The Fidelity and Trace Norm Distances for Quantifying Coherence
- Duality of Quantum Coherence and Path Distinguishability
- Relations between coherence and path information
- Quantum-coherence quantifiers based on the Tsallis relative -entropies
- Coherence depletion in the Grover quantum search algorithm
- Complementarity relations for quantum coherence
- Maximal Coherence and the Resource Theory of Purity
- Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
- Relative quantum coherence, incompatibility, and quantum correlations of states
- Quantum uncertainty relation using coherence
- A Family of Grover's Quantum Searching Algorithms
- Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
- Uncertainty Relations for Quantum Coherence
- Quantum coherence as a signature of chaos
- Quantum coherence quantifiers based on the Rényi -relative entropy
- Uncertainty relations for quantum coherence with respect to mutually unbiased bases
- Coherence and Entanglement Monogamy in the Discrete Analogue of Analog Grover Search
- On the role of dealing with quantum coherence in amplitude amplification
- Grover search under localized dephasing
- Modified Grover operator for amplitude estimation
- Wave-particle duality relations based on entropic bounds for which-way information
- Multipath wave-particle duality with a path detector in a quantum superposition