Polynomial-time coding theorem for time-bounded quantum Kolmogorov complexity
Statement
Conjecture: For every quantum polynomial-time sampler and every classical string that outputs with probability , there is a quantum program for of length at most , decodable in quantum polynomial time. Equivalently, for the corresponding time-bounded quantum program complexity, , where is the relevant input-length parameter.
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.