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 (https://doi.org/10.4204/EPTCS.266.10)
Preview |
Text.
Filename: Garvie_Duncan_EPTCS_2017_Verifying_the_smallest_interesting_colour_code_with_quantomatic.pdf
Final Published Version License: 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.
ORCID iDs
Garvie, Liam and Duncan, Ross ORCID: https://orcid.org/0000-0001-6758-1573;-
-
Item type: Article ID code: 64967 Dates: DateEvent27 February 2018Published29 May 2017AcceptedSubjects: 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: 11 Nov 2024 12:04 Related URLs: URI: https://strathprints.strath.ac.uk/id/eprint/64967
CORE (COnnecting REpositories)