Parity oblivious d-level random access codes and class of noncontextuality inequalities
From MaRDI portal
Publication:670063
Abstract: One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such tasks in any preparation noncontextual theory. These bounds constitute noncontextuality inequalities for any value of d. For d=3, using a set of mutually asymmetric biased bases we show that the corresponding noncontextual bound is violated by quantum theory. We also show quantum violation of the inequalities for some other higher values of d. This reveals operational usefulness of preparation contextuality of higher level quantum systems.
Recommendations
- A note on random coding bounds for classical-quantum channels
- A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes
- The randomness in \(2 \rightarrow 1\) quantum random access code without a shared reference frame
- Probabilistic dense coding using a non-symmetric multipartite quantum channel
- Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender
- Decoherence-Insensitive Quantum Communication by Optimal $C^{\ast }$-Encoding
- Semi-device-independent randomness expansion using \(n\rightarrow1\) sequential quantum random access codes
- Non-binary entanglement-assisted stabilizer codes
- Source-device-independent randomness expansion using quantum random access codes
- Dualities and identities for entanglement-assisted quantum codes
Cites work
- scientific article; zbMATH DE number 3251317 (Why is no real title available?)
- Belief-invariant and quantum equilibria in games of incomplete information
- Bell inequalities and entanglement
- Dense quantum coding and a lower bound for 1-way quantum automata
- Dense quantum coding and quantum finite automata
- Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square
- From Bell's theorem to secure quantum key distribution
- Limits on nonlocal correlations from the structure of the local state space
- Ontological models, preparation contextuality and nonlocality
- Optimal bounds for parity-oblivious random access codes
- Simple unified form for the major no-hidden-variables theorems
- Testing the dimension of Hilbert spaces
Cited in
(8)- Using a resource theoretic perspective to witness and engineer quantum generalized contextuality for prepare-and-measure scenarios
- Advantage of Quantum Theory over Nonclassical Models of Communication
- The randomness in \(2 \rightarrow 1\) quantum random access code without a shared reference frame
- Contextuality-based quantum conferencing
- Optimal bounds for parity-oblivious random access codes
- \(n\rightarrow 1\) quantum random access codes using single 3-level systems
- Random access test as an identifier of nonclassicality
- Expanding the sharpness parameter area based on sequential \(3 \rightarrow 1\) parity-oblivious quantum random access code
This page was built for publication: Parity oblivious \(d\)-level random access codes and class of noncontextuality inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q670063)
