scientific article

DOI10.4086/toc.2012.v008a021zbMath1262.68041OpenAlexW2406017149MaRDI QIDQ2913822

Roy Kasher, Julia Kempe

Publication date: 27 September 2012

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2012.v008a021

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

entanglementquantum informationextractorsweak sources

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Better short-seed quantum-proof extractors
• Extractors with weak random seeds
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states

This page was built for publication: