1. A method of performing a quantum search, comprising: performing a first iterative grover search process by causing a quantum computer to perform a first series of grover searches according to a characteristic function comprising a first grover iterate for varying numbers of iterations to identify a first search target; for each respective one of the first series of grover searches performing operations as follows: determining a first series number of iterations; performing the respective one of the first series of grover searches using the first grover iterate when the first series number of iterations does not exceed a first maximum total number of iterations; and terminating the respective one of the first series of grover searches when the first series number of iterations exceeds the first maximum total number of iterations; modifying the characteristic function according to the first search target so as to remove the first search target as a target subject from subsequent grover searches; and performing a second iterative grover search process by causing the quantum computer to perform a second series of grover searches according to the characteristic function that was modified and comprising a second grover iterate for varying numbers of iterations to identify a second search target; for each respective one of the second series of rover searches performing operations as follows: determining a second series number of iterations based on iterations performed for the first series of grover searches; performing the respective one of the second series of grover searches using the second grover iterate when the second series number of iterations does not exceed a second maximum total number of iterations; and terminating the respective one of the second series of grover searches when the second series number of iterations exceeds the second maximum total number of iterations; wherein each of the first and second iterative grover search processes use one of incrementally increasing and decreasing numbers of iterations for each succeeding one of the first and second series of grover searches, respectively; and wherein performing the second iterative grover search process comprises causing the quantum computer to perform the second series of grover searches with the second series number of iterations determined based on a minimum number of iterations among iterations performed to identify respective search targets for a plurality of preceding grover search processes.