• Corpus ID: 232417285

ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification

  title={ZX-Calculus and Extended Wolfram Model Systems II: Fast Diagrammatic Reasoning with an Application to Quantum Circuit Simplification},
  author={Jonathan Gorard and Manojna Namuduri and Xerxes D. Arsiwalla},
This article presents a novel algorithmic methodology for performing automated diagrammatic deductions over combinatorial structures, using a combination of modified equational theorem-proving techniques and the extended Wolfram model hypergraph rewriting formalism developed by the authors in previous work. We focus especially upon the application of this new algorithm to the problem of automated circuit simplification in quantum information theory, using Wolfram model multiway operator systems… 
Diagrammatic Analysis for Parameterized Quantum Circuits
Extensions of the ZX-calculus especially suitable for parameterized quantum circuits, in particular for computing observable expectation values as functions of or for parameters, which are important algorithmic quantities in a variety of applications ranging from combinatorial optimization to quantum chemistry are described.
A Superposition-Based Calculus for Diagrammatic Reasoning
A class of rooted graphs which are expressive enough to encode various kinds of classical or quantum circuits are introduced and a new Superposition calculus is proposed to check the unsatisfiability of formulas consisting of equations or disequations over these graphs.
Fast Automated Reasoning over String Diagrams using Multiway Causal Structure
We introduce an intuitive algorithmic methodology for enacting automated rewriting of string diagrams within a general double-pushout (DPO) framework, in which the sequence of rewrites is chosen in
Homotopies in Multiway (Non-Deterministic) Rewriting Systems as n-Fold Categories
It is shown that a multiway rewriting system with homotopies up to order n may naturally be formalized as an n-fold category, such that (upon inclusion of appropriate inverse morphisms via invertible rewriting relations) the infinite limit of this structure yields an∞-groupoid.
Pregeometric Spaces from Wolfram Model Rewriting Systems as Homotopy Types
This work formally relate abstract non-deterministic rewriting systems of the Wolfram model to higher homotopy spaces, and outlines how spatial structures can be functorially inherited starting from pregeometric type-theoretic constructions.
Growth Functions, Rates and Classes of String-Based Multiway Systems
It is proven that string rewriting systems, while never exceeding exponential functions in their growth, are capable of growing arbitrarily slowly, that is, slower than the asymptotic inverse of every Turing-computable function.
An Invitation to Higher Arity Science
Analytical thinking is dominated by binary ideas. From pair-wise interactions, to algebraic operations, to compositions of processes, to network models, binary structures are deeply ingrained in the
Renormalized Wolfram model exhibiting non-relativistic quantum behavior
We show a Wolfram model whose renormalization generates a sequence of approximations of a wave function having the Pauli-x matrix as Hamiltonian.