Quantum Theory is a Quasi-stochastic Process Theory

There is a long history of representing a quantum state using a quasi-probability distribution: a distribution allowing negative values. In this paper we extend such representations to deal with quantum channels. The result is a convex, strongly monoidal, functorial embedding of the category of trace preserving completely positive maps into the category of quasi-stochastic matrices. This establishes quantum theory as a subcategory of quasi-stochastic processes. Such an embedding is induced by a choice of minimal informationally complete POVM's. We show that any two such embeddings are naturally isomorphic. The embedding preserves the dagger structure of the categories if and only if the POVM's are symmetric, giving a new use of SIC-POVM's, objects that are of foundational interest in the QBism community. We also study general convex embeddings of quantum theory and prove a dichotomy that such an embedding is either trivial or faithful.Comment: In Proceedings QPL 2017, arXiv:1802.0973

PyZX: Large Scale Automated Diagrammatic Reasoning

The ZX-calculus is a graphical language for reasoning about ZX-diagrams, a type of tensor networks that can represent arbitrary linear maps between qubits. Using the ZX-calculus, we can intuitively reason about quantum theory, and optimise and validate quantum circuits. In this paper we introduce PyZX, an open source library for automated reasoning with large ZX-diagrams. We give a brief introduction to the ZX-calculus, then show how PyZX implements methods for circuit optimisation, equality validation, and visualisation and how it can be used in tandem with other software. We end with a set of challenges that when solved would enhance the utility of automated diagrammatic reasoning.Comment: In Proceedings QPL 2019, arXiv:2004.1475

Universal MBQC with generalised parity-phase interactions and Pauli measurements

We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form $\exp(-i\frac{\pi}{2^{n}} Z\otimes Z)$. When $n = 2$, these are equivalent, up to local Clifford unitaries, to graph states. However, when $n > 2$, their behaviour diverges in two important ways. First, multiple applications of the entangling gate to a single pair of qubits produces non-trivial entanglement, and hence multiple parallel edges between nodes play an important role in these generalised graph states. Second, such a state can be used to realise deterministic, approximately universal computation using only Pauli $Z$ and $X$ measurements and feed-forward. Even though, for $n > 2$, the relevant resource states are no longer stabiliser states, they admit a straightforward, graphical representation using the ZX-calculus. Using this representation, we are able to provide a simple, graphical proof of universality. We furthermore show that for every $n > 2$ this family is capable of producing all Clifford gates and all diagonal gates in the $n$-th level of the Clifford hierarchy.Comment: 19 pages, accepted for publication in Quantum (quantum-journal.org). A previous version of this article had the title: "Universal MBQC with M{\o}lmer-S{\o}rensen interactions and two measurement bases

Pure Maps between Euclidean Jordan Algebras

We propose a definition of purity for positive linear maps between Euclidean Jordan Algebras (EJA) that generalizes the notion of purity for quantum systems. We show that this definition of purity is closed under composition and taking adjoints and thus that the pure maps form a dagger category (which sets it apart from other possible definitions.) In fact, from the results presented in this paper, it follows that the category of EJAs with positive contractive linear maps is a dagger-effectus, a type of structure originally defined to study von Neumann algebras in an abstract categorical setting. In combination with previous work this characterizes EJAs as the most general systems allowed in a generalized probabilistic theory that is simultaneously a dagger-effectus. Using the dagger structure we get a notion of dagger-positive maps of the form f = g*g. We give a complete characterization of the pure dagger-positive maps and show that these correspond precisely to the Jordan algebraic version of the sequential product that maps (a,b) to sqrt(a) b sqrt(a). The notion of dagger-positivity therefore characterizes the sequential product.Comment: In Proceedings QPL 2018, arXiv:1901.0947

How EA-Driven Dynamic Capabilities Enable Agility: The Mediating Role of Digital Project Benefits

As the modern business environment is highly volatile and demanding, orchestrating all business and IT components and capabilities are crucial. Firms use enterprise architecture (EA) for this purpose. However, it is currently by no means clear how EA-driven firm capabilities facilitate becoming agile. When firms are agile, they can recombine digital resources to change the business practice while also coping with uncertainty and recovering rapidly from disruption through innovative digital technologies. This study embraces the dynamic capability view (DCV), develops a model, and validates the associated hypotheses using cross-sectional data from 177 firms using a Partial Least Squares approach. The outcomes show that EA-driven dynamic capabilities are a crucial antecedent of digital project benefits. In turn, these benefits positively enhance agility. The findings shed light on becoming agile, and this study providing insights and guidance on achieving the EA-driven benefits