Quantum modular exponentiation

Quantum modular exponentiation is the reversible computation that maps

∣ x ⟩ ∣0 ⟩ ⟼ ∣ x ⟩ ∣ a^{x} mod N ⟩ .

It can be implemented in polynomial time in the bit lengths of

x

and

N

by repeated squaring and controlled modular multiplication.

 Ancestors (6)

 Incoming links (6)

Modular exponentiation
Modular multiplication eigenstates
Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 33 / 5 / Solution
Past exam of the mathematics course of the University of Cambridge / 2016 / iii / Paper 324 / 1 / ii / Solution
Past exam of the mathematics course of the University of Cambridge / 2019 / ii / Paper 4 / 10D / b / Solution
Past exam of the quantum information course of the University of Cambridge / 2014 / Paper 1 / 2 / Solution

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.

  See all articles in the same topic Create my own version