Optimal bounds for parity-oblivious random access codes

Mean deviation of the binomial distribution

J. S. Frame · 1945

Earlier work this paper cites.

Proposed experiment to test local hidden-variable theories

J. Clauser, M. Horne, A. Shimony, and R. Holt · 1969

Earlier work this paper cites.

Some estimates of the information transmitted by quantum communication channels

A. Holevo · 1973

Earlier work this paper cites.

Quantum cryptography, or unforgeable subway tokens

C. Bennett, G. Brassard, S. Breidbard, and S. Wiesner · 1983

Earlier work this paper cites.

Quantum analogues of the Bell inequalities: The case of two spatially separated domains

B. Tsirelson · 1987

Earlier work this paper cites.

Protecting data privacy in private information retrieval schemes

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin · 1998

Earlier work this paper cites.

Dense quantum coding and a lower bound for 1-way quantum automata

A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani · 1999

Earlier work this paper cites.

Optimal lower bounds for quantum automata and random access codes

A. Nayak · 1999

Earlier work this paper cites.

Exponential separation of quantum and classical communication complexity

R. Raz · 1999

Earlier work this paper cites.

Quantum fingerprinting

H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf · 2001

Earlier work this paper cites.

Dense quantum coding and quantum finite automata

A. Ambainis, A. Nayak, A. Ta-Shma, and U. Vazirani · 2002

Cited alongside, same era.

Exponential separation of quantum and classical one-way communication complexity

Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis · 2004

Cited alongside, same era.

Quantum symmetrically-private information retrieval

I. Kerenidis and R. de Wolf · 2004

Cited alongside, same era.

(4,1)-quantum random access coding does not exist—one qubit is not enough to recover one of four bits

M. Hayashi, K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita · 2006

Cited alongside, same era.

Unbounded-error one-way classical and quantum communication complexity

K. Iwama, H. Nishimura, R. Raymond, and S. Yamashita · 2007

Cited alongside, same era.

A hypercontractive inequality for matrix-valued functions with applications to quantum computing and LDCs

Near-optimal extractors against quantum storage

A. De and T. Vidick · 2010

Later among the works it cites.

The uncertainty principle determines the non-locality of quantum mechanics

J. Oppenheim and S. Wehner · 2010

Later among the works it cites.

Entanglement-assisted random access codes

M. Pawłowski and M. Żukowski · 2010

Later among the works it cites.

Quantum one-way communication can be exponentially stronger than classical communication

O. Regev and B. Klartag · 2011

Later among the works it cites.

Does ignorance of the whole imply ignorance of the parts?

T. Vidick and S. Wehner · 2011

Later among the works it cites.

Near-optimal and explicit Bell inequality violations

H. Buhrman, O. Regev, G. Scarpa, and R. de Wolf · 2012

Later among the works it cites.