Memory-sample lower bounds for learning with classical-quantum hybrid memory
From MaRDI portal
Publication:6499288
DOI10.1145/3564246.3585129WikidataQ130909733 ScholiaQ130909733MaRDI QIDQ6499288
Publication date: 8 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure identification and QKD in the bounded-quantum-storage model
- Non-interactive timestamping in the bounded-storage model
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Secure multiparty computation in the bounded storage model
- Authentication in the bounded storage model
- Simple schemes in the bounded storage model
- Composable Security in the Bounded-Quantum-Storage Model
- Cryptography in the Bounded-Quantum-Storage Model
- Tight security proofs for the bounded-storage model
- On Everlasting Security in the Hybrid Bounded Storage Model
- Secure Identification and QKD in the Bounded-Quantum-Storage Model
- A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
- Sample-optimal tomography of quantum states
- Fast Learning Requires Good Memory
- Everlasting security in the bounded storage model
- Time-space hardness of learning sparse parities
- Shadow Tomography of Quantum States
- Memory-sample tradeoffs for linear regression with small error
- Extractor-based time-space lower bounds for learning
- Advances in Cryptology - EUROCRYPT 2004
- Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
This page was built for publication: Memory-sample lower bounds for learning with classical-quantum hybrid memory
