English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Compact closed categories provide a foundational formalism for a variety ofimportant domains, including quantum computation. These categories have anatural visualisation as a form of graphs. We present a formalism forequational reasoning about such graphs and develop this into a generic proofsystem with a fixed logical kernel for equational reasoning about compactclosed categories. Automating this reasoning process is motivated by the slowand error prone nature of manual graph manipulation. A salient feature of oursystem is that it provides a formal and declarative account of derived resultsthat can include `ellipses'-style notation. We illustrate the framework byinstantiating it for a graphical language of quantum computation and show howthis can be used to perform symbolic computation.

Graphical Reasoning in Compact Closed Categories for Quantum Computation