Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory

  title={Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory},
  author={Titouan Carette and Marc de Visme and Simon Perdrix},
  journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
Graphical languages, like quantum circuits or ZX-calculus, have been successfully designed to represent (memoryless) quantum computations acting on a finite number of qubits. Meanwhile, delayed traces have been used as a graphical way to represent finite-memory computations on streams, in a classical setting (cartesian data types). We merge those two approaches and describe a general construction that extends any graphical language, equipped with a notion of discarding, to a graphical language… 

Figures from this paper

Monoidal Streams for Dataflow Programming
Monoidal streams are introduced: a generalization of causal stream functions to monoidal categories that have a feedback structure that gives semantics to signal flow graphs and study a stochastic dataflow language.
Causality in higher order process theories
This work provides an equivalent construction of the HOPT framework from four simple axioms of process-theoretic nature, which is used to establish connections between foundational features such as causality, determinism, and signalling, and to explore their interaction with the mathematical structure of ∗-autonomy.


Completeness of Graphical Languages for Mixed States Quantum Mechanics
A new construction, the discard construction, is introduced, which transforms any †-symmetric monoidal category into a symmetric Monoidal category equipped with a discard map, which provides an extension for several graphical languages that are proved to be complete for general quantum operations.
Quantum channels with memory
A general model for quantum channels with memory is presented and it is shown that it is sufficiently general to encompass all causal automata: any quantum process in which outputs up to some time do not depend on inputs at times can be decomposed into a concatenated memory channel.
SZX-Calculus: Scalable Graphical Quantum Reasoning
The Scalable ZX-calculus is introduced, a formal and compact graphical language for the design and verification of quantum computations and two examples of applications are provided, for graph states and error correcting codes.
Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
A simplification strategy for ZX-diagrams is given based on the two graph transformations of local complementation and pivoting and it is shown that the resulting reduced diagram can be transformed back into a quantum circuit.
Two complete axiomatisations of pure-state qubit quantum computing
Extended versions of ZW and ZX calculus are presented, and their completeness for pure-state qubit theory is proved by a strategy that rewrites all diagrams into a normal form, thus solving two major open problems in categorical quantum mechanics.
Reversible quantum cellular automata
The main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme.
Diagrammatic Semantics for Digital Circuits
The main achievement of the paper is conceptual, filling a foundational gap in reasoning syntactically and symbolically about a large class of digital circuits, and producing a general yet simple graph-rewrite framework for reasoning about such categories in which the rewrite rules are computationally efficient.
Reducing the number of non-Clifford gates in quantum circuits
We present a method for reducing the number of non-Clifford quantum gates, in particularly T-gates, in a circuit, an important task for efficiently implementing fault-tolerant quantum computations.
The ZX−calculus is complete for stabilizer quantum mechanics
The ZX-calculus is a graphical calculus for reasoning about quantum systems and processes. It is known to be universal for pure state qubit quantum mechanics (QM), meaning any pure state, unitary
The ZX calculus is a language for surface code lattice surgery
The operations of the ZX calculus -- a form of quantum diagrammatic reasoning based on bialgebras -- match exactly the operations of lattice surgery, and ZX diagram re-write rules give lattice operations for these operations that are novel, efficient, and highly configurable.