Crate quizx 

PyZX is a Python library for quantum circuit optimisation and compiling using the ZX-calculus. It’s great for hacking, learning, and trying things out in Jupyter notebooks. However, it’s written to maximise clarity and fun, not performance.

This is a port of some of the core functionality of PyZX to the Rust programming language. This is a modern systems programming language, which enables writing software that is very fast and memory efficient.

Check the Rust Changelog for the latest updates.

A bit about performance

As a very anecdotal example of the performance difference, the program spider_chain builds a chain of 1 million green spiders and fuses them all. In PyZX, you can fuse all the spiders in a ZX-diagram as follows:

from pyzx.basicrules import *

success = True
while success:
    success = any(fuse(g, g.edge_s(e), g.edge_t(e)) for e in g.edges())

In QuiZX, the Rust code is slightly more verbose, but similar in spirit:

use quizx::basic_rules::*;

let mut g = Graph::new();
let v0 = g.add_vertex(VType::Z);
let v1 = g.add_vertex(VType::Z);
let v2 = g.add_vertex(VType::X);
g.add_edge(v0, v1);
g.add_edge(v1, v2);

loop {
    match g.find_edge(|v0,v1,_| check_spider_fusion(&g, v0, v1)) {
        Some((v0,v1,_)) => spider_fusion_unchecked(&mut g, v0, v1),
        None => break,
    };
}

On my laptop, the PyZX code takes about 98 seconds to fuse 1 million spiders, whereas the QuiZX code takes 17 milliseconds.

Modules

annealer

basic_rules

Basic ZX-calculus rules

circuit

cli

The QuiZX command line interface.

decompose

detection_webs

equality

extract

fscalar

gate

generate

graph

graph_loader

graph_to_svg

hash_graph

json

Json encoding for interoperability with pyzx and zxlang using the .qgraph format.

linalg

Matrices and linear algebra over F2

optimize_circuit

params

phase

Phase encoded as either rational or floating point number of half-turns.

random_graph

scalar_traits

simplify

tensor

util

vec_graph