Verifying the smallest interesting colour code with quantomatic

Garvie, Liam and Duncan, Ross (2018) Verifying the smallest interesting colour code with quantomatic. Electronic Proceedings in Theoretical Computer Science, EPTCS, 266. pp. 147-163. ISSN 2075-2180

[img]
Preview
 Text (Garvie-Duncan-EPTCS-2017-Verifying-the-smallest-interesting-colour-code-with-quantomatic)
Garvie_Duncan_EPTCS_2017_Verifying_the_smallest_interesting_colour_code_with_quantomatic.pdf
Final Published Version
License: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 logo
Download (565kB)| Preview

    Abstract

    In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detection code.

    Creators(s): Garvie, Liam and Duncan, Ross ORCID logoORCID: https://orcid.org/0000-0001-6758-1573;
    Item type:Article
    ID code:64967
    Keywords:Quantomatic case study, error detection code, error correction, Electronic computers. Computer science, Computer Science(all)
    Subjects:Science > Mathematics > Electronic computers. Computer science
    Department:Faculty of Science > Computer and Information Sciences
    Depositing user: Pure Administrator
    Date deposited:01 Aug 2018 14:30
    Last modified:21 Jan 2021 10:19
    Related URLs:
    URI:https://strathprints.strath.ac.uk/id/eprint/64967
    Export data:
    CORE (COnnecting REpositories)