Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Reducing T-count in Quantum Boolean Circuit Synthesis by Allowing a Relative Phase

David Clarino

Published Mar 31, 2025• 0 citations
Publisher
DOI
10.34382/0002002173

Related papers

Optimization of Quantum Boolean Circuits by Relative-Phase Toffoli Gates

Shohei Kuroda, Shigeru Yamashita

Lecture notes in computer science•Jan 1, 2022•4 citations

Optimizing LUT-Based Quantum Circuit Synthesis Using Relative Phase Boolean Operations

David Clarino, Naoya Asada, Shigeru Yamashita

LUT-based synthesis methods have recently been proposed as a way to synthesize quantum Boolean circuits in a qubit constrained environment. Other results have also shown that allowing a relative phase when implementing quantum Boolean circuits yields an advantage in T-count without additional ancilla qubits, which is advantageous in the fault-tolerant quantum computing paradigm. We propose a method that utilizes both LUT-based synthesis and relative phase quantum Boolean circuits which minimize the T-count while minimizing the ancilla required to implement them. We leverage recent results regarding relative phase versions of Boolean functions and Shannon's decomposition to propose a novel method to synthesize arbitrary Boolean functions up to a relative phase. We then utilize this method to synthesize Boolean logic inside each LUT as a relative phase quantum Boolean circuit and show that the resulting quantum circuit has a clear advantage in T-count over more naive methods.

•Oct 28, 2023•2 citations

Synthesis and Optimization of Quantum Boolean Circuit Using the Truth Table Method

Fatma Hamzaoui, Roselyne Chotin-Avot, Patricia Renault +3 more

•Apr 26, 2012•0 citations

Quantum Circuit Synthesis Using an Exact T Library

Hanyu Wang, Mingfei Yu, Xinrui Wu +1 more

In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. 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. We instead formulate an exact T synthesis problem and canonicalize Boolean functions under Clifford equivalence. By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%.

quant-pharXiv:2605.15476•ACM/IEEE Design Automation Conference (DAC)•May 18, 2026•0 citations

Leveraging Different Boolean Function Decompositions to Reduce T-Count in LUT-Based Quantum Circuit Synthesis

David Clarino, Naoya ASADA, Atsushi Matsuo +1 more

Lookup Table (LUT) based synthesis methods have recently been proposed as a way to synthesize quantum Boolean circuits in a qubit-constrained environment. Other recent research papers have demonstrated the possibility of using relative phase quantum circuits when compute/uncompute logic is used in tandem, reducing T-count in quantum Boolean circuits in the fault-tolerant quantum computing paradigm. Because LUT-based synthesis methods use compute/uncompute pairs on ancilla qubits, this suggests that implementing the arbitrary Boolean logic that make up the individual Boolean logic network nodes in a relative phase manner could reduce the T-count. To generate such arbitrary Boolean functions, we utilize Shannon’s decomposition, Davio expansions, as well as alternating balanced and unbalanced relative phase circuits. Experimental results demonstrate that our method can reduce the T-count to an average of 24% of the existing method.

IEICE Transactions on Information and Systems•Oct 29, 2024•0 citations

A Synthesis Method for Quaternary Quantum Logic Circuits

Sudhindu Bikash Mandal, Amlan Chakrabarti, Susmita Sur‐Kolay

arXiv:1210.8055•Lecture notes in computer science•Jan 1, 2012•15 citations
LUT-based synthesis methods have recently been proposed as a way to synthesize quantum Boolean circuits in a qubit constrained environment. Other results have also shown that allowing a relative phase when implementing quantum Boolean circuits yields an advantage in T-count without additional ancilla qubits, which is advantageous in the fault-tolerant quantum computing paradigm. We propose a method that utilizes both LUT-based synthesis and relative phase quantum Boolean circuits which minimize the T-count while minimizing the ancilla required to implement them. We leverage recent results regarding relative phase versions of Boolean functions and Shannon's decomposition to propose a novel method to synthesize arbitrary Boolean functions up to a relative phase. We then utilize this method to synthesize Boolean logic inside each LUT as a relative phase quantum Boolean circuit and show that the resulting quantum circuit has a clear advantage in T-count over more naive methods.
In fault-tolerant quantum circuit synthesis, T gates supplied via magic states dominate space-time cost, while Clifford gates incur negligible overhead. 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. We instead formulate an exact T synthesis problem and canonicalize Boolean functions under Clifford equivalence. By precomputing T-optimal implementations up to seven variables and developing a customized mapper, we reduce the T count by up to 14.3% on EPFL benchmarks and improve the T counts of several cryptographic modules by up to 40%.
Lookup Table (LUT) based synthesis methods have recently been proposed as a way to synthesize quantum Boolean circuits in a qubit-constrained environment. Other recent research papers have demonstrated the possibility of using relative phase quantum circuits when compute/uncompute logic is used in tandem, reducing T-count in quantum Boolean circuits in the fault-tolerant quantum computing paradigm. Because LUT-based synthesis methods use compute/uncompute pairs on ancilla qubits, this suggests that implementing the arbitrary Boolean logic that make up the individual Boolean logic network nodes in a relative phase manner could reduce the T-count. To generate such arbitrary Boolean functions, we utilize Shannon’s decomposition, Davio expansions, as well as alternating balanced and unbalanced relative phase circuits. Experimental results demonstrate that our method can reduce the T-count to an average of 24% of the existing method.