Optimising Clifford Circuits with Quantomatic

01/29/2019
by   Andrew Fagan, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2022

LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits

We introduce the LOv-calculus, a graphical language for reasoning about ...
research
02/08/2019

Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus

We present a new circuit-to-circuit optimisation routine based on an equ...
research
04/05/2008

The equations of the ideal latches

The latches are simple circuits with feedback from the digital electrica...
research
09/05/2023

Explaining grokking through circuit efficiency

One of the most surprising puzzles in neural network generalisation is g...
research
06/30/2016

SurfCuit: Surface Mounted Circuits on 3D Prints

We present, SurfCuit, a novel approach to design and construction of ele...
research
03/08/2023

Descriptive complexity for distributed computing with circuits

We consider distributed algorithms in the realistic scenario where distr...
research
10/14/2021

zk-Fabric, a Polylithic Syntax Zero Knowledge Joint Proof System

In this paper, we create a single-use and full syntax zero-knowledge pro...

Please sign up or login with your details

Forgot password? Click here to reset