Memory-sample lower bounds for learning with classical-quantum hybrid memory

Cites work

scientific article; zbMATH DE number 1088242 (Why is no real title available?)
scientific article; zbMATH DE number 1942425 (Why is no real title available?)
scientific article; zbMATH DE number 2086371 (Why is no real title available?)
scientific article; zbMATH DE number 1418287 (Why is no real title available?)
A Tight High-Order Entropic Quantum Uncertainty Relation with Applications
Advances in Cryptology - EUROCRYPT 2004
Authentication in the bounded storage model
Composable Security in the Bounded-Quantum-Storage Model
Conditionally-perfect secrecy and a provably-secure randomized cipher
Cryptography in the Bounded-Quantum-Storage Model
Distributional and \(L^q\) norm inequalities for polynomials over convex bodies in \(\mathbb{R}^n\)
Entropy samplers and strong generic lower bounds for space bounded learning
Everlasting security in the bounded storage model
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
Extractor-based time-space lower bounds for learning
Fast learning requires good memory: a time-space lower bound for parity learning
Memory-sample tradeoffs for linear regression with small error
Non-interactive timestamping in the bounded-storage model
On Everlasting Security in the Hybrid Bounded Storage Model
Sample-optimal tomography of quantum states
Secure Identification and QKD in the Bounded-Quantum-Storage Model
Secure identification and QKD in the bounded-quantum-storage model
Secure multiparty computation in the bounded storage model
Shadow tomography of quantum states
Simple schemes in the bounded storage model
Tight security proofs for the bounded-storage model
Time-space hardness of learning sparse parities

This page was built for publication: Memory-sample lower bounds for learning with classical-quantum hybrid memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499288)