ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Find x,yx,y distinct with f(x)=f(y)=1f(x) = f(y) = 1. Consider the case where there are many solutions at low density. How quickly can this be done? Faster than Grover?

More generally, find distinct x1,…,xmx_1,\dots, x_m such that f(x1)=⋯=f(xm)=1f(x_1) = \dots = f(x_m) = 1. Can you do better than mm preimage searches?

Record

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.