Logarithmic-depth MCT gate implementation method on a given arbitrary number of clean ancillae

DOI10.1007/S11128-026-05056-WMaRDI QIDQ6852761zbMATH OpenFDO

Authors Jongheon Lee, Yousung Kang

Publication date 25 February 2026

Published in Quantum Information Processing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11128-026-05056-W

zbMATH Keywords

clean ancillaedirty ancillaeMCT gateToffoli-countToffoli-depth

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
• Decompositions of n-qubit Toffoli gates with linear circuit complexity
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• Implementing Grover oracles for quantum key search on AES and LowMC
• MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits
• Quantum Walk Algorithm for Element Distinctness
• Resource analysis of quantum computing with noisy qubits for Shor's factoring algorithms
• Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
• Toffoli-depth reduction method preserving in-place quantum circuits and its application to SHA3-256

This page was built for publication: Logarithmic-depth MCT gate implementation method on a given arbitrary number of clean ancillae

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6852761)