Process matrices describe correlations with no definite order of operations, and the property that sets a genuinely indefinite process apart from an ordinary mixture of ordered ones is called causal nonseparability. This paper gives a careful, self-contained account of why the whole framework hangs together consistently, across three levels at once, the level of plain probabilities, the level of quantum measurement rules, and the level of classical logical consistency. Its main practical result is an exact, written-out certificate that detects the indefiniteness of the canonical process by hand, replacing a numerical computer search with a formula a reader can check with pencil and paper. Working in a convenient basis in which the relevant bookkeeping operations act especially simply, the paper derives the certificate in closed form as the identity minus two specific order-sensitive terms. It shows that the two natural pieces of this certificate are well-behaved in the technical sense required, each with an explicit, exactly known set of values and an explicit proof of positivity written as a sum of squares. Evaluated on the canonical indefinite process, the certificate returns a specific negative number exactly, which is precisely the signal of indefiniteness. The paper then abstracts the construction into a general recipe, a theorem stating that any certificate of this shape is valid whenever a simple sum-of-squares condition holds on its two pieces. Alongside this it lays out, level by level, how the framework stays consistent, from the requirement that probabilities behave, through the quantum measurement rule, to the classical fixed-point picture in which a would-be paradoxical loop has, or fails to have, a unique consistent resolution. Every numbered result is also formally verified in a machine proof assistant, to the authors' knowledge the first such verification for this framework, with the correspondence to the formal statements collected in an appendix. The value of the paper is to turn what had been the output of an opaque numerical optimizer into a transparent, reusable, and independently machine-checked object that anyone can audit and build on. By exhibiting an exact certificate and a general recipe for producing more, it lowers the barrier to certifying indefinite causal order, and by verifying the whole consistency core in a proof assistant it supplies a dependable formal foundation for later work. The paper is modest about what it adds, presenting the physics of the canonical process as already known and offering instead an exact and verifiable rendering of it.
Process matrices describe correlations with no definite order of operations, and the property that sets a genuinely indefinite process apart from an ordinary mixture of ordered ones is called causal nonseparability. This paper gives a careful, self-contained account of why the whole framework hangs together consistently, across three levels at once, the level of plain probabilities, the level of quantum measurement rules, and the level of classical logical consistency. Its main practical result is an exact, written-out certificate that detects the indefiniteness of the canonical process by hand, replacing a numerical computer search with a formula a reader can check with pencil and paper. Working in a convenient basis in which the relevant bookkeeping operations act especially simply, the paper derives the certificate in closed form as the identity minus two specific order-sensitive terms. It shows that the two natural pieces of this certificate are well-behaved in the technical sense required, each with an explicit, exactly known set of values and an explicit proof of positivity written as a sum of squares. Evaluated on the canonical indefinite process, the certificate returns a specific negative number exactly, which is precisely the signal of indefiniteness. The paper then abstracts the construction into a general recipe, a theorem stating that any certificate of this shape is valid whenever a simple sum-of-squares condition holds on its two pieces. Alongside this it lays out, level by level, how the framework stays consistent, from the requirement that probabilities behave, through the quantum measurement rule, to the classical fixed-point picture in which a would-be paradoxical loop has, or fails to have, a unique consistent resolution. Every numbered result is also formally verified in a machine proof assistant, to the authors' knowledge the first such verification for this framework, with the correspondence to the formal statements collected in an appendix. The value of the paper is to turn what had been the output of an opaque numerical optimizer into a transparent, reusable, and independently machine-checked object that anyone can audit and build on. By exhibiting an exact certificate and a general recipe for producing more, it lowers the barrier to certifying indefinite causal order, and by verifying the whole consistency core in a proof assistant it supplies a dependable formal foundation for later work. The paper is modest about what it adds, presenting the physics of the canonical process as already known and offering instead an exact and verifiable rendering of it.
Two structural facts anchor the theory of indefinite causal order, and this paper proves both as explicit theorems and checks them line by line in a machine proof assistant. The first is a record fact: a process without a definite order must keep, on its control memory, a record of the orders it superposes, and erasing that record by blurring the control returns a plain mixture of definite orders. The second is a classification fact: on the canonical slice of processes, a single straight-line certificate decides exactly which processes are ordered and which are not. Working over an abstract algebra of order operators, so that each result holds in any faithful concrete model, the paper proves a short, connected set of statements. Blurring the order record always lands the process in the definite-order set, which is the mathematical heart of record-erasure. A process sits in that definite-order set exactly when it is unchanged by blurring, so that any surviving control coherence is an irreducible record. The number of orders a process populates is at most the size of its control memory, which is the record form of the memory cost studied elsewhere in the program. On the canonical slice the certificate takes a specific value that varies in a straight-line way across the slice, so that indefiniteness holds precisely on one side of a line, with an explicit decomposition into definite orders on the other side. And a tempting finer diagnostic built from the process's intrinsic flow is shown to over-count, because it tracks a product of the two dials rather than the true boundary. Every theorem is stated over an abstract ring so that it transfers to any faithful model, and every statement in the paper has been checked in a machine proof assistant with no assumptions beyond the three standard foundations of mathematics; the correspondence to the formal development is tabulated in an appendix. The contribution is a small, dependable, reusable core that turns the program's paper-level results about indefinite causal order into a durable, independently checkable formal library, and by forcing complete rigour it guards against hidden gaps of the kind that informal arguments can conceal. The paper is careful about scope, noting that the definite-order set reached by full blurring is contained in, but does not exhaust, the whole ordered set, and that the finer flow-based diagnostic is only a necessary sign of indefiniteness, not a sufficient one. What it secures is a machine-checked foundation on which the geometric, thermodynamic, and resource-theoretic parts of the program can safely rest.
This paper is the thirty-fourth in a sequence developing an interpretive framework that redescribes physical reality as a causally consistent history of information updates rather than as a collection of independently existing objects. It is the capstone (third panel) of the ninth grouping — the quantum-mechanics–gravity interface trilogy (32 Quantum Geometry → 33 Records Backreacting on Geometry → 34 Causal Structure Without a Global Order) — and closes that trilogy. Its core physics is the process-matrix framework (Oreshkov, Costa, & Brukner, 2012), with the quantum switch (Chiribella et al., 2013) as the worked instance and causal (non)separability as the central classification. When the order of operations is quantum-controlled — and, at the interface, when geometry is superposed so different branches carry different causal graphs — the temptation is to posit a hidden definite global total order behind the indefiniteness. The thesis is that there is no Global Causal Sequencer; P1 is a declared architectural commitment, not a theorem, and a rival that posits a deeper definite order underwriting the indefiniteness is acknowledged but declined architecturally. R-A: indefinite operational order is not causal inconsistency or a closed loop — a coherent superposition of order components is causally nonseparable (witness-certifiable; note that witness-based nonseparability and causal-inequality violation are not equivalent, and the quantum switch need not violate a causal inequality) yet a valid, consistent process. R-B (restricted to controlled-order processes such as the quantum switch, or any process with a declared physically recorded order-control observable): recording the order-control does not by itself produce a determinate order — one must distinguish the coherent control, the decohered-but-unconditioned causally separable mixture, and the conditioned record-relative effective order — only the last is determinate, and only relative to a recorded value and the declared parameter chi, whose order-control basis is an admissible decoherence-stable pointer basis/algebra (not an arbitrary rotation). R-C: causal structure is profile-valued, CausalProf = (d_order, d_interv, d_record, d_valid, d_family, d_arrow), with a process-validity (not graph-acyclicity) component and an independent record-arrow component from Paper 9's arrow package. R-D (the novelty witness): effective order is provenance-gradable — a matched pair of histories with identical audited world-side order records but different provenance yields different warranted standing (OrderStandProf). R-E: a conservative-before-radical discipline works indefinite operational order first, then a minimal superposed-causal-graph bridge on Paper 32's identity fibers, separating an identity disposition from an order disposition; full quantization of the causal relation is flagged, not claimed. This retires the Global Causal Sequencer and closes the interface trilogy; no causal loops, no retrocausal signaling, no revived global order, no quantum-gravity completion. Presents no new physics; results are interpretive (L2) on imported physics (L1).
Indefinite causal order acquires a clean geometric home in this paper. The processes allowed by the theory fill one convex body, the kind of region carved out by a matrix inequality, while the processes with a definite order fill that body's shadow, the flatter silhouette cast when the body is projected down. A process is genuinely indefinite precisely when it lands in the gap between the body and its own shadow. This single picture explains at a glance why detecting indefinite order requires a certificate: a shadow can be strictly smaller than the object that casts it. The paper shows that the valid processes are exactly the positive part of a structured operator system of a definite size, which is the technical meaning of the convex body in question, and that the ordered processes are the shadow of the combination of the two definite-order regions. Indefinite order lives in the gap between the two, and that gap is exactly what the separating certificates detect. The paper then reads each process through an intrinsic notion of flow that the process itself defines, a kind of built-in clock, and finds that for the canonical indefinite process this flow is order-entangled, its two order-halves refusing to commute, whereas for definite orders the flow simply respects the order. It is careful to show that this flow-based diagnostic over-counts: it also flags some ordered processes, so it is a weaker signal than the exact certificate boundary. On the two-dial canonical slice the paper gives an exact classification, with a circular region of validity, a straight-line boundary of separability, and a lens-shaped region of genuine indefiniteness in between. The contribution is a way of seeing why indefinite causal order behaves as it does: it is the discrepancy between a body and its shadow, which is exactly why a witness, a supporting plane of the shadow, is needed to certify it. The flow-based reading adds an intrinsic, clock-like description of order-entanglement, while the paper honestly flags that this finer description is only a necessary sign and not a sufficient one, since it over-counts. By recasting causal nonseparability in the language of operator systems and their shadows, the paper connects a foundational quantum property to well-developed convex geometry and sets up the multipartite and thermodynamic sequels.
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.
The fundamental nature of causality has been challenged by quantum theory. In particular, recent developments have shown that by relaxing the standard assumption that quantum events are embedded in a fixed background causal structure, a new kind of causal relations, indefinite, can emerge. These indefinite causal structures have been interpreted as causal loops allowing for the violation of a form of causality without paradoxes. On the other hand, quantum contextuality shows that any attempt to extend quantum theory such that classical logic holds in the extended domain fails due to the rise of inconsistent logical loops. There has been increasing evidence that it is a key feature in the understanding quantum paradoxes. This thesis aims at improving our understanding of indefinite causal orders and quantum paradoxes in order to address the question: “Could the non-fundamental nature of causality be related to a form of contextuality ?”The process matrix formalism is a mathematical framework which, in analogy withentanglement and the violation of Bell inequalities (nonlocality), offers new tools - witnesses of causal nonseparability and the violation of causal inequalities with noncausalcorrelations - to study and identify indefinite causal orders. In a bottom-up approach, wehave identified a large class of physically implementable processes, the quantum circuitswith quantum control of causal order (QC-QCs), that includes causally nonseparable processes such as the celebrated “quantum switch”. However these circuits cannot be used to violate causal inequalities. Nevertheless, in another work, I have proposed a significant relaxation of assumptions to certify the causal nonseparability of many processes, showing that it can be done in a semi-device-independent scenario with untrusted local operations and trusted quantum inputs. In particular, I have shown that the quantum switch can generate noncausal correlations in this kind of scenario.In order to refine my understanding of quantum contextuality, I have investigated theorigins of the Kochen-Specker theorem and I have analysed how the Hardy paradox entails a form of logical contextuality. I have identified that the two possible intermediatemeasurements involved in a pre-post-selection version of the paradox differ causally fromeach other. This analysis might be useful to study of the Frauchiger-Renner paradox, a“meta-version” of the Hardy paradox. On a more metaphysical aspect, I have argued fora “Gödelian hunch” from quantum theory, the idea that quantum paradoxes emerge froma lack of distinction between theoretical and metatheoretical objects.Finally, in order to establish a link between indefinite causal orders and contextuality,I have proposed a new causal game, in which the grandfather paradox is formalized interms of a logical inequality. Some process matrices can violate the causal inequalitywithout violating the logical one. I suggest that the emergence of logical inconsistenciesfrom the violation of a logical inequality might be interpreted as a form of contextuality.
Quantum theory allows processes in which the order of two operations is not fixed but held in superposition, and this indefiniteness of order behaves like a resource, something a process can have more or less of and that cannot be created for free. The question a resource theory answers last is whether the resource can be spent and fully recovered without loss, and whether there is a stubborn form of it that is present yet useless. This paper answers both questions for the simplest family of such processes. Handled one copy at a time, indefinite order is wasteful and cannot be recovered, with a single special exception; but handled in bulk, many copies together, it becomes perfectly recyclable, and no useless-but-present form exists. The paper works on a two-dial family of processes that runs from a plainly ordered process to the most order-indefinite one. It first computes exact measures of how much indefiniteness each member carries, defined by how much ordinary noise must be stirred in to wash the indefiniteness out, and from these reads off the one-time price of manufacturing the resource. It then shows the whole family behaves like a single effective quantum bit whose ordered, well-behaved region is a diamond-shaped set, which makes the recoverable content exactly calculable. The central finding is a sharp split: for every indefinite process except one special pure case, the price to make it is strictly more than what can ever be recovered from it, so one copy at a time the resource is irreversibly wasteful; the lone pure case is the unique point where price and yield coincide. Placing the theory inside the standard framework for reversible resources, and checking that the ordered set is convex, stays ordered when copies are combined, and contains the most featureless process, the paper proves that in the many-copy limit the resource turns reversible, its bulk cost matching its bulk yield, with no stubborn leftover form. The recyclable rate of the special unit is a definite number of bits. The wider message is that indefinite causal order sits alongside the other familiar quantum resources, such as entanglement: it is wasteful to spend one unit at a time yet efficient to trade in bulk, and it harbours no locked-away useless form. The paper is candid about the boundary of the claim, noting that the clean reversibility holds under the most permissive allowed operations, and that under more restricted, physically grounded operations the resource might instead behave irreversibly, a question left open. What it settles firmly is the surprising two-faced character of the resource, irreversible in the small and reversible in the large, on a family simple enough to compute everything exactly.