Adversary Lower Bound for Element Distinctness
classification
🪐 quant-ph
cs.CC
keywords
adversarydistinctnesselementalphabetboundconstructexplicitgiven
read the original abstract
In this note we construct an explicit optimal (negative-weight) adversary matrix for the element distinctness problem, given that the size of the alphabet is sufficiently large.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.