Jump to ContentJump to Main Navigation
Categories for Quantum TheoryAn Introduction$
Users without a subscription are not able to see the full content.

Chris Heunen and Jamie Vicary

Print publication date: 2019

Print ISBN-13: 9780198739623

Published to Oxford Scholarship Online: January 2020

DOI: 10.1093/oso/9780198739623.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2020. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 05 June 2020

Monoids and Comonoids

Monoids and Comonoids

Chapter:
(p.127) 4 Monoids and Comonoids
Source:
Categories for Quantum Theory
Author(s):

Chris Heunen

Jamie Vicary

Publisher:
Oxford University Press
DOI:10.1093/oso/9780198739623.003.0004

The tensor product of a monoidal category allows us to consider multiplications on its objects, leading to an abstract notion of monoid. This chapter investigates monoids and their relation to dual objects, as well as comonoids, which axiomatize copying and deleting operations. These play a major role in the categorical description of classical information, since classical information can be copied and deleted, while quantum information cannot. We prove categorical no-deleting and no-cloning theorems, showing that if these structures are able to copy and delete every state of the system, then the category collapses. We also characterize when a tensor product is a categorical product.

Keywords:   Monoid, Comonoid, Uniform deleting, Uniform copying, Categorical product

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .