Periodicity Archives - EITCA Academy

To find the period in Shor’s Quantum Factoring Algorithm we repeat the circuit some times to get the samples for the GCD and then the period. How many samples do we need in general for that?

Thursday, 07 March 2024 by panosadrianos

To determine the period in Shor's Quantum Factoring Algorithm, it is essential to repeat the circuit multiple times to obtain samples for finding the greatest common divisor (GCD) and subsequently the period. The number of samples required for this process is important for the algorithm's efficiency and accuracy. In general, the number of samples needed

Published in Quantum Information, EITC/QI/QIF Quantum Information Fundamentals, Shor's Quantum Factoring Algorithm, Period finding

Tagged under: Modular Exponentiation, Periodicity, Quantum Computing, Quantum Fourier Transform, Quantum Information, Shor's Algorithm

EITCA Academy

SIGN IN YOUR ACCOUNT TO HAVE ACCESS TO DIFFERENT FEATURES

FORGOT YOUR DETAILS?

CREATE ACCOUNT

To find the period in Shor’s Quantum Factoring Algorithm we repeat the circuit some times to get the samples for the GCD and then the period. How many samples do we need in general for that?