What is the greatest common divisor (GCD) and how is it computed classically?
Sunday, 06 August 2023
by EITCA Academy
The greatest common divisor (GCD) is a fundamental concept in number theory, which plays a crucial role in many mathematical algorithms and computations. In the context of quantum information and Shor's quantum factoring algorithm, understanding the GCD is essential for comprehending the underlying principles and techniques employed in the algorithm. The GCD of two or
- Published in Quantum Information, EITC/QI/QIF Quantum Information Fundamentals, Shor's Quantum Factoring Algorithm, Shor's Factoring Algorithm, Examination review
Tagged under:
EUCLIDEAN ALGORITHM, GCD, GREATEST COMMON DIVISOR, Number Theory, Quantum Information, Shor's Algorithm