In-place implementation of Quantum-Gimli

Understand

We present an in-place implementation of the cryptographic permutation \textbf{Gimli}, a NIST round 2 candidate for lightweight cryptography, and provide an upper bound for the required quantum resource in depth and gate-counts.

• In particular, we do not use any ancilla qubits and the state that our circuit produces is not entangled with any input.
• This offers further freedom in the usability and allows for a widespread use in different applications in a plug-and-play manner.