Entanglement assisted random access codes

Details Entanglement assisted random access codes Entanglement assisted random access codes

2009-06-02

arxiv.org/abs/0906.0524v2

Phys. Rev. A 81, 042326 (2010)

Physics

Quantum Physics

4 pages, 1 figure, published version

Scientific paper

An (n,m,p) Random Access Code (RAC) allows to encode n bits in an m bit message, in such a way that a receiver of the message can guess any of the original $n$ bits with probability p, greater than 1/2. In Quantum RAC's (QRACs) one transmits n qubits. The full set of primitive Entanglement Assisted Random Access Codes (EARACs) is introduced, in which parties are allowed to share a two-qubit singlet. It is shown that via a concatenation of these, one can build for any n an (n,1,p) EARAC. QRAC's for n>3 exist only if parties additionally share classical randomness (SR). We show that EARACs outperform the best of known QRACs not only in the success probabilities but also in the amount of communication needed in the preparatory stage of the protocol. Upper bounds on the performance of EARACs are given, and shown to limit also QRACs.

Affiliated with

Also associated with

No associations

Rating

Entanglement assisted random access codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Entanglement assisted random access codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entanglement assisted random access codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-235605