Loading...
A category theoretic bridge from classical error correction to quantum error correction
Stuart, Meghan
Stuart, Meghan
Citations
Altmetric:
Journal Title
Readers/Advisors
Glass, Cheyne, Sullivan, Patricia
Journal Title
Term and Year
Publication Date
2025-01
Type
Book Title
Publication Volume
Publication Issue
Publication Begin
Publication End
Number of pages
Files
Loading...
Stuart_Honors.pdf
Adobe PDF, 1.28 MB
Research Projects
Organizational Units
Journal Issue
Abstract
Both the category Set of sets and functions as well as the category EVect of Euclidean vector spaces and their linear maps form monoidal categories under the Cartesian product and the tensor product, respectively. We categorically model classical computing within a full monoidal subcategory of Set, and similarly quantum computing within a full monoidal subcategory of EVect. The free functor offers a map expressing how all classical computing
algorithms can be functorially mapped to a corresponding quantum algorithm. Error correction codes are included in this model using natural transformations and shown by examples, i.e Hamming codes and Toric codes, to maintain the objects and morphisms of
their respective categories.
Keywords: mathematics, math, computer science, linear algebra, Deustch-Josza algorithm, Toric codes, Hamming codes, Three-Bit Repetition code, Three-Qubit Repetition code, category theory, quan-tum computing, classical computing, error correction, classical error correction, quantum error correction, free functor, monoidal category, category
Citation
DOI
Description
Accessibility Statement
If this SOAR repository item is not accessible to you (e.g. able to be used in the context of a disability), please email libraryaccessibility@newpaltz.edu