Graphix is a measurement-based quantum computing (MBQC) compiler, which makes it easier to generate, optimize and simulate MBQC measurement patterns.
- We integrate an efficient graph state simulator as an optimization routine of MBQC measurement pattern, with which we can classically preprocess all Pauli measurements (corresponding to the elimination of all Clifford gates in the gate network - c.f. Gottesman-Knill theorem), significantly reducing the required size of graph state to run the computation.
- We implement tensor-network simulation of MBQC with which thousands of qubits (graph nodes) can be simulated with modest computing resources (e.g. laptop), without approximation.
- Our pattern-based construction and optimization routines are suitable for high-level optimization to run quantum algorithms on MBQC quantum hardware with minimal resource state size requirements. We plan to add quantum hardware emulators (and quantum hardware) as pattern execution backends.
Install graphix with pip:
$ pip install graphix-
We have a few demos showing basic usages of
Graphix. -
You can run demos on your browser:
- Preprocessing Clifford gates:
- Using tensor-network simulator backend:
- QAOA circuit:
- Preprocessing Clifford gates:
-
Read the tutorial for more comprehensive guide.
-
For theoretical background, read our quick introduction into MBQC and LC-MBQC.
S. Sunami and M. Fukushima. "Graphix: optimizing and simulating measurement-based quantum computation on local-Clifford decorated graph", arXiv:2212.11975 (2022).
Update on the paper: 1
We use GitHub issues for tracking requests and bugs.
Please visit Unitary Fund's Discord server, where you can find a channel for graphix to ask questions.
Dr. Shinichi Sunami (University of Oxford)
Masato Fukushima (University of Tokyo, Fixstars Amplify)
We are proud to be supported by unitary fund microgrant program.
Special thanks to Fixstars Amplify:
Footnotes
-
Following the release of this arXiv preprint, we were made aware of a previous work by Backens et al. where Pauli measurement elimination method for MBQC was developed in the context of circuit optimization. Many thanks for letting us know about this work, we will properly mention this work in the next version of our paper. ↩