Quantum mechanics allows operations to be in indefinite causal order, leading to advantages in computational and communication tasks. However, basic notions such as communication capacity have not yet been formalized. In light of this, through the process matrix formalism, we formulate different classical capacities for a bipartite quantum process. For one-way communication, we find that general quantum processes satisfy a generalization of the Holevo bound, i.e., we can send, at most, one bit per qubit. The result also holds for processes with indefinite causal order and with shared entanglement between the sender and the receiver. We further extend known bounds to classical channel capacities, showing that general processes cannot outperform causally separable ones. Next, we study bidirectional communication through a causally separable process. Our result shows that a bidirectional protocol cannot exceed the limit of a one-way communication protocol. Finally, we generalize this result to a multiparty broadcast communication protocol through a definite ordered process.
Quantum mechanics allows operations to be in indefinite causal order, leading to advantages in computational and communication tasks. However, basic notions such as communication capacity have not yet been formalized. In light of this, through the process matrix formalism, we formulate different classical capacities for a bipartite quantum process. For one-way communication, we find that general quantum processes satisfy a generalization of the Holevo bound, i.e., we can send, at most, one bit per qubit. The result also holds for processes with indefinite causal order and with shared entanglement between the sender and the receiver. We further extend known bounds to classical channel capacities, showing that general processes cannot outperform causally separable ones. Next, we study bidirectional communication through a causally separable process. Our result shows that a bidirectional protocol cannot exceed the limit of a one-way communication protocol. Finally, we generalize this result to a multiparty broadcast communication protocol through a definite ordered process.
Quantum theory is in principle compatible with scenarios where physical processes occur in an indefinite order, potentially yielding advantages in a broad range of information processing tasks. However, advantages in communication, the most basic form of information processing, have so far remained controversial and hard to prove. Here we provide a framework for assessing the role of causal order in communication, by comparing different causal structures under the constraint that the allowed operations must not generate signaling from signaling-incapable devices. Using this framework, we establish a clear-cut advantage of indefinite causal order, and, at the same time, we identify a series of fundamental limits to the communication power of causal structures in quantum mechanics. Notably, we find that a special form of indefinite causal order, obtained by coherently controlling the order of two processes, enhances the transmission of classical messages in a one-shot scenario, but no quantum operation with indefinite order can offer advantages over shared entanglement when asymptotically many uses of the same communication device are employed. Overall, our results unveil non-trivial relations between communication, causal order, entanglement, and no-signaling quantum processes.
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel. 1.
Can quantum computation become more powerful when operations do not need to follow a definite causal order? We study this question in the process matrix formalism of Oreshkov et al. (Nature Communications, 2012), which allows quantum operations to be connected without a fixed global order. In the computational model, a quantum circuit succinctly describes a process matrix, and the algorithm is given access to its generated channel, with computational cost measured by the size of the generating circuit.
We give polynomial-time algorithms in two settings. First, general process matrix computation suffices to solve every problem in NP. The valid processes used by our algorithm satisfy the purification postulate of Araújo et al. (Quantum, 2017), and their generated channels are unitary, although their generating circuits are not. Second, requiring the process matrices themselves to be pure, we give a polynomial-time algorithm for unique-sink orientation, a general problem capturing several longstanding computational problems in optimization. Our unitary generators are constructed explicitly and efficiently. Assuming that unique-sink orientation has no quantum polynomial-time algorithm, our result shows that indefinite causal order can provide computational power beyond BQP within the process matrix formalism, even while preserving unitarity.
We consider communication between two parties using a bipartite quantum operation, which constitutes the most general quantum mechanical model of two-party communication. We primarily focus on the simultaneous forward and backward communication of classical messages. For the case in which the two parties share unlimited prior entanglement, we give inner and outer bounds on the achievable rate region that generalize classical results due to Shannon. In particular, using a protocol of Bennett, Harrow, Leung, and Smolin, we give a one-shot expression in terms of the Holevo information for the entanglement-assisted one-way capacity of a two-way quantum channel. As applications, we rederive two known additivity results for one-way channel capacities: the entanglement-assisted capacity of a general one-way channel, and the unassisted capacity of an entanglement-breaking one-way channel.
The capacity of distant parties to send signals to one another is a fundamental requirement in many information-processing tasks. Such ability is determined by the causal structure connecting the parties, and more generally, by the intermediate processes carrying signals from one laboratory to another. Here we build a fully fledged resource theory of causal connection for all multi-party communication scenarios, encompassing those where the parties operate in a definite causal order and also where the order is indefinite. We define and characterize the set of free processes and three different sets of free transformations thereof, resulting in three distinct resource theories of causal connection. In the causally ordered setting, we identify the most resourceful processes in the bipartite and tripartite scenarios. In the general setting, instead, our results suggest that there is no global most valuable resource. We establish the signalling robustness as a resource monotone of causal connection and provide tight bounds on it for many pertinent sets of processes. Finally, we introduce a resource theory of causal non-separability, and show that it is – in contrast to the case of causal connection – unique. Together our results offer a flexible and comprehensive framework to quantify and transform general quantum processes, as well as insights into their multi-layered causal connection structures.
We analyze different aspects of multiparty communication over quantum memoryless channels and generalize some of the key results known from bipartite channels to the multiparty scenario. In particular, we introduce multiparty versions of subspace and entanglement transmission fidelities. We also provide alternative, local, versions of fidelities and show their equivalence to the global ones in context of capacity regions defined. An equivalence of two different capacity notions with respect to two types of fidelities is proven. In analogy to the bipartite case it is shown, via sufficiency of isometric encoding theorem, that additional classical forward side channel does not increase capacity region of any quantum channel with k senders and m receivers which represents a compact unit of general quantum networks theory. The result proves that recently provided capacity region of a multiple access channel [M. Horodecki et al., Nature 436, 673 (2005); J. Yard et al., e-print quant-ph/0501045], is optimal also in a scenario of an additional support of forward classical communication.