If two identical copies of a completely depolarizing channel are put into a superposition of their possible causal orders, they can transmit nonzero classical information. Here we study how well we can transmit classical information with depolarizing channels put in superposition of causal orders via a quantum switch. We calculate the Holevo quantity if the superposition uses only cyclic permutations of channels and find that it increases with and it is independent of . For a qubit it never reaches 1 if we are increasing . On the other hand, the classical capacity decreases with the dimension of the message system. Further, for and 4 we studied the superposition of all causal orders and uniformly superposed causal orders belonging to different cosets created by a cyclic permutation subgroup.
Two primary facets of quantum technological advancement that hold great promise are quantum communication and quantum computation. For quantum communication, the canonical resource is entanglement. For quantum gate implementation, the resource is ‘magic’ in an auxiliary system. It has already been shown that quantum coherence is the fundamental resource for the creation of entanglement. We argue on the similar spirit that quantum coherence is the fundamental resource when it comes to the creation of ‘magic’. This unifies the two strands of modern development in quantum technology under the common underpinning of existence of quantum superposition, quantified by the coherence in quantum theory. We also obtain a coherence monotone from the discrete Wigner distribution. We further study the interplay between quantum coherence and ‘magic’ in a qutrit system and that between quantum entanglement and ‘magic’ in a qutrit-qubit setting.
The optimal success probability of a communication game sets fundamental limitations on an operational theory. The quantum advantage of a parity oblivious random access code (PORAC), a communication game, over classical resources reveals the preparation contextuality of quantum theory [R. W. Spekkens et al., Phys. Rev. Lett. 102, 010401 (2009)]. The optimal quantum advantage in the -dit PORAC game for finite dimensions is an open problem. Here, we show that the degree of uncertainty allowed in an operational theory determines the amount of preparation contextuality. We connect the upper bound of the fine-grained uncertainty relation to the success probability of a PORAC game played with the quantum resource. Subsequently, we find the optimal success probability for a 2-dit PORAC game using mutually unbiased bases for the decoding strategy. Finally, we also derive an upper bound on the quantum advantage for the -dit PORAC game.
30 November 2013 in Quantum Information Processing