REVIEW 2 cited by
Optimizing T gates in Clifford+T circuit as $\pi/4$ rotations around Paulis
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
In this work, we introduce a new circuit optimization technique to reduce the number of T gates in Clifford+T circuits by treating T gates conjugated by Clifford gates as $\frac{\pi}{4}$-rotations around Pauli operators. The tested benchmarks shows up to $71.43\%$ and an average $42.67\%$ reduction in T-count, both surpass the best performance reported. The worst case complexity of our algorithm is $O(nk^2)$ where $n$ is the number of qubits and $k$ is the number of T gates in the original Clifford+T circuit.
Forward citations
Cited by 2 Pith papers
-
SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
SymFT reaches state-of-the-art exact sampling of Clifford-dominated FT circuits by combining symbolic Clifford–Pauli frames with planned dense stabilizer-coordinate updates.
-
Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation
A group of four non-commuting pi/4 Pauli rotations can be reordered as blocks whenever their axes satisfy a simple algebraic condition, and this rule defeats current T-count optimizers on specially built circuits.
Discussion (0). Continue with ORCID to comment.