On Arbitrary Phases in Quantum Amplitude Amplification

Abstract

We consider the use of arbitrary phases in quantum amplitude amplification which is a generalization of quantum searching. We prove that the phase condition in amplitude amplification is given by $\tan (\phi /2)=\tan (\varphi /2)(1-2a)$, where $\varphi$ and $\varphi$ are the phases used and where $a$ is the success probability of the given algorithm. Thus the choice of phases depends nontrivially and nonlinearly on the success probability. Utilizing this condition, we give methods for constructing quantum algorithms that succeed with certainty and for implementing arbitrary rotations. We also conclude that phase errors of order up to $\frac{1}{\sqrt{a}}$ can be tolerated in amplitude amplification.

6 pages, 1 figure

References in corpus (1)

• Quantum Amplitude Amplification and Estimation

Cited by in corpus (66)

• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Grover Algorithm with zero theoretical failure rate
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
• Fixed-point quantum search with an optimal number of queries
• Implementation of quantum search algorithm using classical Fourier optics
• The methodology of resonant equiangular composite quantum gates
• Sliding mode control of quantum systems
• Duality and Recycling Computing in Quantum Computers
• Simulation of many-body interactions by conditional geometric phases
• Variationally Learning Grover's Quantum Search Algorithm
• Time-efficient implementation of quantum search with qudits
• Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State
• Coherence number as a discrete quantum resource
• Incoherent Control of Locally Controllable Quantum Systems
• Sure success partial search
• Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective
• Staggered Quantum Walks with Hamiltonians
• Quantum Searching via Entanglement and Partial Diffusion
• Exactness of the Original Grover Search Algorithm
• General framework for quantum search algorithms
• Multi-phase matching in the Grover algorithm
• Scalable quantum search using trapped ions
• Fetching marked items from an unsorted database in NMR ensemble computing
• A More General Quantum Searching Algorithm And the Precise Formula of the Amplitude and the Non-symmetric Effects of Different Rotating Angles
• Deterministic quantum search with adjustable parameters: implementations and applications
• Quantum algorithm to distinguish Boolean functions of different weights
• A General SU(2) Formulation for Quantum Searching with Certainty
• Quantum Amplitude Amplification Operators
• Strength and Weakness in Grover's Quantum Search Algorithm
• Quantum Locker Using a Novel Verification Algorithm and Its Experimental Realization in IBM Quantum Computer
• Fixed-point Quantum Search for Different Phase Shifts
• Exact Quantum Search by Parallel Unitary Discrimination Schemes
• A Query-based Quantum Eigensolver
• A family of sure-success quantum algorithms for solving a generalized Grover search problem
• The Precise Formula in a Sine Function Form of the norm of the Amplitude and the Necessary and Sufficient Phase Condition for Any Quantum Algorithm with Arbitrary Phase Rotations
• Multi-objective evolutionary algorithms for quantum circuit discovery
• Fixed Phase Quantum Search Algorithm
• Quantum computers can search rapidly by using almost any selective transformations
• Amplitude Amplification for Optimization via Subdivided Phase Oracle
• Optimal exact quantum algorithm for the promised element distinctness problem
• A Quantum Algorithm Framework for Discrete Probability Distributions with Applications to Rényi Entropy Estimation
• Optimization of probabilistic quantum search algorithm with a priori information
• Quantum Walk Search through Potential Barriers
• Structured quantum search in NP-complete problems using the cumulative density of states
• Test-State Approach to the Quantum Search Problem
• A framework for optimal quantum spatial search using alternating phase-walks
• Complementary-multiphase quantum search for all numbers of target items
• Quantifying Grover speed-ups beyond asymptotic analysis
• An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits
• A Bounded-error Quantum Polynomial Time Algorithm for Two Graph Bisection Problems
• Near-deterministic quantum search algorithm without phase design
• Query complexity for searching multiple marked states from an unsorted database
• Lower Bounds for Unitary Property Testing with Proofs and Advice
• Derandomization of quantum algorithm for triangle finding
• Amplitude Amplification and Estimation using a Floquet system
• Three-qubit exact Grover within the blind oracular quantum computation scheme
• Revisiting fixed-point quantum search: proof of the quasi-Chebyshev lemma
• Quantum algorithm for unstructured search of ranked targets
• Constant-Time Quantum Algorithm For The Unstructured Search Problem
• Performance of Grover's search algorithm with diagonalizable collective noises
• A Quantum Search Algorithm for a Specified Number of Targets
• Distributed Exact Generalized Grover's Algorithm
• Exact quantum search based on analytical multiphase matching for known number of target items and the experimental demonstration on IBM Q
• Gaussian Amplitude Amplification for Quantum Pathfinding
• Correcting for Potential Barriers in Quantum Walk Search