Take the 2-minute tour ×
Physics Stack Exchange is a question and answer site for active researchers, academics and students of physics. It's 100% free, no registration required.

As part of an assignment I am supposed to design a variant of Grover's algorithm that finds all $t$ marked elements. I guess like most people I'm more familiar with classic computation, so the solution that I came up with is simply to repeat the following procedure $t$ times, similar to the solution here:

  1. Use Grover's algorithm to find any marked element $x$.
  2. Delete $x$ from the data base.

My problem is that I am unsure to how the deletion operation can be realized the easiest. Can anyone recommend a 'standard way' of doing this (assuming there is one)?


share|improve this question
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.