Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation

Abstract

Quantum compilers that reduce the number of T gates are essential for minimizing the overhead of fault-tolerant quantum computation. Achieving further T-count reduction calls for identifying equivalent circuit transformation rules beyond those utilized in existing tools. In this paper, we rewrite any given Clifford+T circuit using a Clifford block followed by a sequential Pauli-based computation, and introduce a nontrivial, ancilla-free transformation rule, the multi-product commutation relation (MCR). MCR constructs gate sequences based on specific commutation properties among multi-Pauli operators, yielding seemingly non-commutative instances that can be commuted, thereby enabling gate orderings that cannot be derived from pairwise commutation alone. We also propose the MCR Compiler, which incorporates MCR-based transformations as an optimization pass. To evaluate its effect, we use a benchmark circuit dataset generated through quantum circuit unoptimization. This approach intentionally adds redundancy to the circuit while keeping its equivalence, allowing a quantitative evaluation of compiler performance by comparison with the original circuit. Our numerical experiments reveal that the MCR Compiler achieves further T-count reduction beyond current compilers, establishing MCR-based transformations as a practical optimization primitive. These results highlight an untapped opportunity to enhance the optimization capabilities of quantum compilers.

17 pages, 16 figures

References in corpus (29)

• A variational eigenvalue solver on a quantum processor
• Quantum Simulation
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Quantum error correction below the surface code threshold
• Synthesis of Quantum Logic Circuits
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Polynomial-time T-depth Optimization of Clifford+T circuits via Matroid Partitioning
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• A Software Methodology for Compiling Quantum Programs
• Reducing T-count with the ZX-calculus
• PyZX: Large Scale Automated Diagrammatic Reasoning
• Maximum velocity quantum circuits
• staq -- A full-stack quantum processing toolkit
• The MQT Handbook: A Summary of Design Automation Tools and Software for Quantum Computing
• T-count optimization and Reed-Muller codes
• Hunting for quantum-classical crossover in condensed matter problems
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Simulating large-size quantum spin chains on cloud-based superconducting quantum computers
• QAOA-MC: Markov chain Monte Carlo enhanced by Quantum Alternating Operator Ansatz
• On Groups in the Qubit Clifford Hierarchy
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Optimal compilation of parametrised quantum circuits
• Locality-aware Pauli-based computation for local magic state preparation
• Lower T-count with faster algorithms
• Quantum Circuit Unoptimization