Quantum random access codes(QRACs) are important communication tasks that are usually implemented in prepare-andmeasure scenarios. The receiver tries to retrieve one arbitrarily chosen bit of the original bit-string f...Quantum random access codes(QRACs) are important communication tasks that are usually implemented in prepare-andmeasure scenarios. The receiver tries to retrieve one arbitrarily chosen bit of the original bit-string from the code qubit sent by the sender. In this Letter, we analyze in detail the sequential version of the 3 → 1 QRAC with two receivers. The average successful probability for the strategy of unsharp measurement is derived. The prepare-and-measure strategy within projective measurement is also discussed. It is found that sequential 3 → 1 QRAC with weak measurement cannot be always superior to the one with projective measurement, as the 2 → 1 version can be.展开更多
基金This work was supported by the National Key Research and Development Program of China(Nos.2018YFA0306400 and 2017YFA0304100)the National Natural Science Foundation of China(Nos.12074194,11774180,and U19A2075)the Leading-Edge Technology Program of Jiangsu Natural Science Foundation(No.BK20192001)。
文摘Quantum random access codes(QRACs) are important communication tasks that are usually implemented in prepare-andmeasure scenarios. The receiver tries to retrieve one arbitrarily chosen bit of the original bit-string from the code qubit sent by the sender. In this Letter, we analyze in detail the sequential version of the 3 → 1 QRAC with two receivers. The average successful probability for the strategy of unsharp measurement is derived. The prepare-and-measure strategy within projective measurement is also discussed. It is found that sequential 3 → 1 QRAC with weak measurement cannot be always superior to the one with projective measurement, as the 2 → 1 version can be.
