scientific article; zbMATH DE number 6694244

DOI10.4230/LIPICS.TQC.2014.76MaRDI QIDQ2969050zbMATHFDO

Authors André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora

Publication date 13 March 2017

Full work available at URL https://arxiv.org/abs/1404.5153

zbMATH Keywords

semidefinite programmingquantum information theorycontextuality

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• Optimal bounds for parity-oblivious random access codes
• Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes
• New bounds on \(D\)-ary optimal codes
• On lower bounds for the redundancy of optimal codes
• On Optimal and Achievable Fix-Free Codes
• A lower bound on the undetected error probability and strictly optimal codes
• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes
• On optimal constacyclic codes
• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications

Cited in

(7)

• Two instances of random access code in the quantum regime
• Playing distributed two-party quantum games on quantum networks
• Mutually unbiased special entangled bases with Schmidt number 2d in ℂ2d+1 ⊗ ℂ4d
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Optimal bounds for parity-oblivious random access codes
• Random access test as an identifier of nonclassicality
• The geometry of Bloch space in the context of quantum random access codes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969050)