Decoding algorithms

Can Holevo–Schumacher–Westmoreland codebooks operating at every rate below their ensemble Holevo information be chosen so that their square-root, or pretty-good, measurements have uniform quantum implementations whose cost is polynomial in the blocklength and…

• Quantum Algorithm
• Quantum Communication
• Decoding algorithms
• Classical capacity
• Quantum state discrimination