Nayak and Yuen's rigidity conjecture for superdense coding

About 4 years old · traced to

Let (τ,(Wi))(\tau,(W_i)) be a dd-dimensional superdense coding protocol. Let HA′\mathcal{H}_{A'}, HA”\mathcal{H}_{A”}, HB′\mathcal{H}_{B'}, and HB”\mathcal{H}_{B”} be the Hilbert spaces in the asserted decomposition, with HB”\mathcal{H}_{B”} isomorphic to Cd\mathbb{C}^d, and let ∣ϕd⟩|\phi_d\rangle denote a maximally entangled state on HA”⊗HB”\mathcal{H}_{A”}\otimes\mathcal{H}_{B”}. For operators C,D,EC,D,E, write C=EDC =_E D when CEC†=DED†CEC^\dagger=DED^\dagger. Let [d2]={1,…,d2}[d^2]=\{1,\ldots,d^2\}. Nayak and Yuen's rigidity conjecture. There exist a unitary operator VV on HA′⊗HA”\mathcal{H}_{A'}\otimes\mathcal{H}_{A”}, unitaries (Ci)i∈[d2](C_i)_{i\in[d^2]} on HA′\mathcal{H}_{A'}, an isometry W:HB→HB′⊗HB”W:\mathcal{H}_B\to\mathcal{H}_{B'}\otimes\mathcal{H}_{B”}, a density matrix ρ\rho on HA′⊗HB′\mathcal{H}_{A'}\otimes\mathcal{H}_{B'}, pairwise orthogonal projectors {Pr}\{P_r\} on HA′\mathcal{H}_{A'} summing to the identity, and, for every rr, an orthogonal unitary basis {Er,i}i∈[d2]\{E_{r,i}\}_{i\in[d^2]} for the space of d×dd\times d complex matrices, such that, with

τ′=(V⊗W)τ(V⊗W)†,\tau'=(V\otimes W)\tau(V\otimes W)^\dagger,

one has

τ′=ρA′B′⊗∣ϕd⟩ ⁣⟨ϕd∣A”B”\tau'=\rho^{A'B'}\otimes|\phi_d\rangle\!\langle\phi_d|^{A”B”}

and, for every i∈[d2]i\in[d^2],

(Ci†⊗1)WiV†=τ′∑rPr⊗Er,i.(C_i^\dagger\otimes\mathbb{1})W_iV^\dagger =_{\tau'} \sum_rP_r\otimes E_{r,i}.

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 rr. The parser reports no resolution, so the conjecture remains open in the supplied source.

References

Primary source

Máté Farkas, Jędrzej Kaniewski and Ashwin Nayak, “Mutually Unbiased Measurements, Hadamard Matrices, and Superdense Coding”, arXiv:2204.11886 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.