Verifying the Smallest Interesting Colour Code with Quantomatic

@inproceedings{Garvie2017VerifyingTS,
  title={Verifying the Smallest Interesting Colour Code with Quantomatic},
  author={Liam Garvie and Ross Duncan},
  booktitle={QPL},
  year={2017}
}
In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detecting code. 
View PDF on arXiv
22 Citations
Background Citations
5
Methods Citations
7

Figures and Tables from this paper

22 Citations

Optimising Clifford Circuits with Quantomatic

It is proved that the system always reduces Clifford circuits of one or two qubits to their minimal form, and numerical results demonstrating its performance on larger Clifford circuits are given.

Graphical Structures for Design and Verification of Quantum Error Correction

A high-level graphical framework for the design, analysis, and verification of quantum error correcting codes, and a framework in which large classes of such codes can be both analytically and numerically discovered is introduced.

Complete ZX-Calculi for the Stabiliser Fragment in Odd Prime Dimensions

A family of ZX-calculi which axiomatise the stabiliser fragment of quantum theory in odd prime dimensions are introduced, and it is proved that these calculi are complete, i.e. provide a set of rewrite rules which can be used to prove any equality of stabiliser quantum operations.

A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics

The ZX-Calculus is made complete for the so-called Clifford+T quantum mechanics by adding two new axioms to the language, and it is proved that the π/4-fragment of the ZX -Calculus represents exactly all the matrices over some finite dimensional extension of the ring of dyadic rationals.

Towards Large-scale Functional Verification of Universal Quantum Circuits

  • M. Amy
  • Computer Science, Physics
    QPL
  • 2018
A framework for the formal specification and verification of quantum circuits based on the Feynman path integral is introduced, and the algorithm is shown to give a polynomial-time decision procedure for checking the equivalence of Clifford group circuits.

A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness

It is shown that the axiomatisation for the ZX-calculus is also complete for any fragment of dyadic angles, and that a simple new rule (called cancellation) is necessary and sufficient otherwise.

Formal Methods in Quantum Circuit Design

The development of a formal model of quantum circuits with ancillary bits based on the Feynman path integral, along with a concrete verification algorithm, which doubles as a natural specification language for quantum computations.

Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics

It is shown that the axiomatisation for Clifford+T is not complete in general but can be completed by adding a single (non linear) axiom, providing a simpler axiom atisation of the ZX-calculus for pure quantum mechanics than the one recently introduced by Ng&Wang.

Fe b 20 18 Diagrammatic Reasoning beyond Clifford + T Quantum Mechanics

The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum mechanics and quantum information theory. An axiomatisation has recently been proven to be complete for an…

The ZX-Calculus is a powerful graphical language for quantum reasoning and quantum computing introduced

This work improves on the known-to-be-complete presentation for the so-called Clifford fragment of the ZX-Calculus and provides a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler.

References

SHOWING 1-10 OF 29 REFERENCES

Verifying the Steane code with Quantomatic

A partially mechanized proof of the correctness of Steane's 7-qubit error correcting code, using the tool Quantomatic, represents the largest and most complicated verification task yet carried out using Qu Phantomatic.

Coherent Parity Check Construction for Quantum Error Correction

A framework for constructing and analysing quantum error correction codes that gives simple and intuitive tools for designing codes based on device specifications and how automated reasoning allows us to perform computation between qubits in the same code-block without requiring multiple codeblocks and/or transversal gates is presented.

Graph States and the Necessity of Euler Decomposition

A new equation is introduced, for the Euler decomposition of the Hadamard gate, and it is demonstrated that Van den Nest's theorem--locally equivalent graphs represent the same entanglement--is equivalent to this new axiom.

Generalised compositional theories and diagrammatic reasoning

The use of diagrammatic calculus is illustrated in one particular case, namely the study of complementarity and non-locality, two fundamental concepts of quantum theory whose relationship is explored in later part of this chapter.

Pivoting makes the ZX-calculus complete for real stabilizers

An angle-free version of the ZX-calculus is derived and it is shown that it is complete for real stabilizer quantum mechanics and does not imply local complementation of graph states.

Quantomatic: A proof assistant for diagrammatic reasoning

This work briefly outlines the theoretical basis of Quantomatic's rewriting engine, then gives an overview of the core features and architecture and gives a simple example project that computes normal forms for commutative bialgebras.

Supplementarity is Necessary for Quantum Diagram Reasoning

It is proved that its π 4-fragment is not complete, in other words the ZX-calculus is notcomplete for the so called "Clifford+T quantum mechanics".

A Simplified Stabilizer ZX-calculus

It is proved that meta-rules like 'colour symmetry' and 'upside-down symmetry', which were considered as axioms in previous versions of the stabilizer ZX-calculus, can in fact be derived.

A software methodology for compiling quantum programs

This work presents a software architecture for compiling quantum programs from a high-level language program to hardware-specific instructions, and describes the necessary layers of abstraction and their differences and similarities to classical layers of a computer-aided design flow.

Interacting Quantum Observables

Using a general categorical formulation, it is shown that pairs of mutually unbiased quantum observables form bialgebra-like structures that enable all observables of finite dimensional Hilbert space quantum mechanics to be described.