Classical and Quantum Partition Bound and Detector Inefficiency
From MaRDI portal
Publication:2843287
DOI10.1007/978-3-642-31594-7_52zbMath1272.68145arXiv1203.4155OpenAlexW1647563443MaRDI QIDQ2843287
Jérémie Roland, Virginie Lerays, Sophie Laplante
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.4155
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications ⋮ Approximate nonnegative rank is equivalent to the smooth rectangle bound
This page was built for publication: Classical and Quantum Partition Bound and Detector Inefficiency
