# 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} }

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

#### Citations

##### Publications citing this paper.

SHOWING 1-5 OF 5 CITATIONS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 66 REFERENCES

## PROOF-NETS : THE PARALLEL SYNTAX FOR PROOF-THEORY

VIEW 1 EXCERPT

## Traced Monoidal Categories

VIEW 1 EXCERPT