Related papers: Nontrivial multi-product commutation relation for reducing T-count in sequential Pauli-based computation

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

URL: http://arxiv.org/abs/2509.20052v1
Date: Wed, 24 Sep 2025 12:19:30 GMT
Title: Nontrivial multi-product commutation relation for reducing T-count in sequential Pauli-based computation
Authors: Yusei Mori, Hideaki Hakoshima, Keisuke Fujii,
Abstract summary: We introduce a nontrivial and ancilla-free equivalent transformation rule, the multi-product commutation relation (MCR)<n>This rule constructs gate sequences based on specific commutation properties among multi-Pauli operators, yielding seemingly non-commutative instances that can be commuted.<n>Our numerical experiments reveal that the transformation rule based on MCR is not yet incorporated into current compilers.
Score: 2.9436347471485558
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Quantum compilers that reduce the number of T gates are essential for minimizing the overhead of fault-tolerant quantum computation. To achieve effective T-count reduction, it is necessary to identify equivalent circuit transformation rules that are not yet 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 and ancilla-free equivalent transformation rule, the multi-product commutation relation (MCR). This rule constructs gate sequences based on specific commutation properties among multi-Pauli operators, yielding seemingly non-commutative instances that can be commuted. To evaluate whether existing compilers account for this commutation rule, we create a benchmark circuit dataset using quantum circuit unoptimization. This technique intentionally adds redundancy to the circuit while keeping its equivalence. By leveraging the known structure of the original circuit before unoptimization, this method enables a quantitative evaluation of compiler performance by measuring how closely the optimized circuit matches the original one. Our numerical experiments reveal that the transformation rule based on MCR is not yet incorporated into current compilers. This finding suggests an untapped potential for further T-count reduction by integrating MCR-aware transformations, paving the way for improvements in quantum compilers.

Related papers

Block encoding of sparse matrices with a periodic diagonal structure [67.45502291821956]
We provide an explicit quantum circuit for block encoding a sparse matrix with a periodic diagonal structure.<n>Various applications for the presented methodology are discussed in the context of solving differential problems.
arXiv Detail & Related papers (2026-02-11T07:24:33Z)
Optimization Driven Quantum Circuit Reduction [20.697821016522358]
We propose three different transpilation approaches to substantially reduce circuit lengths without affecting functionality.<n>The first variant is based on a search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support.<n>We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using different qiskit optimization levels.
arXiv Detail & Related papers (2025-02-20T16:41:10Z)
On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
arXiv Detail & Related papers (2024-08-15T17:09:08Z)
Redefining Lexicographical Ordering: Optimizing Pauli String Decompositions for Quantum Compiling [0.0]
We propose a novel algorithm for the synthesis of trotterized time-evolution operators. Our synthesis procedure takes the qubit connectivity of a target quantum computer into account. We show a significant improvement for randomized circuits and different molecular ansatzes.
arXiv Detail & Related papers (2024-08-01T07:50:16Z)
Multi-qubit Lattice Surgery Scheduling [3.7126786554865774]
A quantum circuit can be transpiled into a sequence of solely non-Clifford multi-qubit gates. We show that the transpilation significantly reduces the circuit length on the set of circuits tested. The resulting circuit of multi-qubit gates has a further reduction in the expected circuit execution time compared to serial execution.
arXiv Detail & Related papers (2024-05-27T22:41:41Z)
Quantum Circuit Optimization with AlphaTensor [47.9303833600197]
We develop AlphaTensor-Quantum, a method to minimize the number of T gates that are needed to implement a given circuit. Unlike existing methods for T-count optimization, AlphaTensor-Quantum can incorporate domain-specific knowledge about quantum computation and leverage gadgets. Remarkably, it discovers an efficient algorithm akin to Karatsuba's method for multiplication in finite fields.
arXiv Detail & Related papers (2024-02-22T09:20:54Z)
Tractable Bounding of Counterfactual Queries by Knowledge Compilation [51.47174989680976]
We discuss the problem of bounding partially identifiable queries, such as counterfactuals, in Pearlian structural causal models. A recently proposed iterated EM scheme yields an inner approximation of those bounds by sampling the initialisation parameters. We show how a single symbolic knowledge compilation allows us to obtain the circuit structure with symbolic parameters to be replaced by their actual values.
arXiv Detail & Related papers (2023-10-05T07:10:40Z)
Optimization at the Interface of Unitary and Non-unitary Quantum Operations in PCOAST [0.3496513815948205]
Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) introduced as framework for optimizing quantum circuits. In this paper, we focus on the set of subroutines which look to optimize the PCOAST graph in cases involving unitary and non-unitary operations. We evaluate the PCOAST optimization subroutines using the Intel Quantum SDK on examples of the Variational Quantum Eigensolver (VQE) algorithm.
arXiv Detail & Related papers (2023-05-16T22:58:14Z)
Near-optimal quantum circuit construction via Cartan decomposition [4.900041609957432]
We show the applicability of the Cartan decomposition of Lie algebras to quantum circuits. This approach can be used to synthesize circuits that can efficiently implement any desired unitary operation.
arXiv Detail & Related papers (2022-12-25T17:01:13Z)
Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
arXiv Detail & Related papers (2022-11-18T20:31:10Z)
Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
arXiv Detail & Related papers (2022-09-01T17:08:41Z)
A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz [68.8204255655161]
We describe a compilation strategy for Variational Quantum Eigensolver (VQE) algorithms. We use the Unitary Coupled Cluster (UCC) ansatz to reduce circuit depth and gate count.
arXiv Detail & Related papers (2020-07-20T22:26:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.