Constant-optimized quantum circuits for modular multiplication and exponentiation

MaRDI QIDQ3166025zbMATH OpenFDO

Authors Igor L. Markov, Mehdi Saeedi

Publication date 21 October 2012

Full work available at URL https://arxiv.org/abs/1202.6614

zbMATH Keywords

modular exponentiationmodular multiplicationquantum circuitsShor's quantum factoring algorithm

Mathematics Subject Classification ID

Structure of modular groups and generalizations; arithmetic groups (11F06) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• Fast quantum modular exponentiation
• Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures
• Improved quantum circuits for elliptic curve discrete logarithms
• Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
• A logarithmic-depth quantum carry-lookahead adder

Cited in

(19)

• Quantum arithmetic with the quantum Fourier transform
• Odd orders in Shor's factoring algorithm
• A novel and efficient square root computation quantum circuit for floating-point standard
• Efficient quantum circuit of Proth number modular multiplication
• T-count optimized Wallace tree integer multiplier for quantum computing
• Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count
• Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication
• Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations
• Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures
• Fast quantum modular exponentiation
• Depth-optimized reversible circuit synthesis
• Improved reversible and quantum circuits for Karatsuba-based integer multiplication
• Boolean satisfiability in quantum compilation
• Quantum arithmetic operations based on quantum Fourier transform on signed integers
• Introduction to multiplicative group on 2-qubits in quantum color image processing
• On the various ways of quantum implementation of the modular exponentiation function for Shor's factorization
• Quantum plug n' play: modular computation in the quantum regime
• Asymptotically optimal synthesis of reversible circuits
• Construction and optimization of quantum modular exponentiation circuits based on the V gate

This page was built for publication: Constant-optimized quantum circuits for modular multiplication and exponentiation

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