MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits

DOI10.1007/s11128-023-04142-7OpenAlexW4387704564MaRDI QIDQ6089492

You-Seok Lee, Yousung Kang, Jongheon Lee, Dooho Choi, Boheung Chung

Publication date: 10 November 2023

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

Full work available at URL: https://doi.org/10.1007/s11128-023-04142-7

zbMATH Keywords

quantum circuitT-depthMPMCT gateToffoli-depth

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to AES and SHA-2
• \(T\)-\textit{depth} reduction method for efficient \textit{SHA}-256 quantum circuit construction
• Complexity of reversible circuits and their quantum implementations
• Quantum Walk Algorithm for Element Distinctness

This page was built for publication: MPMCT gate decomposition method reducing T-depth quickly in proportion to the number of work qubits