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

Rig groupoids provide a semantic model of \PiLang, a universal classicalreversible programming language over finite types. We prove that extending riggroupoids with just two maps and three equations about them results in a modelof quantum computing that is computationally universal and equationally soundand complete for a variety of gate sets. The first map corresponds to an$8^{\text{th}}$ root of the identity morphism on the unit $1$. The second mapcorresponds to a square root of the symmetry on $1+1$. As square roots aregenerally not unique and can sometimes even be trivial, the maps areconstrained to satisfy a nondegeneracy axiom, which we relate to the Eulerdecomposition of the Hadamard gate. The semantic construction is turned into anextension of \PiLang, called \SPiLang, that is a computationally universalquantum programming language equipped with an equational theory that is soundand complete with respect to the Clifford gate set, the standard gate set ofClifford+T restricted to $\le 2$ qubits, and the computationally universalGaussian Clifford+T gate set.

With a Few Square Roots, Quantum Computing is as Easy as {\Pi}