The quantum decoding problem: tight achievability bounds and application to Regev's reduction
From MaRDI portal
This page was built for publication: The quantum decoding problem: tight achievability bounds and application to Regev's reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7291773)