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

Lecture notes in computer science

$$T{-}depth$$ Reduction Method for Efficient $$SHA{-}256$$ Quantum Circuit Construction

Jongheon Lee, Sokjoon Lee, You-Seok Lee, Dooho Choi

Published Jan 1, 2022• 3 citations
Publisher
DOI
10.1007/978-3-031-08896-4_20

Related papers

Constructing resource-efficient quantum circuits for AES

Liang Jiang, Bin‐Bin Cai, Fei Gao +3 more

An efficient quantum implementation of the advanced encryption standard (AES) is crucial for reducing the complexity of implementing an exhaustive key search through Grover’s algorithm. In this paper, we study how to construct resource-efficient quantum circuits for AES. We consider the product of T-gates depth and width (TDW) and the product of full depth and width (FDW) as optimization targets. We propose a generic method, called the controlled control qubit cascade (CCQC) technique, to construct quantum circuits for nonlinear components with reduced TDW and FDW. Using this, we construct a quantum circuit for the AES S-box. Compared with recent work presented at ASIACRYPT 2023, our S-box quantum circuit achieves reductions of 2.3% in TDW and 45.2% in FDW. Additionally, we propose a new key schedule strategy to reduce the full depth of the AES quantum circuit. Finally, the trade-offs between T-gates depth and width and the parallel numbers of S-box and TDW are analyzed.

Frontiers in Physics•Apr 22, 2025•5 citations

Synthesizing Quantum Circuits of AES with Lower T-depth and Less Qubits

Zhenyu Huang, Siwei Sun

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

Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256

Jongheon Lee, Yousung Kang, You-Seok Lee +2 more

Abstract When implementing a quantum circuit for a desired reversible function, an attempt is made to design an accurate quantum circuit. Then, the quantum circuit is optimized based on a specific cost function, such as design cost, width (the number of qubits), depth, etc. In particular, if an in-place subcircuit itself can be optimized while maintaining its in-place property, it will be a very useful way to increase efficiency without changing the initial architecture of the entire quantum circuit. Furthermore, since its (clean) work qubits can easily be utilized in subsequent subroutines of the quantum circuit, it has an additional important advantage in terms of width. In this paper, for the first time to the best of our knowledge, we present a global Toffoli-depth reduction methodology for an in-place version reversible circuit in the case that the given input circuit is optimized with Toffoli-count. We mainly introduce a process to optimize the $$\chi $$ χ internal function block in SHA3-256 to explain our Toffoli-depth reduction approach preserving the in-place property, and hence, well-balanced five $$\chi $$ χ quantum circuits are induced in terms of its width and T-depth. And then, we apply these five $$\chi $$ χ circuits to design the entire SHA3-256 cryptosystem. One of the proposed SHA3-256 quantum circuits has a width of 1600 and a T-depth of 264, and this shows a result of 50% and 38.9% reduction compared to the previous circuit in terms of width and T-depth, respectively. Other versions of our SHA3-256 circuits just required 10–33 qubits per one T-depth compared to the previous results which require over 1800 qubits per T-depth, and so this means that our SHA3-256 circuits are well-balanced. Finally, we constructed Grover’s algorithm circuit using each version that realized SHA3-256. When output circuits for the presented method were used, quantum volume values of Grover’s algorithm circuits became 33 and 50 $$\%$$ % of the value when the input circuit was used.

Quantum Information Processing•Apr 18, 2024•6 citations

Reducing the Depth of Quantum Circuits Using Additional Circuit Lines

Nabila Abdessaied, Robert Wille, Mathias Soeken +1 more

Lecture notes in computer science•Jan 1, 2013•29 citations

A-1-25 On Efficient Universal Quantum Circuits

Tomoki Yamada, Satoshi Tayu, Shuichi Ueno

電子情報通信学会総合大会講演論文集•Feb 28, 2011•1 citation

Algorithmic Complexity for Parallel Quantum Circuit Design

Jincheng Zhang

