Axiomatic description of mixed states from selinger's CPM-construction
<p>We recast Selinger's CPM-construction of mixed states completely positive maps [P. Selinger (2007) <em>Dagger compact closed categories and completely positive maps</em>. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electron...
Main Author: | |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2008
|
Subjects: |
_version_ | 1797100946109497344 |
---|---|
author | Coecke, B |
author_facet | Coecke, B |
author_sort | Coecke, B |
collection | OXFORD |
description | <p>We recast Selinger's CPM-construction of mixed states completely positive maps [P. Selinger (2007) <em>Dagger compact closed categories and completely positive maps</em>. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science <strong>170</strong>, 139–163. Available from Peter Selinger&apos;s homepage] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of completely positive maps to satisfy the preparation-state agreement axiom of [Coecke, B. (2007) <em>De-linearizing linearity: projective quantum axiomatics from strong compact closure</em>. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science <strong>170</strong>, 49–72. E-print: <a href="arXiv:quant-ph/0506134">arXiv:quant-ph/0506134</a></p> |
first_indexed | 2024-03-07T05:44:56Z |
format | Journal article |
id | oxford-uuid:e6e96b18-ff8b-4582-a35a-d984e6a073e1 |
institution | University of Oxford |
language | English |
last_indexed | 2024-03-07T05:44:56Z |
publishDate | 2008 |
record_format | dspace |
spelling | oxford-uuid:e6e96b18-ff8b-4582-a35a-d984e6a073e12022-03-27T10:34:30ZAxiomatic description of mixed states from selinger's CPM-constructionJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:e6e96b18-ff8b-4582-a35a-d984e6a073e1ComputingComputer science (mathematics)EnglishOxford University Research Archive - Valet2008Coecke, B<p>We recast Selinger's CPM-construction of mixed states completely positive maps [P. Selinger (2007) <em>Dagger compact closed categories and completely positive maps</em>. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science <strong>170</strong>, 139–163. Available from Peter Selinger&apos;s homepage] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of completely positive maps to satisfy the preparation-state agreement axiom of [Coecke, B. (2007) <em>De-linearizing linearity: projective quantum axiomatics from strong compact closure</em>. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (QPL 2005), Electronic Notes in Theoretical Computer Science <strong>170</strong>, 49–72. E-print: <a href="arXiv:quant-ph/0506134">arXiv:quant-ph/0506134</a></p> |
spellingShingle | Computing Computer science (mathematics) Coecke, B Axiomatic description of mixed states from selinger's CPM-construction |
title | Axiomatic description of mixed states from selinger's CPM-construction |
title_full | Axiomatic description of mixed states from selinger's CPM-construction |
title_fullStr | Axiomatic description of mixed states from selinger's CPM-construction |
title_full_unstemmed | Axiomatic description of mixed states from selinger's CPM-construction |
title_short | Axiomatic description of mixed states from selinger's CPM-construction |
title_sort | axiomatic description of mixed states from selinger s cpm construction |
topic | Computing Computer science (mathematics) |
work_keys_str_mv | AT coeckeb axiomaticdescriptionofmixedstatesfromselingerscpmconstruction |