Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication

DOI10.1007/S11128-024-04536-1MaRDI QIDQ6629269zbMATH OpenFDO

Authors Sunyeop Kim, Insung Kim, Seonggyeom Kim, Seokhie Hong

Publication date 29 October 2024

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

zbMATH Keywords

algorithmquantum computingqubitquantum circuits

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• An \(O(m^2)\)-depth quantum algorithm for the elliptic curve discrete logarithm problem over \(\mathrm{GF}(2^m)^\alpha\)
• Better Circuits for Binary Polynomial Multiplication
• Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
• Five, six, and seven-term Karatsuba-like formulae
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• On distinct circular permutations.
• On the Shortest Linear Straight-Line Program for Computing Linear Forms
• Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
• Witt vectors and the algebra of necklaces

This page was built for publication: Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication

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