Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"epsilon-randomize"”.

  1. Approximate Private Quantum Channels

    … We develop the best known upper bound for &epsilon;-randomizing maps, <em>n</em> + 2log(1/&epsilon;) + <em>c</em> bits required to &epsilon;-randomize an arbitrary <em>n</em>-qubit state by improving a scheme of Ambainis and Smith [5] based on small bias spaces [16, 3]. We show by a …

    waterloo Repository record for Approximate Private Quantum Channels (opens in a new tab)