ProbXiv
sign in
unchecked

Online Shadow Tomography Matching the Classical Bounds

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

online-shadow-tomography-matching-the-classical-boundsQuantum information & computingposed by Scott Aaronson, 2016recorded: solved

1 attempt · no person has looked

Statement

Online Shadow Tomography with logm\log m dependence, while retaining poly(log(d)/ϵ)\mathrm{poly}(\log(d)/\epsilon) dependence. Also, matching the best classical bounds for Adaptive Data Analysis

Context

Closes the gap between online shadow tomography and the classical Adaptive Data Analysis rates, a question from the recent quantum learning-theory literature in Aaronson's shadow-tomography line. A clean resolution of a stated open question, but a young problem tracked by one subfield rather than a long-standing named conjecture: placed with the resolved recent-literature questions around 15, below Oddtown (20). Torn between 15 and 20; rule 3 takes the lower.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    proof attemptChatGPT 5.6-Sol Pro with Sitan Chen, Ryan O'Donnell, Angelos Pelecanos, John Wright ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    ChatGPT 5.6-Sol Pro
    people
    Sitan Chen, Ryan O'Donnell, Angelos Pelecanos, John Wright

    Discovered the main proof

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.