Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This thesis advances the mathematical foundations of quantum information by rigorously analyzing the topological and categorical structures of completely positive trace-preserving (CPTP) maps. By constructing extreme points for various ranks and dimensions, the work clarifies fundamental properties of quantum channels using advanced techniques like CW decompositions. These theoretical insights are essential for researchers developing rigorous frameworks in quantum computing and quantum communication protocols.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

On quantum channels: extreme points, topology, and categorical properties

arXiv3 min read

arXiv:2608.20689v1 Announce Type: cross Abstract: In this thesis, quantum channels are studied from the point of view of Mathematics. We studied the CPTP (completely positive trace preserving) and UCPTP channels, the latter being the unital channels. In both cases, the sets are compact convex, so they are the closure of their extreme points. We constructed extreme CPTP maps for every possible rank. We also constructed extreme UCPTP maps with rank 2 for each possible dimension. For ranks of at least 3, we constructed extreme UCPTP maps for many dimensions and ranks. We also proved that the tensor product of extreme CPTP maps is an extreme CPTP map. For UCPTP maps, we proved that the same is not always true, with many counterexamples. It is known that the category of CPTP maps is semicartesian. We add to this a classification of binary products. We proved that products only exist in trivial cases. For binary coproducts, we obtained the dimensions they should have, if they exist. In both cases, topological techniques were used. For this reason, we also investigated the topology of the closure of the set of extreme points of the CPTP maps. Topological invariants can be computed from decompositions of a space such as CW structures. These are a type of decomposition in which the space is expressed as a gluing of balls. In the search for a CW structure for the closure of the set of extreme CPTP maps, we obtained a partial decomposition that resembles a CW structure of the complex projective space.

Abstract:In this thesis, quantum channels are studied from the point of view of Mathematics. We studied the CPTP (completely positive trace preserving) and UCPTP channels, the latter being the unital channels. In both cases, the sets are compact convex, so they are the closure of their extreme points. We constructed extreme CPTP maps for every possible rank. We also constructed extreme UCPTP maps with rank 2 for each possible dimension. For ranks of at least 3, we constructed extreme UCPTP maps for many dimensions and ranks. We also proved that the tensor product of extreme CPTP maps is an extreme CPTP map. For UCPTP maps, we proved that the same is not always true, with many counterexamples. It is known that the category of CPTP maps is semicartesian. We add to this a classification of binary products. We proved that products only exist in trivial cases. For binary coproducts, we obtained the dimensions they should have, if they exist. In both cases, topological techniques were used. For this reason, we also investigated the topology of the closure of the set of extreme points of the CPTP maps. Topological invariants can be computed from decompositions of a space such as CW structures. These are a type of decomposition in which the space is expressed as a gluing of balls. In the search for a CW structure for the closure of the set of extreme CPTP maps, we obtained a partial decomposition that resembles a CW structure of the complex projective space.

arXiv:2608.20689 [math-ph]

(or arXiv:2608.20689v1 [math-ph] for this version)

https://doi.org/10.48550/arXiv.2608.20689 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 341 words

Related coverage