Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate
Amit Saha, Ritajit Majumdar, Debasri Saha, Amlan Chakrabarti, Susmita, Sur-Kolay

TL;DR
This paper presents a new, optimized quantum circuit for implementing Grover's algorithm in $d$-ary qudit systems, featuring an efficient decomposition of the $n$-qudit Toffoli gate that reduces circuit depth and error probability.
Contribution
It introduces a generalized $n$-qudit Toffoli gate with logarithmic depth decomposition without ancilla qudits for $d$-ary systems, improving efficiency over previous methods.
Findings
Reduced circuit depth compared to earlier approaches.
Significant decrease in error probability due to optimized gate decomposition.
Enhanced performance of Grover's algorithm in $d$-ary quantum systems.
Abstract
The progress in building quantum computers to execute quantum algorithms has recently been remarkable. Grover's search algorithm in a binary quantum system provides considerable speed-up over classical paradigm. Further, Grover's algorithm can be extended to a -ary (qudit) quantum system for utilizing the advantage of larger state space, which helps to reduce the run-time of the algorithm as compared to the traditional binary quantum systems. In a qudit quantum system, an -qudit Toffoli gate plays a significant role in the accurate implementation of Grover's algorithm. In this article, a generalized -qudit Toffoli gate has been realized using higher dimensional qudits to attain a logarithmic depth decomposition without ancilla qudit. The circuit for Grover's algorithm has then been designed for any -ary quantum system, where , with the proposed -qudit Toffoli…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
