Causality in Pure Quantum Computation with Quantum Control

• URL: http://arxiv.org/abs/2607.15926v1
• Date: Fri, 17 Jul 2026 13:10:20 GMT
• Title: Causality in Pure Quantum Computation with Quantum Control
• Abstract summary: Indefinite causal order is a characteristic phenomenon in quantum computation, with examples including the quantum SWITCH and the OCB process.<n>This paper studies such unreal causality issue in a higher-order setting, proposing a typed calculus with quantum control and its categorical semantics.<n>We also present a novel model that is closely related to the Caus construction, by which we prove that some physically-unrealizable processes are not definable in our language.
• Score: 0.9668407688201359
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Indefinite causal order is a characteristic phenomenon in quantum computation, with examples including the quantum SWITCH and the OCB process. Not all such processes are believed to be physically realizable: while some implementations of the quantum SWITCH have been proposed, the OCB process is suspected to be unrealizable. This difference in realizability is commonly attributed to constraints imposed by physical causality. This paper studies such a causality issue in a higher-order setting, proposing a typed lambda calculus with quantum control and its categorical semantics. Our calculus extends pure quantum computation with higher-order functions and quantum conditional branching, and it is equipped with a type system based on intuitionistic BV logic to enforce causality. We also present a novel model that is closely related to the Caus construction, by which we prove that some physically-unrealizable processes are not definable in our language.

Related papers

• Quantum SWITCH-induced non-Markovianity is not entirely quantum [0.0]
  Indefinite causal order extends quantum information processing beyond fixed causal structures.<n>By coherently superposing different orders of quantum channels, the quantum SWITCH has been shown to provide operational advantages.<n>Recent studies have revealed that the quantum SWITCH can generate memory effects, manifested as non-Markovian information backflow.
  arXiv  Detail & Related papers  (2026-08-05T10:52:44Z)
• Higher-Order Programs with Indefinite Causal Orders: a Linear Approach to Coherent Control of Quantum Processes [0.0]
  We introduce a higher-order quantum functional language for quantum computation.<n>It supports general quantum computation, not merely the permutation of channels.<n>It can express every quantum channel at first order, and at second order a large subclass of quantum circuits with quantum control.
  arXiv  Detail & Related papers  (2026-07-10T15:38:33Z)
• Higher-order quantum processes respecting closed labs in a spacetime have quantum controlled causal order [0.0]
  A longstanding open question is what is the largest class of abstract processes that admit physical realisations without post-selection.<n>We provide a rigorous answer using a top-down approach grounded in relativistic causality principles.
  arXiv  Detail & Related papers  (2026-05-08T18:01:12Z)
• 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)
• Relation between nonclassical features through logical qudits [0.0]
  Quantum computation employs different types of logical qubits and qudits in terms of physical multiqubit and multiqudit systems. We show that there is reciprocity in nonclassical correlations in physical multiqubit systems and coherence in a single logical qubit system.
  arXiv  Detail & Related papers  (2023-06-21T21:04:34Z)
• Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
  A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical. We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more. Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
  arXiv  Detail & Related papers  (2023-03-02T14:18:17Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Qafny: A Quantum-Program Verifier [39.47005122712576]
  We present Qafny, an automated proof system for verifying quantum programs. At its core, Qafny uses a type-guided quantum proof system that translates quantum operations to classical array operations. We show how Qafny can efficiently verify important quantum algorithms, including quantum-walk algorithms, Grover's algorithm, and Shor's algorithm.
  arXiv  Detail & Related papers  (2022-11-11T18:50:52Z)
• No-signalling constrains quantum computation with indefinite causal structure [45.279573215172285]
  We develop a formalism for quantum computation with indefinite causal structures. We characterize the computational structure of higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
  arXiv  Detail & Related papers  (2022-02-21T13:43:50Z)
• 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)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Discrimination against or in favor of qubits in quantum theory [0.0]
  In quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit probabilities having only values 0 and 1. The present paper shows that erasing qubit discrimination leads to a model of computation which permits execution of many primitive operations in a massive parallel way.
  arXiv  Detail & Related papers  (2020-04-09T01:06:10Z)

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.