REVIEW 1 cited by
Simple and general bounds on quantum random access codes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Simple and general bounds on quantum random access codes
read the original abstract
Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a D-dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, and we demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.
Forward citations
Cited by 1 Pith paper
-
Optimal Average Success Probabilities of Binary $(n,n-1)$ and $(n,n-2)$ Quantum Random Access Codes via a Proof of the Corresponding Conjectured Bound
The optimal average success probability of binary (n,n-1) and (n,n-2) QRACs equals exactly 1/2 + 1/2 sqrt(m/n).
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.