A remark on the paper ``Randomizing quantum states: Constructions and applications''

Simple item page
dc.creatorAubrun, Guillaume
dc.date2008-02-28
dc.date.accessioned2026-07-07T09:23:46Z
dc.date.available2026-07-07T09:23:46Z
dc.descriptionThe concept of $\e$-randomizing quantum channels has been introduced by Hayden, Leung, Shor and Winter in connection with approximately encrypting quantum states. They proved using a discretization argument that sets of roughly $d \log d$ random unitary operators provide examples of such channels on $\C^d$. We show that a simple trick improves the efficiency of the argument and reduces the number of unitary operators to roughly $d$.
dc.identifierhttps://arxiv.org/abs/0802.4193
dc.identifierhttp://arxiv.org/abs/0802.4193
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155857
dc.subjectQuantum Physics
dc.titleA remark on the paper ``Randomizing quantum states: Constructions and applications''
dc.typetext

Files

Collections

arXiv