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

Tight bounds and natural examples for quantum channel testing

Tight bounds and natural examples for quantum channel testing — original question and dated source context.

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

Problem statement

Distinguish an unknown maximally depolarizing nn-qubit channel from a fixed Haar-random unitary channel using adaptive prepare–apply–measure queries. Can the source’s Ω(2n/3)\Omega(2^{n/3}) lower bound be improved to a tight Θ(2n/2)\Theta(2^{n/2}) bound? Find other natural property-testing problems with interesting quantum advantages that do not rely on Haar-random unitaries or pseudorandom substitutes, for example low-depth circuits or local Hamiltonians.

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 9 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.