We present an in-place implementation of the $\textbf{Gimli}$ permutation, 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 bits and the state that our circuit produces is not entangled with any input, which offers further freedom in the usability and allows for a widespread use in different applications in a plug-and-play manner.

中文翻译：

---

Quantum-Gimli 的就地实现

我们提出了 $\textbf{Gimli}$ 置换的就地实现，这是 NIST 第 2 轮轻量级密码学的候选者，并为所需的量子资源提供了深度和门数的上限。特别是，我们不使用任何辅助位，并且我们的电路产生的状态不与任何输入纠缠在一起，这在可用性上提供了更大的自由度，并允许以即插即用的方式在不同的应用程序中广泛使用。