Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

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

Abstract

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 of finite memory computations. In order to handle cases like the ZX-calculus, which is complete for post-selected quantum mechanics, we extend the delayed trace formalism beyond the causal case, refining the notion of causality for stream transformers. We design a stream semantics based on stateful morphism sequences and, under some assumptions, show universality and completeness results. Finally, we investigate the links of our framework with previous works on cartesian data types, signal flow graphs, and quantum channels with memories.

Dates and versions

hal-03153305 , version 1 (26-02-2021)

Identifiers

Cite

Titouan Carette, Marc de Visme, Simon Perdrix. Graphical Language with Delayed Trace: Picturing Quantum Computing with Finite Memory. LICS 2021 - 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2021, Rome, Italy. ⟨hal-03153305⟩
108 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More