Generalised Proof-Nets for Compact Categories with Biproducts

@article{Duncan2009GeneralisedPF,
  title={Generalised Proof-Nets for Compact Categories with Biproducts},
  author={Ross Duncan},
  journal={ArXiv},
  year={2009},
  volume={abs/0903.5154}
}
  • Ross Duncan
  • Published 2009
  • Mathematics, Computer Science
  • ArXiv
  • Just as conventional functional programs may be understood as proofs in an intuitionistic logic, so quantum processes can also be viewed as proofs in a suitable logic. We describe such a logic, the logic of compact closed categories and biproducts, presented both as a sequent calculus and as a system of proof-nets. This logic captures much of the necessary structure needed to represent quantum processes under classical control, while remaining agnostic to the fine details. We demonstrate how to… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Combinatorial arguments for linear logic full completeness
    1
    On Multiplicative Linear Logic, Modality and Quantum Circuits
    6
    Algorithmic Bioprocesses
    58

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 92 REFERENCES
    PROOF-NETS : THE PARALLEL SYNTAX FOR PROOF-THEORY
    194
    Deductive systems and categories
    133
    Natural deduction and coherence for weakly distributive categories
    137
    Traced Monoidal Categories
    133
    A categorical quantum logic
    82