# Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus

@article{Borgna2021HybridQC, title={Hybrid Quantum-Classical Circuit Simplification with the ZX-Calculus}, author={Agust'in Borgna and Simon Perdrix and Beno{\^i}t Valiron}, journal={Programming Languages and Systems}, year={2021} }

We present a complete optimization procedure for hybrid quantum-classical circuits with classical parity logic. While common optimization techniques for quantum algorithms focus on rewriting solely the pure quantum segments, there is interest in applying a global optimization process for applications such as quantum error correction and quantum assertions. This work, based on the pure-quantum circuit optimization procedure by Duncan et al., uses an extension of the formal graphical ZX-calculus… Expand

#### References

SHOWING 1-10 OF 32 REFERENCES

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

- Computer Science, Physics
- Quantum
- 2020

A simplification strategy for ZX-diagrams is given based on the two graph transformations of local complementation and pivoting and it is shown that the resulting reduced diagram can be transformed back into a quantum circuit. Expand

ZX-calculus for the working quantum computer scientist

- Physics
- 2020

The ZX-calculus is a graphical language for reasoning about quantum computation that has recently seen an increased usage in a variety of areas such as quantum circuit optimisation, surface codes and… Expand

Reducing T-count with the ZX-calculus

- Physics
- 2019

Reducing the number of non-Clifford quantum gates present in a circuit is an important task for efficiently implementing quantum computations, especially in the fault-tolerant regime. We present a… Expand

An Efficient Quantum Compiler that reduces $T$ count.

- Computer Science, Physics
- 2017

This work implemented several efficient quantum compilers for multi-qubit Clifford + $T$ circuits in C++ and benchmarked them on random circuits, from which it is determined that the TODD compiler yields the lowest number of gates in a circuit on average. Expand

Completeness of Graphical Languages for Mixed States Quantum Mechanics

- Computer Science, Physics
- ICALP
- 2019

A new construction, the discard construction, is introduced, which transforms any †-symmetric monoidal category into a symmetric Monoidal category equipped with a discard map, which provides an extension for several graphical languages that are proved to be complete for general quantum operations. Expand

The ZX calculus is a language for surface code lattice surgery

- Computer Science, Mathematics
- Quantum
- 2020

The operations of the ZX calculus -- a form of quantum diagrammatic reasoning based on bialgebras -- match exactly the operations of lattice surgery, and ZX diagram re-write rules give lattice operations for these operations that are novel, efficient, and highly configurable. Expand

Quipper: a scalable quantum programming language

- Computer Science
- PLDI 2013
- 2013

Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Expand

Quipper: a scalable quantum programming language

- Computer Science, Physics
- PLDI
- 2013

Quipper, a scalable, expressive, functional, higher-order quantum programming language, which is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Expand

Completeness of the ZX-Calculus

- Computer Science, Physics
- Log. Methods Comput. Sci.
- 2020

This work improves on the known-to-be-complete presentation for the so-called Clifford fragment of the ZX-Calculus, and provides a complete axiomatisation for an altered version of the language which involves an additional generator, making the presentation simpler. Expand

Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning

- Mathematics, Computer Science
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- 2014

A polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of fault-tolerant logical gates into consideration, allowing space-time trade-offs to be easily explored. Expand