Approximate Quantum Array Multiplier

Multiplication is a frequent computation in many algorithms, classical and quantum. This paper targets the im-plementation of quantum integer multiplication. Quantum array multipliers take inspiration from classical array multipliers, with the result of reduced circuit depth. They take advantage of the quantum phase domain, through rotations controlled by the mul-tiplier's qubits. This work further explores this implementation by applying approximate rotations. Although this approach can have an impact on the accuracy of the result, the reduction in depth can result in better outcomes when noise is involved.