2000 character limit reached
Quantum random access codes and incompatibility of measurements
Published 11 Nov 2019 in quant-ph | (1911.04360v1)
Abstract: We prove that quantum random access code (QRAC) performs better than its classical counterpart only when incompatible quantum measurements are used in the decoding task. As a consequence, evaluating the average success probability for QRAC provides a semi-device independent test for the detection of quantum incompatibility. We further demonstrate that any incompatible pair of projective measurements gives an advantage over all classical strategies. Finally, we establish a connection between the maximal average success probability for QRAC and earlier quantities introduced to assess incompatibility.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.