ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Consider a Turing machine using an experiment as a physical oracle through an exponential-time protocol. For infinite and unbounded precision, the relevant class is P/log∗P/log*; for fixed, finite precision, the relevant class is BPP//log∗BPP//log*. Computational-power conjecture for exponential-time physical oracles. For “realistic” physical theories, using an experiment as a physical oracle with an exponential time protocol boosts the power of Turing machines to P/log∗P/log* for infinite and unbounded precision and to BPP//log∗BPP//log* for fixed precision. The conjecture is motivated by the comparison between the idealised SME and CME experiments and by the authors' claim that adding realistic assumptions to SME yields an exponential protocol with the same computational power as CME.

Record

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.