Almost Optimal Synthesis of Reversible Function in Qudit Model

Abstract

Quantum oracles are widely adopted in problems, like query oracle in Grover’s algorithm, cipher in quantum cryptanalytic and data encoder in quantum machine learning. Notably, the bit-flip oracle, capable of flipping the state based on a given classical function, emerges as a fundamental component in the design and construction of quantum algorithms. Devising methods to optimally implement the bit-flip oracle essentially translates to the efficient synthesis of reversible functions. Prior research has primarily focused on the qubit model, leaving the higher dimensional systems, i.e. qudit model, largely unexplored. By allowing more than two computational bases, qudit model can fully utilize the multi-level nature of the underlying physical mechanism. We propose a method to synthesize even permutations in <inline-formula> <tex-math notation="LaTeX">$A_{d^{n}}$ </tex-math></inline-formula> using <inline-formula> <tex-math notation="LaTeX">$\Theta (d)~(n - 1)$ </tex-math></inline-formula>-qudit sub-circuits, which achieve asymptotic optimality in the count of sub-circuits. Moreover, we introduce a technique for synthesizing reversible functions employing <inline-formula> <tex-math notation="LaTeX">$O\left ({{ n d^{n} }}\right)$ </tex-math></inline-formula> two-qudit gates and only a single ancilla. This is asymptotically tight in terms of <italic>d</italic> and asymptotically almost tight in terms of <italic>n</italic>.