Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication
From MaRDI portal
Publication:6629269
DOI10.1007/S11128-024-04536-1MaRDI QIDQ6629269FDOQ6629269
Authors: Sunyeop Kim, Insung Kim, Seonggyeom Kim, Seokhie Hong 
Publication date: 29 October 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Five, six, and seven-term Karatsuba-like formulae
- Witt vectors and the algebra of necklaces
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- On the Shortest Linear Straight-Line Program for Computing Linear Forms
- Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
- On distinct circular permutations.
- 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
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)
