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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

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...
04/05/2008

The equations of the ideal latches

The latches are simple circuits with feedback from the digital electrica...
08/11/2021

An Energy-based, always Index ≤1 and Structurally Amenable Electrical Circuit Model

Combining three themes: port-Hamiltonian energy-based modelling, structu...
06/30/2016

SurfCuit: Surface Mounted Circuits on 3D Prints

We present, SurfCuit, a novel approach to design and construction of ele...
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...
06/15/2020

The PSPACE-hardness of understanding neural circuits

In neuroscience, an important aspect of understanding the function of a ...
06/05/2015

Limitations of PLL simulation: hidden oscillations in MatLab and SPICE

Nonlinear analysis of the phase-locked loop (PLL) based circuits is a ch...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.