The geometry of Bloch space in the context of quantum random access codes

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Standard

The geometry of Bloch space in the context of quantum random access codes. / Mančinska, Laura; Storgaard, Sigurd A.L.

I: Quantum Information Processing, Bind 21, Nr. 4, 143, 2022, s. 1-16.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Harvard

Mančinska, L & Storgaard, SAL 2022, 'The geometry of Bloch space in the context of quantum random access codes', Quantum Information Processing, bind 21, nr. 4, 143, s. 1-16. https://doi.org/10.1007/s11128-022-03470-4

APA

Mančinska, L., & Storgaard, S. A. L. (2022). The geometry of Bloch space in the context of quantum random access codes. Quantum Information Processing, 21(4), 1-16. [143]. https://doi.org/10.1007/s11128-022-03470-4

Vancouver

Mančinska L, Storgaard SAL. The geometry of Bloch space in the context of quantum random access codes. Quantum Information Processing. 2022;21(4):1-16. 143. https://doi.org/10.1007/s11128-022-03470-4

Author

Mančinska, Laura ; Storgaard, Sigurd A.L. / The geometry of Bloch space in the context of quantum random access codes. I: Quantum Information Processing. 2022 ; Bind 21, Nr. 4. s. 1-16.

Bibtex

@article{c706e7a050f941cc8fe844aac32296f1,
title = "The geometry of Bloch space in the context of quantum random access codes",
abstract = "We study the communication protocol known as a quantum random access code (QRAC) which encodes n classical bits into m qubits (m< n) with a probability of recovering any of the initial n bits of at least p>12. Such a code is denoted by (n, m, p)-QRAC. If cooperation is allowed through a shared random string, we call it a QRAC with shared randomness. We prove that for any (n, m, p)-QRAC with shared randomness the parameter p is upper bounded by 12+122m-1n. For m= 2 , this gives a new bound of p≤12+12n confirming a conjecture by Imamichi and Raymond (AQIS{\textquoteright}18). Our bound implies that the previously known analytical constructions of (3,2,12+16)- , (4,2,12+122)- and (6,2,12+123)-QRACs are optimal. To obtain our bound, we investigate the geometry of quantum states in the Bloch vector representation and make use of a geometric interpretation of the fact that any two quantum states have a nonnegative overlap.",
keywords = "Bloch vector representation, Geometry of Bloch space, Optimality of success probability, Quantum random access codes",
author = "Laura Man{\v c}inska and Storgaard, {Sigurd A.L.}",
note = "Publisher Copyright: {\textcopyright} 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",
year = "2022",
doi = "10.1007/s11128-022-03470-4",
language = "English",
volume = "21",
pages = "1--16",
journal = "Quantum Information Processing",
issn = "1570-0755",
publisher = "Springer",
number = "4",

}

RIS

TY - JOUR

T1 - The geometry of Bloch space in the context of quantum random access codes

AU - Mančinska, Laura

AU - Storgaard, Sigurd A.L.

N1 - Publisher Copyright: © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2022

Y1 - 2022

N2 - We study the communication protocol known as a quantum random access code (QRAC) which encodes n classical bits into m qubits (m< n) with a probability of recovering any of the initial n bits of at least p>12. Such a code is denoted by (n, m, p)-QRAC. If cooperation is allowed through a shared random string, we call it a QRAC with shared randomness. We prove that for any (n, m, p)-QRAC with shared randomness the parameter p is upper bounded by 12+122m-1n. For m= 2 , this gives a new bound of p≤12+12n confirming a conjecture by Imamichi and Raymond (AQIS’18). Our bound implies that the previously known analytical constructions of (3,2,12+16)- , (4,2,12+122)- and (6,2,12+123)-QRACs are optimal. To obtain our bound, we investigate the geometry of quantum states in the Bloch vector representation and make use of a geometric interpretation of the fact that any two quantum states have a nonnegative overlap.

AB - We study the communication protocol known as a quantum random access code (QRAC) which encodes n classical bits into m qubits (m< n) with a probability of recovering any of the initial n bits of at least p>12. Such a code is denoted by (n, m, p)-QRAC. If cooperation is allowed through a shared random string, we call it a QRAC with shared randomness. We prove that for any (n, m, p)-QRAC with shared randomness the parameter p is upper bounded by 12+122m-1n. For m= 2 , this gives a new bound of p≤12+12n confirming a conjecture by Imamichi and Raymond (AQIS’18). Our bound implies that the previously known analytical constructions of (3,2,12+16)- , (4,2,12+122)- and (6,2,12+123)-QRACs are optimal. To obtain our bound, we investigate the geometry of quantum states in the Bloch vector representation and make use of a geometric interpretation of the fact that any two quantum states have a nonnegative overlap.

KW - Bloch vector representation

KW - Geometry of Bloch space

KW - Optimality of success probability

KW - Quantum random access codes

UR - http://www.scopus.com/inward/record.url?scp=85127570872&partnerID=8YFLogxK

U2 - 10.1007/s11128-022-03470-4

DO - 10.1007/s11128-022-03470-4

M3 - Journal article

AN - SCOPUS:85127570872

VL - 21

SP - 1

EP - 16

JO - Quantum Information Processing

JF - Quantum Information Processing

SN - 1570-0755

IS - 4

M1 - 143

ER -

ID: 307090472