OpenFrontiers
← Back to the index
OP-9450Status unassessedQuantum information

A hierarchy with one additional quantum replica

A hierarchy with one additional quantum replica — original question and dated source context.

Historical source; current status unassessedAs of 2024-10-27Source & evidence ↓

Problem statement

A task is kk-replica hard if measurements on at most kk copies at a time need exponentially many queries, and is rr-replica easy if allowing joint measurements on rr copies permits efficient learning. For each k>1k>1, are there tasks that are kk-replica hard but (k+1)(k+1)-replica easy, or (k+O(1))(k+O(1))-replica easy?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Progress & source assessment

Historical source dated 2024-10-27. Current resolution status has not been independently reassessed; bounds and claims in the source context refer to that date.

References
  1. [1]Chen, Cotler, Huang, Li and Tang, Some Open Problems in Quantum Learning, FOCS 2024 workshop, slide 6 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.