Leveraging Different Boolean Function Decompositions to Reduce T-Count in LUT-Based Quantum Circuit Synthesis
Open Access
- 1 April 2025
- journal article
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E108.D (4) , 320-329
Abstract
Lookup Table (LUT) based synthesis methods have recently been proposed as away 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.Keywords
This publication has 8 references indexed in Scilit:
- Phase-state duality in reversible circuit designPhysical Review A, 2021
- LUT-Based Hierarchical Reversible Logic SynthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2018
- Advantages of using relative-phase Toffoli gates with an application to multiple control Toffoli optimizationPhysical Review A, 2016
- Exact synthesis of multiqubit Clifford+circuitsPhysical Review A, 2013
- ABC: An Academic Industrial-Strength Verification Tool2010
- DDMF: An Efficient Decision Diagram Structure for Design Verification of Quantum Circuits under a Practical RestrictionIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
- Pseudo-Kronecker expressions for symmetric functionsIEEE Transactions on Computers, 1999
- Elementary gates for quantum computationPhysical Review A, 1995