ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Conjecture: For every quantum polynomial-time sampler SS and every classical string xx that SS outputs with probability δ\delta, there is a quantum program for xx of length at most log⁡(1/δ)+O(log⁡n)\log(1/\delta)+O(\log n), decodable in quantum polynomial time. Equivalently, for the corresponding time-bounded quantum program complexity, pKqpoly(n)(x)≤log⁡(1/δ)+O(log⁡n)pKq^{\mathrm{poly}(n)}(x)\leq \log(1/\delta)+O(\log n), where nn is the relevant input-length parameter.

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.