Fast quantum modular exponentiation

DOI10.1103/PhysRevA.71.052320zbMath1227.81134arXivquant-ph/0408006OpenAlexW2017278808MaRDI QIDQ3102391

Kohei M. Itoh, Rodney Van Meter

Publication date: 4 December 2011

Published in: Physical Review A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0408006

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Quantum computation (81P68)

Related Items

An \(R||C_{\max}\) quantum scheduling algorithm ⋮ Quantum arithmetic with the quantum Fourier transform ⋮ Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA ⋮ On the various ways of quantum implementation of the modular exponentiation function for Shor's factorization ⋮ Faster quantum chemistry simulation on fault-tolerant quantum computers ⋮ Evolving quantum circuits at the gate level with a hybrid quantum-inspired evolutionary algorithm ⋮ Practical security of RSA against NTC-architecture quantum computing attacks ⋮ Quantum circuit oracles for abstract machine computations ⋮ Quantum attacks on pseudorandom generators ⋮ CIRCUIT DESIGN FOR A MEASUREMENT-BASED QUANTUM CARRY-LOOKAHEAD ADDER ⋮ On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography ⋮ Architecture of a Quantum Multicomputer Implementing Shor’s Algorithm ⋮ Efficient quantum circuit of Proth number modular multiplication

Cites Work

• Parallel Quantum Computation and Quantum Codes
• Rapid solution of problems by quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast quantum modular exponentiation