Osnova sekce

◄Shor's algorithm
►Complex projective line representations

    • The complexity of Shor's algorithm crucially depends on the circuit for the Fourier transform.

      We could accept the matrix of the Fourier transform as given, but we will use the opportunity to explain the principle of the discrete Fourier transform as a decomposition of a complex function (mapping) over a group into the base of periodic functions (or the base of characters, or the Fourier base).

    • The Discrete Fourier Transform Soubor

      Linear algebraic definition of the basis of characters, or the Fourier basis.

    • Quantum decomposition of the DFT Soubor
    • Examples of DFT Soubor
    • Discussion Fórum
    • DFT as phase estimation Soubor

      An alternative point of view of Shor's algorithm

◄Shor's algorithm
►Complex projective line representations