Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits

Abstract

Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers, e.g. (artificial) atoms or ions, admit encoding of more complex multilevel states -- qudits. Recently, significant attention is paid to the idea of using qudit encoding as a way for further scaling quantum processors. In this work, we present an efficient decomposition of the generalized Toffoli gate on the five-level quantum systems, so-called ququints, that uses ququints' space as the space of two qubits with a joint ancillary state. The basic two-qubit operation that we use is a version of controlled-phase gate. The proposed $N$-qubit Toffoli gate decomposition has $O(N)$ asymptotic depth using no ancillary qubits. We then apply our results for Grover's algorithm, where we indicate on the sizable advantage of the using qudit-based approach with the proposed decomposition. We expect that our results are applicable for quantum processors based on various physical platforms.

10 pages, 4 figures

References in corpus (16)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Strong quantum computational advantage using a superconducting quantum processor
• Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
• Quantum computing with neutral atoms
• Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm
• Efficient Toffoli Gates Using Qudits
• Coherence and Decay of Higher Energy Levels of a Superconducting Transmon Qubit
• Single qudit realization of the Deutsch algorithm using superconducting many-level quantum circuits
• Asymptotic Improvements to Quantum Circuits via Qutrits
• Multilevel superconducting circuits as two-qubit systems: Operations, state preparation, and entropic inequalities
• Parallelism for Quantum Computation with Qudits
• Generalized Toffoli gates using qudit catalysis
• Time-efficient implementation of quantum search with qudits
• Decomposing the generalized Toffoli gate with qutrits
• Adaptive Compilation of Multi-Level Quantum Operations

Cited by in corpus (7)

• Qudits for decomposing multiqubit gates and realizing quantum algorithms
• Continuous dynamical decoupling of optical ${}^{171}$Yb${}^{+}$ qudits with radiofrequency fields
• Towards multiqudit quantum processor based on a ${}^{171}$Yb${}^{+}$ ion string: Realizing basic quantum algorithms
• QuForge: A Library for Qudits Simulation
• Formulation of the Electric Vehicle Charging and Routing Problem for a Hybrid Quantum-Classical Search Space Reduction Heuristic
• Robust Quantum Circuit for Clique Problem with Intermediate Qudits
• Synthesis of Single Qutrit Circuits from Clifford+R