Hyperdense coding and superadditivity of classical capacities in hypersphere theories

Abstract

In quantum superdense coding, two parties previously sharing entanglement can communicate a two bit message by sending a single qubit. We study this feature in the broader framework of general probabilistic theories. We consider a particular class of theories in which the local state space of the communicating parties corresponds to Euclidian hyperballs of dimension n (the case n = 3 corresponds to the Bloch ball of quantum theory). We show that a single n-ball can encode at most one bit of information, independently of n. We introduce a bipartite extension of such theories for which there exist dense coding protocols such that n log 1 2 + ( ) bits are communicated if entanglement is previously shared by the communicating parties. For n 3, > these protocols are more powerful than the quantum one, because more than two bits are communicated by transmission of a system that locally encodes at most one bit. We call this phenomenon hyperdense coding (HDC). Our HDC protocols imply superadditive classical capacities: two entangled systems can encode n log 1 2 2 + > ( ) bits, even though each system individually encodes at most one bit. In our examples, HDC and superadditivity of classical capacities come at the expense of violating tomographic locality or dynamical continuous reversibility.

Quantum steering inequality with tolerance for measurement-setting-errors: experimentally feasible signature of unbounded violation

“…Further, it would be interesting to examine our result on the ground of general probabilistic theories referred to the receiver's (Bob) system (cf. [44] and references therein).We hope that the results and discussion presented in this paper will stimulate the future research on quantum correlations in a broader context, including their applications and demonstrations.Methods. The proof of our Theorem involves a surprisingly powerful modification of the former analysis presented in [8]: it builds-in tolerance for possible errors in measurement settings.…”

Computation in a general physical setting

“…Hence, a malicious server cannot learn any of the client's information, and all the client needs to be able to do is prepare single qubit states and send them to the server. 15 Moreover, the security of this protocol has been shown to follow from the no-signalling principle [67]. However, while the server cannot learn the client's computation, they can still tamper with it by deviating from the client's instructions 16 .…”

Quantum speedup in the identification of cause–effect relations

“…Given the advantage of quantum theory over classical theory, it is tempting to ask whether alternative physical theories could offer even larger advantages. Interesting candidates are theories that admit more powerful dense coding protocols than quantum theory [37], as one might expect super-quantum advantages to arise from the presence of stronger correlations with the reference system. In a similar vein, one could explore physical theories with higher dimensional state spaces, such as Zyczkowski's quartic theory [38], or quantum theory on quaterionic Hilbert spaces [39].…”