Non-Clifford Fusion: T-Gate Optimization for Quantum Simulation

• URL: http://arxiv.org/abs/2510.13573v1
• Date: Wed, 15 Oct 2025 14:12:22 GMT
• Title: Non-Clifford Fusion: T-Gate Optimization for Quantum Simulation
• Abstract summary: Hamiltonian simulation is a key quantum algorithm for modeling complex systems.<n>NCF is a compilation framework that reduces both the T-gate count and T-gate depth for Hamiltonian simulation.<n>NCF achieves an average reduction of 57.4%, 49.1%, and 49.0% in T-gate count, T-gate depth, and Clifford count, respectively.
• Score: 8.852772632327335
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hamiltonian simulation is a key quantum algorithm for modeling complex systems. To implement a Hamiltonian simulation, it is typically decomposed into a list of Pauli strings, each corresponds to an RZ rotation gate with many Clifford gates. These RZ gates are generally synthesized into a sequence of Clifford and T gates in fault-tolerant quantum computers, where the T-gate count and T-gate depth are critical metrics for such systems. In this paper, we propose NCF, a compilation framework that reduces both the T-gate count and T-gate depth for Hamiltonian simulation. NCF partitions Pauli strings into groups, where each group can be conjugated (i.e., transformed) into a list of Pauli strings that apply quantum gates on a restricted subset of qubits, allowing for simultaneous synthesis of the whole group and reducing both T-gate count and depth. Experimental results demonstrate that NCF achieves an average reduction of 57.4%, 49.1%, and 49.0% in T-gate count, T-gate depth, and Clifford count, respectively, compared to the state-of-the-art method.

Related papers

• Reducing entanglement with a Hamiltonian derived Clifford transformation [37.803764941926374]
  Recently, an algorithm was introduced that deterministically generates a Clifford transformation from the Qubit Coupled Cluster (QCC) algorithm.<n>Here, we show that Q-Cliff can be utilized to generate efficient classical and quantum approximations to the ground states of chemical systems.
  arXiv  Detail & Related papers  (2026-07-20T18:00:40Z)
• Efficient Quantum Circuit Construction of Controlled Time-Evolution for Arbitrary Pauli-Sum Hamiltonians [2.2412154463267284]
  Controlled time-evolution circuits select forward or backward Hamiltonian time evolution according to the state of ancilla qubit.<n>A direct realization adds ancilla control to the elementary gates of the time-evolution circuit.
  arXiv  Detail & Related papers  (2026-06-04T12:10:56Z)
• Quantum Circuit Synthesis Using an Exact T Library [11.993614756390436]
  In fault-tolerant quantum synthesis circuit, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead.<n>Conventional flows minimize AND count in an XOR, AND, NOT basis as a proxy for T, which neglects phase cancellation and can be far from T-optimal.<n>We instead formulate an exact T synthesis problem and canonicalize Boolean functions under Clifford equivalence.
  arXiv  Detail & Related papers  (2026-05-14T23:34:01Z)
• Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states [0.6580655899524989]
  One approach to classical simulation is to represent the output of a quantum circuit as a Clifford-augmented Matrix Product State ( CAMPS)<n>We develop an optimization-free disentangling algorithm for Clifford circuits either doped with multi-qubit gates of the form $alpha I+beta P$.<n>This work establishes a versatile framework for understanding classical simulatability of Clifford+$T$ circuits and explores the interplay between quantum entanglement and quantum magic in quantum systems.
  arXiv  Detail & Related papers  (2024-12-23T01:26:40Z)
• The exact lower bound of CNOT-complexity for fault-tolerant quantum Fourier transform [9.657072841833243]
  We study the exact lower bound problem of CNOT gate complexity for fault-tolerant QFT. Our work can provide a reference for designing algorithms based on active defense in a quantum setting.
  arXiv  Detail & Related papers  (2024-09-04T08:06:11Z)
• Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
  Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another. We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST. The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
  arXiv  Detail & Related papers  (2024-05-10T23:46:35Z)
• Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning [2.4646794072984477]
  Unitary synthesis aims to identify a quantum circuit that represents a given unitary. We apply the tree-search method Gumbel AlphaZero to solve the problem for a subset of exactly synthesizable Clifford+T unitaries. Our method effectively synthesizes circuits for up to five qubits generated from randomized circuits with up to 60 gates.
  arXiv  Detail & Related papers  (2024-04-23T09:37:52Z)
• 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)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates [11.978356827088595]
  The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element. Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity.
  arXiv  Detail & Related papers  (2021-05-05T19:18:35Z)
• 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)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Term Grouping and Travelling Salesperson for Digital Quantum Simulation [6.945601123742983]
  Digital simulation of quantum dynamics by evaluating the time evolution of a Hamiltonian is the initially proposed application of quantum computing. The large number of quantum gates required for emulating the complete second quantization form of the Hamiltonian makes such an approach unsuitable for near-term devices. We propose a new term ordering strategy, max-commute-tsp, that simultaneously mitigates both algorithmic and physical errors.
  arXiv  Detail & Related papers  (2020-01-16T18:33:24Z)

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

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.