Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
projects:quantum:categorical [2025/04/30 09:01] – [Categories: The Foundational Structure] kymki | projects:quantum:categorical [2025/05/01 21:23] (current) – [Shim - a Rust library for categorical quantum computing] kymki | ||
---|---|---|---|
Line 48: | Line 48: | ||
===== Reader Guidance | ===== Reader Guidance | ||
- | This entry is a an overview of the code examples (shorter bits of demonstrative code that use the Shim library) that I have implemented. It is technical. It is assumed that this is perhaps not the first time the reader has heard of category theory. The reading will benefit greatly from basic prior knowledge of concepts like monads, functors (ofc how can we otherwise grok monads), categories. Basic knowledge of quantum computing is needed but I set the level of the text to not assume deep prior expertise. | + | This entry is a an overview of the code examples (shorter bits of demonstrative code that use the [[https:// |
What im hoping is that for someone active in category theory research, ML, or quantum computing can read this post and understand why I started writing Shim and see its value as a research tool. Please do contact me should you find this interesting and if any inaccuracies (I know quite a few in the code already) exist. Im happy to collaborate and discuss. | What im hoping is that for someone active in category theory research, ML, or quantum computing can read this post and understand why I started writing Shim and see its value as a research tool. Please do contact me should you find this interesting and if any inaccuracies (I know quite a few in the code already) exist. Im happy to collaborate and discuss. | ||
Line 55: | Line 55: | ||
===== Shim - a Rust library for categorical quantum computing ===== | ===== Shim - a Rust library for categorical quantum computing ===== | ||
- | Shim is a Rust library that provides a mathematical foundation for quantum machine learning using category theory. It aims to describe quantum computation and machine learning through categorical structures, enabling composition of quantum operations and data transformations. | + | Shim is a Rust library |
In the repo there are three larger illustrative examples that showcase its usage. This is just a highlight of some of the categorical concepts used in Shim. For a full read, clone the git repo and run the examples that come with extensive documentation. | In the repo there are three larger illustrative examples that showcase its usage. This is just a highlight of some of the categorical concepts used in Shim. For a full read, clone the git repo and run the examples that come with extensive documentation. | ||
Line 226: | Line 226: | ||
* **Associativity Law**: For morphisms f, g, h, we have (h ∘ g) ∘ f = h ∘ (g ∘ f) | * **Associativity Law**: For morphisms f, g, h, we have (h ∘ g) ∘ f = h ∘ (g ∘ f) | ||
- | These properties ensure that quantum operations can be composed reliably, with the identity operation (doing nothing) behaving as expected and sequential operations grouping consistently regardless of evaluation order. | + | These more " |
==== Monoidal Categories: Modeling Multi-Qubit Systems ==== | ==== Monoidal Categories: Modeling Multi-Qubit Systems ==== | ||
Line 318: | Line 318: | ||
The categorical verification in Shim offers several practical benefits for quantum programming: | The categorical verification in Shim offers several practical benefits for quantum programming: | ||
- | * **Error Detection**: | + | * **Error Detection**: |
- | * **Correctness | + | * **Correctness**: |
* **Compositional Reasoning**: | * **Compositional Reasoning**: | ||
* **Protocol Verification**: | * **Protocol Verification**: | ||
Line 335: | Line 335: | ||
</ | </ | ||
- | This diagnostic capability | + | This helps quantum algorithm developers identify and fix structural issues in their implementations |
==== Integration with Quantum Neural Networks ==== | ==== Integration with Quantum Neural Networks ==== | ||
Line 341: | Line 341: | ||
The categorical verification framework complements the quantum neural network architecture we explored earlier. While QNNs rely on adjunctions and 2-morphisms, | The categorical verification framework complements the quantum neural network architecture we explored earlier. While QNNs rely on adjunctions and 2-morphisms, | ||
- | The integration | + | The integration |
* **Verified Base Categories**: | * **Verified Base Categories**: | ||
* **Monoidal Structure**: | * **Monoidal Structure**: | ||
- | * **Verified | + | * **Functors**: |
* **Monadic Effects**: Provide formal handling of measurement in quantum learning | * **Monadic Effects**: Provide formal handling of measurement in quantum learning | ||
- | I'll continue developing the blog post with the next section, using the proper DokuWiki code block format. | + | ====== |
- | + | ||
- | ====== Practical Applications of Categorical Quantum ML: Building a Complete Pipeline ====== | + | |
==== Configurable Quantum ML Pipeline ==== | ==== Configurable Quantum ML Pipeline ==== | ||
- | This final chapter explores how Shim implements a complete quantum machine learning pipeline using categorical principles. The code provides | + | This final chapter explores how Shim implements a complete quantum machine learning pipeline using categorical principles. The code can be used as a base for experimenting with different quantum architectures |
The framework is organized into three interconnected components: | The framework is organized into three interconnected components: | ||
- | * **Dataset parameters**: | + | * **Dataset parameters**: |
- | * **Quantum model parameters**: | + | * **Quantum model parameters**: |
- | * **Circuit design parameters**: | + | * **Circuit design parameters**: |
<code rust> | <code rust> | ||
Line 386: | Line 384: | ||
} | } | ||
</ | </ | ||
- | |||
- | This parameterization allows the user to vary different components of the quantum machine learning pipeline while preserving their mathematical relationships. | ||
- | |||
==== Categorical Structure of Quantum ML ==== | ==== Categorical Structure of Quantum ML ==== | ||
- | This demo operates with four main categories: | + | Four main categories |
* **DataCategory**: | * **DataCategory**: | ||
Line 416: | Line 411: | ||
</ | </ | ||
- | The functors formalize how classical data is encoded into quantum states and how quantum measurements are decoded into predictions. This categorical structure ensures that these transformations preserve essential algebraic properties. | + | The functors formalize how classical data is encoded into quantum states and how quantum measurements are decoded into predictions. |
==== Natural Transformations for Quantum Processes ==== | ==== Natural Transformations for Quantum Processes ==== | ||
Line 565: | Line 560: | ||
</ | </ | ||
- | This verification ensures that the categorical structure is properly maintained, which is essential | + | This verification ensures that the categorical structure is properly maintained for the mathematical consistency of the quantum machine learning pipeline. |
==== Inference Pipeline and Evaluation ==== | ==== Inference Pipeline and Evaluation ==== | ||
Line 632: | Line 627: | ||
</ | </ | ||
- | This inference pipeline processes classical data through the entire quantum machine learning workflow, from data encoding to prediction, illustrating how the categorical structure enables a coherent quantum information processing workflow. | + | This inference pipeline processes classical data through the entire quantum machine learning workflow, from data encoding to prediction. |
==== End-to-End Categorical Composition ==== | ==== End-to-End Categorical Composition ==== | ||
- | The framework | + | The code further |
<code rust> | <code rust> | ||
Line 753: | Line 748: | ||
</ | </ | ||
- | This encoding strategy | + | Here, via the above encoding strategy, classical features can be systematically mapped to quantum operations, creating a well-defined interface between classical and quantum data. |
- | + | ||
- | ==== Practical Benefits of the Categorical Approach ==== | + | |
- | The implementation demonstrates several practical benefits of the categorical approach to quantum machine learning: | ||
- | * **Systematic Experimentation**: The parameterized framework enables systematic exploration | + | ===== 4. Conclusion and Outlook: The Power of Categorical |
- | * **Formal Verification**: | + | |
- | * **Compositionality**: | + | |
- | * **Abstraction**: | + | |
- | * **Scalability**: | + | |
- | ===== Conclusion and Outlook: The Power of Categorical Quantum ML ===== | + | What I wanted to demonstrate with the implementation |
- | What I wanted to demonstrate with the implementation of Shim is that that category theory provides a useful mathematical language for quantum computing with specific applications towards machine learning. | + | By formalizing quantum operations, data transformations, |
* **Mathematical Verification**: | * **Mathematical Verification**: |