Skip to content

Details

Our speaker will be Austin Gilliam, Researcher, Advanced Computing Team, JPMC.

The presentation is about a binomial version of Quantum Search that is similar to the classical binary search. In particular, we discuss the role of the initial superposition of the search space in the number of iterations needed to amplify the amplitude of certain outcomes. We show applications of the modified algorithm to optimization problems.

The paper, "Optimizing Quantum Search with a Binomial Version of Grover's Algorithm" can be found at https://arxiv.org/abs/2007.10894

Members are also interested in