Phase Gadget Synthesis for Shallow Circuits

@inproceedings{Cowtan2019PhaseGS,
  title={Phase Gadget Synthesis for Shallow Circuits},
  author={A. Cowtan and Silas Dilkes and R. Duncan and W. Simmons and Seyon Sivarajah},
  booktitle={QPL},
  year={2019}
}
  • A. Cowtan, Silas Dilkes, +2 authors Seyon Sivarajah
  • Published in QPL 2019
  • Computer Science, Mathematics, Physics
  • We give an overview of the circuit optimisation methods used by tket, a compiler system for quantum software developed by Cambridge Quantum Computing Ltd. We focus on a novel technique based around phase gadgets, a family of multi-qubit quantum operations which occur naturally in a wide range of quantum circuits of practical interest. The phase gadgets have a simple presentation in the ZX-calculus, which makes it easy to reason about them. Taking advantage of this, we present an efficient… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    QFAST: Quantum Synthesis Using a Hierarchical Continuous Circuit Space
    2
    A Verified Optimizer for Quantum Circuits
    4
    Architecture-aware synthesis of phase polynomials for NISQ devices
    1
    Automated distribution of quantum circuits via hypergraph partitioning
    4
    Automated distribution of quantum circuits
    1
    t$|$ket$\rangle$ : A Retargetable Compiler for NISQ Devices
    3

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES
    Automated optimization of large quantum circuits with continuous parameters
    54
    A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits
    219
    An Efficient Quantum Compiler that reduces $T$ count.
    36
    A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
    39
    Reducing T-count with the ZX-calculus
    26
    An analytical decomposition protocol for optimal implementation of two-qubit entangling gates
    8
    Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
    29
    Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning
    108