Publication:3549651
From MaRDI portal
zbMath1232.68051MaRDI QIDQ3549651
No author found.
Publication date: 5 January 2009
privacy; exponential separation; quantum storage; quantum adversary; bounded-storage model of cryptography; one-way quantum communication protocol
Related Items
Unnamed Item, Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph, On Approximating Matrix Norms in Data Streams, Unbounded-Error Classical and Quantum Communication Complexity, Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker, Unnamed Item, Quantum versus classical online streaming algorithms with logarithmic size of memory, Quantum weakly nondeterministic communication complexity, Quantum online algorithms with respect to space and advice complexity, Exponential separation of quantum and classical online space complexity, New bounds on classical and quantum one-way communication complexity, Classical versus quantum communication in XOR games, Quantum versus randomized communication complexity, with efficient players, Two-way and one-way quantum and classical automata with advice for online minimization problems, Quantum online streaming algorithms with logarithmic memory, On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity, The learnability of quantum states