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

Low TTT-Depth Quantum Circuit of ZUC-128

Siyao Xu, Da Lin, Zejun Xiang, Shasha Zhang, Xiangyong Zeng

Published Nov 6, 2026• 0 citations
Publisher
DOI
10.1007/978-981-92-7675-2_22

Related papers

Low depth quantum circuits for Ising models

S. Iblisdir, Mauro Cirio, O. Boada +1 more

arXiv:1208.3918•Annals of Physics•Nov 13, 2013•16 citations

Quantum Circuits of AES with a Low-Depth Linear Layer and a New Structure

Haotian Shi, Xiutao Feng

Lecture notes in computer science•Dec 11, 2024•17 citations

An efficient quantum circuit implementation of ZUC-128 cipher with low T-depth

ZOU Jian, XIANG SiMing, ZOU ChangZhong +1 more

祖冲之密码算法 (ZUC) 是我国推出的一种流密码算法, 本文主要研究如何以较低 T 深度实现ZUC-128 算法的完整量子线路. S 盒是 ZUC-128 算法非线性组件的重要组成部分, 首先本文通过穷搜剪枝策略和塔域分解技术分别获得了S0和S1的经典电路实现, 然后分两步设计S0和S1量子线路: 第一步是减小经典电路的与门深度, 第二步是实现量子线路的 T 深度等于经典电路的与门深度. 本文新型的S0和S1的量子线路的 T 深度都为 7. 同时本文还研究了加法器和 L 函数的量子线路实现, 以降低整体电路的T 深度. 最后本文探索出了 ZUC 算法整个流程的量子线路构造, 当工作步骤中的 L=32 轮时, 该量子线路需要 46008 个量子比特, 682340 个 T 门, 2008535 个 CNOT 门和 42680 个 NOT 门, T 深度为 11341, 其量子比特数与 T 深度的乘积为 5.22 × 10^8.

Zhongguo kexue. Wulixue Lixue Tianwenxue•May 23, 2024•4 citations

The quantum processor circuit

Hafiz Md. Hasan Babu

Institute of Physics eBooks•Jun 1, 2023•0 citations

Low-Depth Construction of Grover Oracles from Fully Functional Quantum Circuits

Jiaqi Gu, Behzad Abdolmaleki

Grover oracle is the core component of the Grover search algorithm. Instead of constructing a Grover oracle from scratch, we consider a common practice that how to construct a Grover oracle based on an existing fully functional quantum circuits (FFQCs). A FFQC typically performs computations for a primary target and includes ancillas (qubits for intermediate storage) restoration. Although these circuits can be directly integrated into an oracle, we find that this inevitably introduces circuit redundancy. To address this, we propose a low-depth transformation method that can convert an existing FFQC into a low-depth Grover oracle. Additionally, our method can further reduce the width while retaining the previously achieved low depth.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•0 citations

Efficient quantum circuit implementations of SM3 and RIPEMD-160 Hash functions

邹健, GUO Nansheng, LI Junkang

The development of quantum computing technology poses potential threats to the security of existing cryptographic algorithms, making it urgent to develop efficient quantum circuit implementation schemes to support security assessments. To design low-T-depth and efficient quantum circuits for the SM3 and RIPEMD-160 Hash functions, the following methods were employed. For SM3, the overall circuit was optimized by applying low-T-depth quantum adders and reorganizing the quantum components. For RIPEMD-160, a low-T-depth quantum implementation of its Boolean functions was designed, the hierarchical parallel arrangement of its compression function was optimized, and its quantum circuit was constructed for the first time. The results show that the proposed SM3 quantum circuit significantly outperforms existing schemes in terms of T-depth and T-DW-cost, with a T-depth of 4 528. The first-time implemented RIPEMD-160 quantum circuit achieves a T-depth of 4 454. These provide efficient circuit implementation schemes for the security assessment of SM3 and RIPEMD-160 in quantum environments.

•Dec 1, 2025•0 citations
祖冲之密码算法 (ZUC) 是我国推出的一种流密码算法, 本文主要研究如何以较低 T 深度实现ZUC-128 算法的完整量子线路. S 盒是 ZUC-128 算法非线性组件的重要组成部分, 首先本文通过穷搜剪枝策略和塔域分解技术分别获得了S0和S1的经典电路实现, 然后分两步设计S0和S1量子线路: 第一步是减小经典电路的与门深度, 第二步是实现量子线路的 T 深度等于经典电路的与门深度. 本文新型的S0和S1的量子线路的 T 深度都为 7. 同时本文还研究了加法器和 L 函数的量子线路实现, 以降低整体电路的T 深度. 最后本文探索出了 ZUC 算法整个流程的量子线路构造, 当工作步骤中的 L=32 轮时, 该量子线路需要 46008 个量子比特, 682340 个 T 门, 2008535 个 CNOT 门和 42680 个 NOT 门, T 深度为 11341, 其量子比特数与 T 深度的乘积为 5.22 × 10^8.
Grover oracle is the core component of the Grover search algorithm. Instead of constructing a Grover oracle from scratch, we consider a common practice that how to construct a Grover oracle based on an existing fully functional quantum circuits (FFQCs). A FFQC typically performs computations for a primary target and includes ancillas (qubits for intermediate storage) restoration. Although these circuits can be directly integrated into an oracle, we find that this inevitably introduces circuit redundancy. To address this, we propose a low-depth transformation method that can convert an existing FFQC into a low-depth Grover oracle. Additionally, our method can further reduce the width while retaining the previously achieved low depth.
The development of quantum computing technology poses potential threats to the security of existing cryptographic algorithms, making it urgent to develop efficient quantum circuit implementation schemes to support security assessments. To design low-T-depth and efficient quantum circuits for the SM3 and RIPEMD-160 Hash functions, the following methods were employed. For SM3, the overall circuit was optimized by applying low-T-depth quantum adders and reorganizing the quantum components. For RIPEMD-160, a low-T-depth quantum implementation of its Boolean functions was designed, the hierarchical parallel arrangement of its compression function was optimized, and its quantum circuit was constructed for the first time. The results show that the proposed SM3 quantum circuit significantly outperforms existing schemes in terms of T-depth and T-DW-cost, with a T-depth of 4 528. The first-time implemented RIPEMD-160 quantum circuit achieves a T-depth of 4 454. These provide efficient circuit implementation schemes for the security assessment of SM3 and RIPEMD-160 in quantum environments.