How well can you know the edge of a quantum pyramid?

Abstract

We consider a symmetric quantum communication scenario in which the signal states are edges of a quantum pyramid of arbitrary dimension and arbitrary shape, and all edge states are transmitted with the same probability. The receiver could employ different decoding strategies: he could minimize the error probability, or discriminate without ambiguity, or extract the accessible information. We state the optimal measurement scheme for each strategy. For large parameter ranges, the standard square-root measurement does not extract the information optimally.

13 pages, 5 figures, 1 table

References in corpus (4)

• Tomographic Quantum Cryptography
• Iterative procedure for computing accessible information in quantum communication
• Quantum Cryptography: Security Criteria Reexamined
• Security bounds in Quantum Cryptography using d-level systems

Cited by in corpus (8)

• On mutually unbiased bases
• Past of a quantum particle: Common sense prevails
• Duality games and operational duality relations
• Discrete outcome quantum sensor networks
• Sequential discrimination of qudits by multiple observers
• The Helstrom measurement: A nondestructive implementation
• Optimizing Initial State of Detector Sensors in Quantum Sensor Networks
• Test-State Approach to the Quantum Search Problem