Quantum Random Access Codes with Shared Randomness
We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called (n,1,p) quantum random access code (QRAC) where p > 1/2 is...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/4458 |