Multiple marked inputs: exclusion bounds and tight query regimes
Statement
Find distinct with . Consider the case where there are many solutions at low density. How quickly can this be done? Faster than Grover?
More generally, find distinct such that . Can you do better than preimage searches?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.