Nayak and Yuen's rigidity conjecture for superdense coding
Nayak and Yuen's rigidity conjecture for superdense coding
Let be a -dimensional superdense coding protocol. Let , , , and be the Hilbert spaces in the asserted decomposition, with isomorphic to , and let denote a maximally entangled state on . For operators , write when . Let . Nayak and Yuen's rigidity conjecture. There exist a unitary operator on , unitaries on , an isometry , a density matrix on , pairwise orthogonal projectors on summing to the identity, and, for every , an orthogonal unitary basis for the space of complex matrices, such that, with
one has
and, for every ,
The conjecture asserts rigidity of every superdense coding protocol up to local isometries and the choice of an orthogonal unitary basis, with the auxiliary state permitting a shared random outcome . The parser reports no resolution, so the conjecture remains open in the supplied source.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Máté Farkas, Jędrzej Kaniewski and Ashwin Nayak, “Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding”, arXiv:2204.11886 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.