Verifying the Steane code with Quantomatic
In this paper we give a partially mechanized proof of the correctness of Steane's 7-qubit error correcting code, using the tool Quantomatic. To the best of our knowledge, this represents the largest and most complicated verification task yet carried out using Quantomatic.
Main Authors: | Ross Duncan, Maxime Lucas |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-12-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1306.4532v2 |
Similar Items
-
Verifying the Smallest Interesting Colour Code with Quantomatic
by: Liam Garvie, et al.
Published: (2018-02-01) -
Optimising Clifford Circuits with Quantomatic
by: Andrew Fagan, et al.
Published: (2019-01-01) -
STEANE CODE ANALYSIS BY RANDOMIZED BENCHMARKING
by: de Lima Marquezino, F., et al.
Published: (2023) -
Gate-Error-Resilient Quantum Steane Codes
by: Rosie Cane, et al.
Published: (2020-01-01) -
Semiclassical grounds of the Calderbank-Shor-Steane quantum error correction codes
by: Manuel Avila Aoki
Published: (2009-10-01)