Dihedral Coset Problem
Statement
For , let be hidden. Given polynomially many independent copies of the mixed coset state , where , recover with non-negligible success probability using a quantum algorithm running in time polynomial in .
Record
- 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.