The quantum communication power of indefinite causal order

• URL: http://arxiv.org/abs/2510.08507v1
• Date: Thu, 09 Oct 2025 17:42:04 GMT
• Title: The quantum communication power of indefinite causal order
• Authors: Xuanqiang Zhao, Benchi Zhao, Giulio Chiribella,
• Abstract summary: We develop a framework that can be used to rigorously assess the role of causal order.<n>In this setting, we establish a clear-cut advantage of indefinite order in the one-shot transmission of classical messages.<n>We also show that the advantage is not generic to all communication tasks.
• Score: 1.8479558716666362
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum theory is in principle compatible with scenarios where physical processes take place in an indefinite causal order, a possibility that was shown to yield advantages in several 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 develop a framework that can be used to rigorously assess the role of causal order in a scenario where communication links are built by assembling multiple quantum devices. In this setting, we establish a clear-cut advantage of indefinite order in the one-shot transmission of classical messages. On the other hand, we also show that the advantage is not generic to all communication tasks. Notably, we find that indefinite order does not offer any advantage over shared entanglement in the asymptotic scenario where a large number of uses of the same communication device is employed. Overall, our results unveil non-trivial relations between communication, causal order, entanglement, and no-signaling resources in quantum mechanics.

Related papers

• An Operational Framework for Nonclassicality in Quantum Communication Networks [9.312605205492458]
  entanglement and quantum communication offer significant advantages in distributed information processing.<n>We develop an operational framework for realizing these enhancements in resource-constrained quantum networks.<n>In all cases, we find that entanglement-assisted communication, both classical and quantum, leads to nonclassicality.
  arXiv  Detail & Related papers  (2024-03-05T14:07:37Z)
• Reassessing the advantage of indefinite causal orders for quantum metrology [0.0]
  In this work, we argue that some of these advantages in fact do not hold if a fairer comparison is made. We consider a framework that allows for a proper comparison between the performance of different classes of indefinite causal order processes.
  arXiv  Detail & Related papers  (2023-12-19T14:03:40Z)
• Simple Information Processing Tasks with Unbounded Quantum Advantage [0.0]
  We show that it is possible to detect a definite, unbounded advantage of quantum systems over classical systems. No finite storage can be used to store all the coordinated actions needed to implement all the possible quantum communication tasks with classical systems.
  arXiv  Detail & Related papers  (2023-08-15T12:07:31Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Entanglement in prepare-and-measure scenarios: many questions, a few answers [0.0]
  Entanglement and quantum communication are paradigmatic resources in quantum information science. Correlations due to entanglement when communication is absent have been studied in Bell scenarios. We focus on entanglement-assisted prepare-and-measure scenarios.
  arXiv  Detail & Related papers  (2021-08-01T12:22:00Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Classical communication through quantum causal structures [0.0]
  We formulate different classical capacities for a bi-partite quantum process. A one-way communication protocol through an arbitrary process cannot outperform a causally separable process. A bi-directional protocol cannot exceed the limit of one way communication protocol.
  arXiv  Detail & Related papers  (2020-07-09T20:33:17Z)
• Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
  We show how to make quantum networks, both standard and entanglement-based, genuine quantum. We provide them with the possibility of handling superposed tasks and superposed addressing.
  arXiv  Detail & Related papers  (2020-04-30T18:00:06Z)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.