Have a personal or library account? Click to login
Optimal T-depth Quantum Circuits for Implementing Arbitrary Boolean Functions Cover

Optimal T-depth Quantum Circuits for Implementing Arbitrary Boolean Functions

Open Access
|Mar 2026

Figures & Tables

Figure 1.

Toffoli decomposition with measurement-based uncomputation, using four T gates, (a) without using any ancilla qubit [20], (b) with a single reusable ancilla qubit [13].
Toffoli decomposition with measurement-based uncomputation, using four T gates, (a) without using any ancilla qubit [20], (b) with a single reusable ancilla qubit [13].

Figure 2.

Quantum circuit implementing a 3-bit S-box (used in LowMC) with T-depth 1.
Quantum circuit implementing a 3-bit S-box (used in LowMC) with T-depth 1.

Figure 3.

Quantum circuit implementing f (x0, x1, x2, x3) = x0x2 ⊕ x1x3 ⊕ x0x1x2x3 with T-depth 2.
Quantum circuit implementing f (x0, x1, x2, x3) = x0x2 ⊕ x1x3 ⊕ x0x1x2x3 with T-depth 2.

Optimal T-depth quantum implementation of full round AES with corresponding resources_

Key sizeNo. of roundAncilla countCNOT countCNOT depthT-countT-depth
1281010688588328196715744030
1921210944706072236318892836
2561411200823816275922041642

Optimal T-depth quantum circuit synthesis for various standard S-boxes with corresponding resource estimates using Theorem 2_ *A detailed analysis for the AES S-box is provided in Section 4_

S-box#VariablesAncilla countCNOT countCNOT depthT-countT-depth
LowMC [22]393913121
DEFAULT [23]4177927242
GIFT [24]4147627242
PRESENT [25]41910530322
PRINCE [26]42412828402
ASCON [27]52712022321
AES [28]*859636471849843

Quantum implementation of a single round of AES with corresponding resource estimates_

Toffoli-to-TAncilla countCNOT countCNOT depthT-countT-depth
Using Figure 1a752047064189157444
Using Figure 1b953658872198157443

Quantum circuits for AES S-box with corresponding resource estimates_

Toffoli-to-TAncilla countCNOT countCNOT depthT-countT-depth
Using Figure 1a47029091759844
Using Figure 1b59636471849843

Optimal T-depth quantum implementation of full round AES: A comparison with prior results_

Key sizeReferencesAncilla countCNOT countCNOT depthT-countT-depth
128[13, Table 4]4244284420NA54400120
128[30, Table 2]9384NANA3360050
128[15, Table 13]3689132376NA2720040
128[14, Table 7]5576285393NA6240030
128[16, Table VI]NA228020NA5280030
128[18, Table 8]NA176580NA3360030
128[19, Table 5]6128120812NA11798430
128[This paper]10688588328196715744030
192[13, Table 4]4564321021NA60928144
192[30, Table 2]10456NANA3763260
192[15, Table 13]3945149256NA3046448
192[19, Table 5]6448136812NA13296036
192[This paper]10944706072236318892836
256[13, Table 4]4884393534NA75072168
256[30, Table 2]46368NANA1270470
256[15, Table 13]4457187128NA3808056
256[19, Table 5]6768168548NA16526442
256[This paper]11200823816275922041642
DOI: https://doi.org/10.2478/qic-2025-0032 | Journal eISSN: 3106-0544 | Journal ISSN: 1533-7146
Language: English
Page range: 586 - 597
Submitted on: Jun 1, 2025
|
Accepted on: Sep 1, 2025
|
Published on: Mar 9, 2026
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year

© 2026 Suman Dutta, Anik Basu Bhaumik, Anupam Chattopadhyay, Subhamoy Maitra, published by Cerebration Science Publishing Co., Limited
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.