Approximate Private Quantum Channels
| dc.creator | Dickinson, Paul | |
| dc.date | 2006-11-02 | |
| dc.date.accessioned | 2026-07-07T07:34:07Z | |
| dc.date.available | 2026-07-07T07:34:07Z | |
| dc.description | This thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for $ε$-randomizing maps, $n+2\log(1/ε)+c$ bits required to $ε$-randomize an arbitrary $n$-qubit state by improving a scheme of Ambainis and Smith \cite{AS04} based on small bias spaces \cite{NN90, AGHP92}. We show by a probabilistic argument that in fact the great majority of random schemes using slightly more than this many bits of key are also $ε$-randomizing. We provide the first known non-trivial lower bound for $ε$-randomizing maps, and develop several conditions on them which we hope may be useful in proving stronger lower bounds in the future. | |
| dc.description | 78 pages, 1 figure. Master's Thesis accepted at University of Waterloo | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0611037 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0611037 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/119700 | |
| dc.subject | Quantum Physics | |
| dc.title | Approximate Private Quantum Channels | |
| dc.type | text |