# A Tight Lower Bound for Index Erasure

@inproceedings{Lindzey2020ATL, title={A Tight Lower Bound for Index Erasure}, author={N. Lindzey and A. Rosmanis}, booktitle={ITCS}, year={2020} }

The Index Erasure problem asks a quantum computer to prepare a uniform superposition over the image of an injective function given by an oracle. We prove a tight $\Omega(\sqrt{n})$ lower bound on the quantum query complexity of the non-coherent case of the problem, where, in addition to preparing the required superposition, the algorithm is allowed to leave the ancillary memory in an arbitrary function-dependent state. This resolves an open question of Ambainis, Magnin, Roetteler, and Roland… CONTINUE READING

2 Citations

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 25 REFERENCES

Quantum Adversary Lower Bound for Element Distinctness with Small Range

- Computer Science, Mathematics
- 2014

- 6
- PDF

Quantum lower bounds for the collision and the element distinctness problems

- Computer Science, Mathematics
- 2004

- 300
- PDF