Efficient quantum circuit of Proth number modular multiplication

DOI10.1007/978-3-031-08896-4_21MaRDI QIDQ2104467zbMATH OpenOpenAlexFDO

Authors Chanho Jeon, Donghoe Heo, M. H. Lee, Sunyeop Kim, Seokhie Hong

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08896-4_21

zbMATH Keywords

latticequantum circuitnumber theoretic transformCDKM addermoduluar multiplicationProth number

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Computer security (68M25)

Recommendations

• Constant-optimized quantum circuits for modular multiplication and exponentiation
• Fast quantum modular exponentiation
• Improved reversible and quantum circuits for Karatsuba-based integer multiplication
• Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
• Efficient algebraic representation of quantum circuits
• Efficient diabatic quantum algorithm in number factorization
• Efficient circuits for exact-universal computation with qudits
• Efficient quantum circuits for Schur and Clebsch-Gordan transforms

Cites work

• A logarithmic-depth quantum carry-lookahead adder
• Fast quantum modular exponentiation

Cited in

(1)

• T-count optimized Wallace tree integer multiplier for quantum computing

This page was built for publication: Efficient quantum circuit of Proth number modular multiplication

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