Corpus ID: 85499344

Reducing T-count with the ZX-calculus

@article{Kissinger2019ReducingTW,
  title={Reducing T-count with the ZX-calculus},
  author={Aleks Kissinger and John van de Wetering},
  journal={arXiv: Quantum Physics},
  year={2019}
}
  • Aleks Kissinger, John van de Wetering
  • Published 2019
  • Physics, Mathematics
  • arXiv: Quantum Physics
  • 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 new method for reducing the number of T-gates in a quantum circuit based on the ZX-calculus, which matches or beats previous approaches to T-count reduction on the majority of our benchmark circuits in the ancilla-free case, in some cases yielding up to 50% improvement. Our method begins by… CONTINUE READING

    Figures and Tables from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 26 CITATIONS

    Techniques to Reduce π/4-Parity-Phase Circuits, Motivated by the ZX Calculus

    VIEW 8 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Fast and Effective Techniques for T-Count Reduction via Spider Nest Identities

    VIEW 8 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    Completeness of the Phase-free ZH-calculus

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Circuit Relations for Real Stabilizers: Towards TOF+H

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    The ZX calculus is a language for surface code lattice surgery

    VIEW 1 EXCERPT
    CITES METHODS

    FILTER CITATIONS BY YEAR

    2017
    2020

    CITATION STATISTICS

    • 2 Highly Influenced Citations

    • Averaged 8 Citations per year from 2018 through 2020

    • 8% Increase in citations per year in 2020 over 2019

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

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

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Towards Large-scale Functional Verification of Universal Quantum Circuits

    • Matthew Amy
    • Mathematics, Computer Science, Physics
    • QPL
    • 2018
    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    An Efficient Quantum Compiler that reduces $T$ count.

    VIEW 9 EXCERPTS
    HIGHLY INFLUENTIAL

    A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits

    VIEW 1 EXCERPT

    Improved Simulation of Stabilizer Circuits

    VIEW 1 EXCERPT