Quantum computing holds immense promise for revolutionizing various fields, but the design and implementation of quantum circuits remain a significant challenge. Traditional approaches often struggle with high fidelity and lengthy circuit construction times, limiting the scalability of quantum computations. This paper introduces a novel algorithmic approach, the "Prioritized Connectivity and Redundancy Minimization" (PCRM) method, designed to address these limitations. We demonstrate its effectiveness in designing parallel quantum circuits, emphasizing circuit connectivity and redundancy reduction, thereby significantly improving fidelity and computational efficiency. The method incorporates a dynamic optimization process that iteratively refines circuit layouts to achieve optimal performance. This research explores the impact of PCRM on various quantum circuit designs, providing a practical framework for accelerating quantum algorithm development.

•Sep 5, 2026•0 citations
T−depthT{-}depthT−depth Reduction Method for Efficient SHA−256SHA{-}256SHA−256 Quantum Circuit Construction
An efficient quantum implementation of the advanced encryption standard (AES) is crucial for reducing the complexity of implementing an exhaustive key search through Grover’s algorithm. In this paper, we study how to construct resource-efficient quantum circuits for AES. We consider the product of T-gates depth and width (TDW) and the product of full depth and width (FDW) as optimization targets. We propose a generic method, called the controlled control qubit cascade (CCQC) technique, to construct quantum circuits for nonlinear components with reduced TDW and FDW. Using this, we construct a quantum circuit for the AES S-box. Compared with recent work presented at ASIACRYPT 2023, our S-box quantum circuit achieves reductions of 2.3% in TDW and 45.2% in FDW. Additionally, we propose a new key schedule strategy to reduce the full depth of the AES quantum circuit. Finally, the trade-offs between T-gates depth and width and the parallel numbers of S-box and TDW are analyzed.
Abstract When implementing a quantum circuit for a desired reversible function, an attempt is made to design an accurate quantum circuit. Then, the quantum circuit is optimized based on a specific cost function, such as design cost, width (the number of qubits), depth, etc. In particular, if an in-place subcircuit itself can be optimized while maintaining its in-place property, it will be a very useful way to increase efficiency without changing the initial architecture of the entire quantum circuit. Furthermore, since its (clean) work qubits can easily be utilized in subsequent subroutines of the quantum circuit, it has an additional important advantage in terms of width. In this paper, for the first time to the best of our knowledge, we present a global Toffoli-depth reduction methodology for an in-place version reversible circuit in the case that the given input circuit is optimized with Toffoli-count. We mainly introduce a process to optimize the χ\chi χ χ internal function block in SHA3-256 to explain our Toffoli-depth reduction approach preserving the in-place property, and hence, well-balanced five χ\chi χ χ quantum circuits are induced in terms of its width and T-depth. And then, we apply these five χ\chi χ χ circuits to design the entire SHA3-256 cryptosystem. One of the proposed SHA3-256 quantum circuits has a width of 1600 and a T-depth of 264, and this shows a result of 50% and 38.9% reduction compared to the previous circuit in terms of width and T-depth, respectively. Other versions of our SHA3-256 circuits just required 10–33 qubits per one T-depth compared to the previous results which require over 1800 qubits per T-depth, and so this means that our SHA3-256 circuits are well-balanced. Finally, we constructed Grover’s algorithm circuit using each version that realized SHA3-256. When output circuits for the presented method were used, quantum volume values of Grover’s algorithm circuits became 33 and 50 %\%% % of the value when the input circuit was used.
Quantum computing holds immense promise for revolutionizing various fields, but the design and implementation of quantum circuits remain a significant challenge. Traditional approaches often struggle with high fidelity and lengthy circuit construction times, limiting the scalability of quantum computations. This paper introduces a novel algorithmic approach, the "Prioritized Connectivity and Redundancy Minimization" (PCRM) method, designed to address these limitations. We demonstrate its effectiveness in designing parallel quantum circuits, emphasizing circuit connectivity and redundancy reduction, thereby significantly improving fidelity and computational efficiency. The method incorporates a dynamic optimization process that iteratively refines circuit layouts to achieve optimal performance. This research explores the impact of PCRM on various quantum circuit designs, providing a practical framework for accelerating quantum algorithm development.