A Tight Lower Bound for Non-coherent Index Erasure
Nathan Lindzey, Ansis Rosmanis

TL;DR
This paper establishes a tight quantum query complexity lower bound of (\u221a{n}) for the non-coherent index erasure problem, resolving an open question and extending analytical techniques for quantum state generation.
Contribution
It introduces a novel extension of the automorphism principle to the general adversary method, linking quantum complexity bounds to association schemes and Krein parameters.
Findings
Proves a tight (\u221a{n}) lower bound for non-coherent index erasure.
Extends automorphism principle to the general adversary method for state generation.
Connects quantum query complexity to association schemes and spherical harmonics.
Abstract
The Index-Erasure problem is a quantum state generation problem that asks a quantum computer to prepare a uniform superposition over the image of an injective function given by an oracle. We prove a tight 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 et al., who gave a tight bound for the coherent case, the case where the ancillary memory must return to its initial state. To prove our main result, we first extend the automorphism principle of H{\o}yer et al. to the general adversary method of Lee et al. for state generation problems, which allows one to exploit the symmetries of these problems to lower bound their quantum query…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs
