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

DOI10.1007/S11128-022-03470-4OpenAlexW3169414253MaRDI QIDQ2107101FDOQ2107101

Authors: L. Mančinska, Sigurd A. L. Storgaard 

Publication date: 29 November 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

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

Recommendations

• \(n\rightarrow 1\) quantum random access codes using single 3-level systems
• Optimal bounds for parity-oblivious random access codes
• scientific article
• Unbounded-Error One-Way Classical and Quantum Communication Complexity
• Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes

zbMATH Keywords

quantum random access codesBloch vector representationgeometry of Bloch spaceoptimality of success probability

Mathematics Subject Classification ID

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

Cites Work

• The Bloch-Vector Space for N-Level Systems: the Spherical-Coordinate Point of View
• Title not available (Why is that?)
• Dense quantum coding and a lower bound for 1-way quantum automata
• Dense quantum coding and quantum finite automata
• Geometry of the set of mixed quantum states: an apophatic approach
• Unbounded-Error One-Way Classical and Quantum Communication Complexity

Cited In (2)

• The geometry of quantum codes
• Optimal bounds for parity-oblivious random access codes

This page was built for publication: The geometry of Bloch space in the context of quantum random access codes

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