Decomposing the generalized Toffoli gate with qutrits

Abstract

The problem of finding efficient decompositions of multi-qubit gates is of importance for quantum computing, especially, in application to existing noisy intermediate-scale quantum devices, whose resources are substantially limited. Here we propose a decomposition scheme for a generalized $N$-qubit Toffoli gate with the use of $2N-3$ two-qutrit gates for arbitrary connectivity. The fixed number of the required additional levels (the choice of qutrits is optimal) and the use of the iSWAP gate as a native operation make our approach directly applicable for ongoing experiments with superconducting quantum processors. Specifically, we present a blueprint of the realization of the proposed scheme for the Aspen-9 processor supporting quantum operations with qutrits.

6 pages, 3 figures, 1 table

References in corpus (13)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum computational advantage using photons
• Molecular Spin Qudits for Quantum Algorithms
• 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
• Low-cost Fredkin gate with auxiliary space
• Time-efficient implementation of quantum search with qudits