scientific article
From MaRDI portal
Publication:3549651
zbMath1232.68051MaRDI QIDQ3549651
No author found.
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
privacyexponential separationquantum storagequantum adversarybounded-storage model of cryptographyone-way quantum communication protocol
Related Items (17)
Two-way and one-way quantum and classical automata with advice for online minimization problems ⋮ Classical versus quantum communication in XOR games ⋮ Quantum weakly nondeterministic communication complexity ⋮ Quantum versus classical online streaming algorithms with logarithmic size of memory ⋮ The learnability of quantum states ⋮ Unnamed Item ⋮ Unbounded-Error Classical and Quantum Communication Complexity ⋮ Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph ⋮ Quantum online algorithms with respect to space and advice complexity ⋮ Quantum online streaming algorithms with logarithmic memory ⋮ On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity ⋮ Unnamed Item ⋮ Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker ⋮ Exponential separation of quantum and classical online space complexity ⋮ New bounds on classical and quantum one-way communication complexity ⋮ On Approximating Matrix Norms in Data Streams ⋮ Quantum versus randomized communication complexity, with efficient players
This page was built for publication:
