Quantum random access code

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Quantum random access codes (QRACs) are a quantum information theoretic primitive used to encode a string of classical bits into a quantum state of smaller dimension, such that any single bit of the original string can be retrieved with a certain probability of success. QRACs are a form of quantum data compression that exploit the properties of quantum superposition and measurement to outperform their classical counterparts, known as random access codes (RACs). QRACs are fundamental in the study of quantum communication complexity, quantum entanglement, and the foundations of quantum mechanics, particularly in the context of contextuality and Bell inequalities.

Evidence and sources

Quantum random access codes (QRACs) are a quantum information theoretic primitive used to encode a string of classical bits into a quantum state of smaller dimension, such that any single bit of the original string can be retrieved with a certain probability of success. QRACs are a form of quantum data compression that exploit the properties of quantum superposition and measurement to outperform their classical counterparts, known as random access codes (RACs).

Background

QRACs are fundamental in the study of quantum communication complexity, quantum entanglement, and the foundations of quantum mechanics, particularly in the context of contextuality and Bell inequalities. A (n, m, p) -QRAC is a protocol in which n classical bits, denoted by x = x_1 x_2 \dots x_n \in \{0, 1\}^n , are encoded into a quantum state \rho_x of m qubits. The goal is to retrieve any bit x_i (where i \in \{1, \dots, n\} ) chosen by a receiver, with a success probability of at least p .

Formally, the protocol consists of two maps: Encoding: A map \mathcal{E}: \{0, 1\}^n \to \mathcal{D}(\mathcal{H}_{2^m}) that assigns a density matrix \rho_x to every input string x . Decoding: A set of Positive Operator-Valued Measures (POVMs) \{M_i\}_{i=1}^n . Each M_i = \{E_i^0, E_i^1\} is a two-outcome measurement designed to guess the value of the i -th bit.

The probability of correctly guessing the i -th bit of x is given by: P(\text{guess } x_i \text{ correctly}) = \text{Tr}(E_i^{x_i} \rho_x) \ge p For the code to be non-trivial, the probability p must be strictly greater than 1/2 . The (2, 1, p) -QRAC encodes n=2 classical bits ( x_1, x_2 ) into m=1 qubit. The optimal strategy yields a success probability of p = \frac{1}{2} + \frac{1}{2\sqrt{2}} \approx 0.854 .

The encoding maps the four possible strings 00, 01, 10, 11 to four qubit states located on the equator of the Bloch sphere: 00 \to |+\rangle 01 \to |+i\rangle 10 \to |-\rangle 11 \to |-i\rangle To recover x_1 , one measures in the X-basis (Pauli-X). To recover x_2 , one measures in the Y-basis (Pauli-Y). The (3, 1, p) -QRAC encodes n=3 bits into m=1 qubit. The encoding states correspond to the vertices of a cube inscribed in the Bloch sphere. The optimal success probability is p = \frac{1}{2} + \frac{1}{2\sqrt{3}} \approx 0.789 .

This is the maximum number of bits that can be encoded into a single qubit such that every bit can be recovered with probability strictly greater than 1/2 .

Text derived from https://en.wikipedia.org/w/index.php?oldid=1346154222 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

2 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.