2 problems

0 votes0 replies1 view
The simplicial-cone characterization of trivial data hiding
Simplicial-cone conjecture. One has
Conjectureopendata-hiding generalized-probability-theory quantum-informationarXiv posted 2 days ago
0 votes0 replies0 views
Locking conjecture for unlimited-round LOCC protocols
Let $s$ be the message encoded in the shared state, and let an LOCC protocol use an unlimited number of communication rounds. The protocol's output has mutual information with $s$ ,…
Conjectureopendata-hiding locc quantum-informationarXiv posted 2 days ago

The simplicial-cone characterization of trivial data hiding