30 research outputs found
Verifying the smallest interesting colour code with quantomatic
In this paper we present a Quantomatic case study, verifying the basic properties of the Smallest Interesting Colour Code error detection code
A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
We introduce the first complete and approximatively universal diagrammatic
language for quantum mechanics. We make the ZX-Calculus, a diagrammatic
language introduced by Coecke and Duncan, complete for the so-called Clifford+T
quantum mechanics by adding four new axioms to the language. The completeness
of the ZX-Calculus for Clifford+T quantum mechanics was one of the main open
questions in categorical quantum mechanics. We prove the completeness of the
Clifford+T fragment of the ZX-Calculus using the recently studied ZW-Calculus,
a calculus dealing with integer matrices. We also prove that the Clifford+T
fragment of the ZX-Calculus represents exactly all the matrices over some
finite dimensional extension of the ring of dyadic rationals
Graphical Structures for Design and Verification of Quantum Error Correction
We introduce a high-level graphical framework for designing and analysing
quantum error correcting codes, centred on what we term the coherent parity
check (CPC). The graphical formulation is based on the diagrammatic tools of
the zx-calculus of quantum observables. The resulting framework leads to a
construction for stabilizer codes that allows us to design and verify a broad
range of quantum codes based on classical ones, and that gives a means of
discovering large classes of codes using both analytical and numerical methods.
We focus in particular on the smaller codes that will be the first used by
near-term devices. We show how CSS codes form a subset of CPC codes and, more
generally, how to compute stabilizers for a CPC code. As an explicit example of
this framework, we give a method for turning almost any pair of classical
[n,k,3] codes into a [[2n - k + 2, k, 3]] CPC code. Further, we give a simple
technique for machine search which yields thousands of potential codes, and
demonstrate its operation for distance 3 and 5 codes. Finally, we use the
graphical tools to demonstrate how Clifford computation can be performed within
CPC codes. As our framework gives a new tool for constructing small- to
medium-sized codes with relatively high code rates, it provides a new source
for codes that could be suitable for emerging devices, while its zx-calculus
foundations enable natural integration of error correction with graphical
compiler toolchains. It also provides a powerful framework for reasoning about
all stabilizer quantum error correction codes of any size.Comment: Computer code associated with this paper may be found at
https://doi.org/10.15128/r1bn999672
Graphical CSS Code Transformation Using ZX Calculus
In this work, we present a generic approach to transform CSS codes by
building upon their equivalence to phase-free ZX diagrams. Using the ZX
calculus, we demonstrate diagrammatic transformations between encoding maps
associated with different codes. As a motivating example, we give explicit
transformations between the Steane code and the quantum Reed-Muller code, since
by switching between these two codes, one can obtain a fault-tolerant universal
gate set. To this end, we propose a bidirectional rewrite rule to find a (not
necessarily transversal) physical implementation for any logical ZX diagram in
any CSS code.
Then we focus on two code transformation techniques: code morphing, a
procedure that transforms a code while retaining its fault-tolerant gates, and
gauge fixing, where complimentary codes can be obtained from a common subsystem
code (e.g., the Steane and the quantum Reed-Muller codes from the [[15,1,3,3]]
code). We provide explicit graphical derivations for these techniques and show
how ZX and graphical encoder maps relate several equivalent perspectives on
these code-transforming operations.Comment: In Proceedings QPL 2023, arXiv:2308.1548
Optimising Clifford circuits with Quantomatic
We present a system of equations between Clifford circuits, all derivable in the ZX-calculus, and formalised as rewrite rules in the Quantomatic proof assistant. By combining these rules with some non-trivial simplification procedures defined in the Quantomatic tactic language, we demonstrate the use of Quantomatic as a circuit optimisation tool. We prove that the system always reduces Clifford circuits of one or two qubits to their minimal form, and give numerical results demonstrating its performance on larger Clifford circuits
Completeness of the ZX-Calculus
The ZX-Calculus is a graphical language for diagrammatic reasoning in quantum
mechanics and quantum information theory. It comes equipped with an equational
presentation. We focus here on a very important property of the language:
completeness, which roughly ensures the equational theory captures all of
quantum mechanics. We first improve on the known-to-be-complete presentation
for the so-called Clifford fragment of the language - a restriction that is not
universal - by adding some axioms. Thanks to a system of back-and-forth
translation between the ZX-Calculus and a third-party complete graphical
language, we prove that the provided axiomatisation is complete for the first
approximately universal fragment of the language, namely Clifford+T.
We then prove that the expressive power of this presentation, though aimed at
achieving completeness for the aforementioned restriction, extends beyond
Clifford+T, to a class of diagrams that we call linear with Clifford+T
constants. We use another version of the third-party language - and an adapted
system of back-and-forth translation - to complete the language for the
ZX-Calculus as a whole, that is, with no restriction. We briefly discuss the
added axioms, and finally, we provide a complete axiomatisation for an altered
version of the language which involves an additional generator, making the
presentation simpler
Completeness of Graphical Languages for Mixed States Quantum Mechanics
There exist several graphical languages for quantum information processing, like quantum circuits, ZX-Calculus, ZW-Calculus, etc. Each of these languages forms a dagger-symmetric monoidal category (dagger-SMC) and comes with an interpretation functor to the dagger-SMC of (finite dimension) Hilbert spaces. In the recent years, one of the main achievements of the categorical approach to quantum mechanics has been to provide several equational theories for most of these graphical languages, making them complete for various fragments of pure quantum mechanics.
We address the question of the extension of these languages beyond pure quantum mechanics, in order to reason on mixed states and general quantum operations, i.e. completely positive maps. Intuitively, such an extension relies on the axiomatisation of a discard map which allows one to get rid of a quantum system, operation which is not allowed in pure quantum mechanics.
We introduce a new construction, the discard construction, which transforms any dagger-symmetric monoidal category into a symmetric monoidal category equipped with a discard map. Roughly speaking this construction consists in making any isometry causal.
Using this construction we provide an extension for several graphical languages that we prove to be complete for general quantum operations. However this construction fails for some fringe cases like the Clifford+T quantum mechanics, as the category does not have enough isometries
Diagrammatic Reasoning beyond Clifford+T Quantum Mechanics
The ZX-Calculus is a graphical language for quantum mechanics. An
axiomatisation has recently been proven to be complete for an approximatively
universal fragment of quantum mechanics, the so-called Clifford+T fragment. We
focus here on the expressive power of this axiomatisation beyond Clifford+T
Quantum mechanics. We consider the full pure qubit quantum mechanics, and
mainly prove two results: (i) First, the axiomatisation for Clifford+T quantum
mechanics is also complete for all equations involving some kind of linear
diagrams. The linearity of the diagrams reflects the phase group structure, an
essential feature of the ZX-calculus. In particular all the axioms of the
ZX-calculus are involving linear diagrams. (ii) We also show 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 axiomatisation of
the ZX-calculus for pure quantum mechanics than the one recently introduced by
Ng&Wang
A Generic Normal Form for ZX-Diagrams and Application to the Rational Angle Completeness
Recent completeness results on the ZX-Calculus used a third-party language,
namely the ZW-Calculus. As a consequence, these proofs are elegant, but sadly
non-constructive. We address this issue in the following. To do so, we first
describe a generic normal form for ZX-diagrams in any fragment that contains
Clifford+T quantum mechanics. We give sufficient conditions for an
axiomatisation to be complete, and an algorithm to reach the normal form.
Finally, we apply these results to the Clifford+T fragment and the general
ZX-Calculus -- for which we already know the completeness--, but also for any
fragment of rational angles: we show that the axiomatisation for Clifford+T is
also complete for any fragment of dyadic angles, and that a simple new rule
(called cancellation) is necessary and sufficient otherwise