Few Quantum Algorithms on Amplitude Distribution

  title={Few Quantum Algorithms on Amplitude Distribution},
  author={Debajyoti Bera and Sapv Tharrmashastha},
Amplitude filtering is concerned with identifying basis-states in a superposition whose amplitudes are greater than a specified threshold; probability filtering is defined analogously for probabilities. Given the scarcity of qubits, the focus of this work is to design log-space algorithms for them. Both algorithms follow a similar pattern of estimating the amplitude (or, probability for the latter problem) of each state, in superposition, then comparing each estimate against the threshold for… 

Tables from this paper



Quantum Search on Bounded-Error Inputs

It is shown that quantum amplitude amplification can be made to work also with a bounded-error verifier, and optimal quantum upper bounds of O(√N) queries for all constant-depth AND-OR trees on N variables are obtained.

Quantum Probability Oracles & Multidimensional Amplitude Estimation

It is shown that all coordinates of p can be estimated up to error ε per coordinate using Õ ( 1 ε ) applications of Up and its inverse, which generalizes the normal amplitude estimation algorithm, which solves the problem for n = 2.

Quantum Subroutine Composition

The same technique that allows us to compose quantum subroutines in quantum walks can also be used to compose in any quantum algorithm, which is proved using the technique of multidimensional quantum walks.

Quantum and Randomised Algorithms for Non-linearity Estimation

This work designs highly efficient quantum and randomised algorithms to approximate the non-linearity allowing additive error, denoted λ, with query complexities that depend polynomially on λ and proves lower bounds to show that these are not very far from the optimal ones.

Quantum lower bounds by quantum arguments

Two new Ω(√N) lower bounds on computing AND of ORs and inverting a permutation and more uniform proofs for several known lower bounds which have been previously proven via a variety of different techniques are proved.

Quantum algorithm for linear systems of equations.

This work exhibits a quantum algorithm for estimating x(-->)(dagger) Mx(-->) whose runtime is a polynomial of log(N) and kappa, and proves that any classical algorithm for this problem generically requires exponentially more time than this quantum algorithm.

Quantum lower bounds for the collision and the element distinctness problems

  • Yaoyun Shi
  • Computer Science
    The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.
  • 2002
It is proved that any quantum algorithm for finding a collision in an r-to-one function must evaluate the function /spl Omega/ ((n/r)/sup 1/3/) times, where n is the size of the domain and r|n.

Quantum algorithms for element distinctness

We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp

Applications of Adversary Method in Quantum Query Algorithms

A recently developed tight characterisation of quantum query complexity, the adversary bound, is used to develop new quantum algorithms and lower bounds, and a generalisation ofquantum walks that connects electrical properties of a graph and its quantum hitting time is developed.

The quantum complexity of approximating the frequency moments

The quantum complexity of approximately computing the frequency moments in two settings is studied, and quantum algorithms which outperform the best possible classical algorithms up to quadratically are given.