Sample complexity of entanglement testing
Sample complexity of entanglement testing — original question and dated source context.
Problem statement
A mixed state on two -qubit registers is separable when it is a convex combination of product states . Given copies of a state promised to be separable or -far in trace distance from every separable state, determine the number of copies needed to distinguish the cases, allowing entangled measurements. The 2024 slides give a gap between a lower bound of order and an upper bound of order .
Lean 4
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.
- [1]Chen, Cotler, Huang, Li and Tang, Some Open Problems in Quantum Learning, FOCS 2024 workshop, slide 4 link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts 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 notesNotes 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.