Asymptotically Improved Circuit for $d$-ary Grover's Algorithm with Advanced Decomposition of $n$-qudit Toffoli Gate

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 $d$-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 $n$-qudit Toffoli gate plays a significant role in the accurate implementation of Grover's algorithm. In this article, a generalized $n$-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 $d$-ary quantum system, where $d\ge 2$, with the proposed $n$-qudit Toffoli gate to obtain optimized depth compared to earlier approaches. The technique for decomposing an $n$-qudit Toffoli gate requires access to two immediately higher energy levels, making the design susceptible to errors. Nevertheless, we show that the percentage decrease in the probability of error is significant as we have reduced both gate count and circuit depth as compared to that in state-of-the-art works.

15 pages, 9 figures

References in corpus (9)

• Charge insensitive qubit design derived from the Cooper pair box
• Surface codes: Towards practical large-scale quantum computation
• Efficient Toffoli Gates Using Qudits
• Time-efficient implementation of quantum search with qudits
• Determining the parity of a permutation using an experimental NMR qutrit
• Optimizing Ansatz Design in QAOA for Max-cut
• A Synthesis Method for Quaternary Quantum Logic Circuits
• Success Rate and Entanglement Evolution in Search Algorithm
• Evolution of Entanglement in Groverian Search Algorithm: n-qudit System

Cited by in corpus (11)

• Qudits for decomposing multiqubit gates and realizing quantum algorithms
• QuDiet: A Classical Simulation Platform for Qubit-Qudit Hybrid Quantum Systems
• FragQC: An Efficient Quantum Error Reduction Technique using Quantum Circuit Fragmentation
• Using Quantum Switches to Mitigate Noise in Grover's Search Algorithm
• Two-Step Quantum Search Algorithm for Solving Traveling Salesman Problems
• Robust Quantum Arithmetic Operations with Intermediate Qutrits in the NISQ-era
• QuForge: A Library for Qudits Simulation
• Moving Quantum States without SWAP via Intermediate Higher Dimensional Qudits
• Bidirectional controlled quantum state preparation in high-dimensional quantum system
• Robust Quantum Circuit for Clique Problem with Intermediate Qudits
• Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks