Memory lower bounds beyond twice the input qubits
Memory lower bounds beyond twice the input qubits — original question and dated source context.
Problem statement
For statistical learning tasks on -qubit systems, develop strong query lower bounds when the algorithm has more than qubits of quantum memory. More generally, what tradeoffs are possible when both classical memory and quantum memory are bounded?
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 3 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.