Graph explorer

Quantum algorithmic differentiation

In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We present two versions of the algorithm, one which is fully quantum and one which employees a classical step (hybrid approach). Since the implementation of elementary functions is already possible on quantum computers, the scheme that we propose can be easily applied. Moreover, since some steps (such as the CNOT operator) can (or will be) faster on a quantum computer than on a classical one, our procedure may ultimately demonstrate that quantum algorithmic differentiation has an advantage relative to its classical counterpart.