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

Carette, Titouan; Visme, Marc de; Perdrix, Simon

doi:10.1109/lics52264.2021.9470553

Search citation statements

Order By: Relevance

Paper Sections

Select...

String Diagrams In Science and Engineering: Some Applications1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

2024

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A comprehensive survey of the ZXcalculus (and its cousins) for the working computer scientist can be found in [105]. Beyond these, there is a wealth of recent developments that have taken the original work in different directions: a calculus which incorporates finite memory elements to the ZX-calculus [29], several calculi for quantum linear optical circuits [41,31], and more... There are also automated tools to reason about large-scale ZX diagrams: the python library PyZX which we have already mentioned is the most recent [80].…”

Section: String Diagrams In Science and Engineering: Some Applicationsmentioning

confidence: 99%

A Finite Axiomatisation of Finite-State Automata Using String Diagrams

Piedeleu

Zanasi

2023

Logical Methods in Computer Science

View full text Add to dashboard Cite

We develop a fully diagrammatic approach to finite-state automata, based on reinterpreting their usual state-transition graphical representation as a two-dimensional syntax of string diagrams. In this setting, we are able to provide a complete equational theory for language equivalence, with two notable features. First, the proposed axiomatisation is finite. Second, the Kleene star is a derived concept, as it can be decomposed into more primitive algebraic blocks.

show abstract

Section: String Diagrams In Science and Engineering: Some Applicationsmentioning

confidence: 99%