July 2023

In this work, we present a generic approach to transform CSS codes by building upon their equivalence to phase-free ZX diagrams. Using the ZX calculus, we demonstrate diagrammatic transformations between encoding maps associated with different codes. As a motivating example, we give explicit transformations between the Steane code and the quantum Reed-Muller code, since by switching between these two codes, one can obtain a fault-tolerant universal gate set. To this end, we propose a bidirectional rewrite rule to find a (not necessarily transversal) physical implementation for any logical ZX diagram in any CSS code. We then focus on two code transformation techniques: $textit{code morphing}$, a procedure that transforms a code while retaining its fault-tolerant gates, and $textit{gauge fixing}$, where complimentary codes can be obtained from a common subsystem code (e.g., the Steane and the quantum Reed-Muller codes from the [[15,1,3,3]] code). We provide explicit graphical derivations for these techniques and show how ZX and graphical encoder maps relate several equivalent perspectives on these code transforming operations.

Causal inequalities are device-independent constraints on correlations realizable via local operations under the assumption of definite causal order between these operations. While causal inequalities in the bipartite scenario require nonclassical resources within the process-matrix framework for their violation, there exist tripartite causal inequalities that admit violations with classical resources. The tripartite case puts into question the status of a causal inequality violation as a witness of nonclassicality, i.e., there is no a priori reason to believe that quantum effects are in general necessary for a causal inequality violation. Here we propose a notion of classicality for correlations–termed deterministic consistency–that goes beyond causal inequalities. We refer to the failure of deterministic consistency for a correlation as its antinomicity, which serves as our notion of nonclassicality. Deterministic consistency is motivated by a careful consideration of the appropriate generalization of Bell inequalities–which serve as witnesses of nonclassicality for non-signalling correlations–to the case of correlations without any non-signalling constraints. This naturally leads us to the classical deterministic limit of the process matrix framework as the appropriate analogue of a local hidden variable model. We then define a hierarchy of sets of correlations–from the classical to the most nonclassical–and prove strict inclusions between them. We also propose a measure for the antinomicity of correlations–termed ‘robustness of antinomy’–and apply our framework in bipartite and tripartite scenarios. A key contribution of this work is an explicit nonclassicality witness that goes beyond causal inequalities, inspired by a modification of the Guess Your Neighbour’s Input (GYNI) game that we term the Guess Your Neighbour’s Input or NOT (GYNIN) game.