# Fourier and Arithmetic **English** · 简体中文 QFT and reversible arithmetic primitives: QFT itself, Draper Fourier addition, modular multiplication and order finding, plus reversible computing constructions such as Boolean SSA networks and fixed-point arithmetic. Entries come from the `fourier`/`arithmetic` modules of `common` and the number-theory part of `basics`. ```{toctree} :maxdepth: 1 ../qft ../fourier-addition ../order-finding ../modular-multiplication ../fixed-point-arithmetic ../boolean-networks ```