Abstract
In quantum information theory, there are several important open problems which center around whether certain quantities are additive or not. Especially, additivity conjecture about Holevo capacity and additivity/strong superadditivity conjecture about entanglement of formation have been attracting many researchers. It recently turned out that these are equivalent to the additivity of the minimum output entropy of quantum channels, which is mathematically simpler. This Letter suggests yet another additivity conjecture which is equivalent to those, and is mathematically simple. This conjecture might be easier than other conjectures to solve, for this can be proven for almost all the examples where one of these conjectures are proven.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
