Optimal bounds for parity-oblivious random access codes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6694244
- \(n\rightarrow 1\) quantum random access codes using single 3-level systems
- Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
- The geometry of Bloch space in the context of quantum random access codes
- Parity oblivious d-level random access codes and class of noncontextuality inequalities
Cites work
- Dense quantum coding and a lower bound for 1-way quantum automata
- Dense quantum coding and quantum finite automata
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
- Exponential separation of quantum and classical communication complexity
- Exponential separation of quantum and classical one-way communication complexity
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- scientific article; zbMATH DE number 1775399 (Why is no real title available?)
- Mean Deviation of the Binomial Distribution
- Near-optimal and explicit Bell inequality violations
- Near-optimal extractors against quantum storage
- Perfect parallel repetition theorem for quantum XOR proof systems
- Proposed experiment to test local hidden-variable theories
- Quantum analogues of the Bell inequalities. The case of two spatially separated domains
- Quantum one-way communication can be exponentially stronger than classical communication
- Quantum symmetrically-private information retrieval
- The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics
- Unbounded-Error One-Way Classical and Quantum Communication Complexity
Cited in
(11)- Quantum formalism on the plane: POVM-Toeplitz quantization, Naimark theorem and linear polarization of the light
- The geometry of Bloch space in the context of quantum random access codes
- scientific article; zbMATH DE number 6694244 (Why is no real title available?)
- On optimal codes for binary asymmetric channels (Corresp.)
- Random access test as an identifier of nonclassicality
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Mutually unbiased special entangled bases with Schmidt number 2d in ℂ2d+1 ⊗ ℂ4d
- Using a resource theoretic perspective to witness and engineer quantum generalized contextuality for prepare-and-measure scenarios
- Deriving robust noncontextuality inequalities from algebraic proofs of the Kochen–Specker theorem: the Peres–Mermin square
- Two instances of random access code in the quantum regime
- Parity oblivious d-level random access codes and class of noncontextuality inequalities
This page was built for publication: Optimal bounds for parity-oblivious random access codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855036)
