Scalable quantum computing with qudits on a graph

TL;DR

This paper presents a scalable quantum computing model using qudits that reduces quantum operations and circuit depth for implementing the Toffoli gate by leveraging higher qudit levels and their connection topology.

Contribution

It introduces a general relation between qudit dimensionality and connection topology, enabling more efficient quantum gates and error correction methods.

Findings

Reduced number of quantum operations for Toffoli gate

Improved circuit depth in qudit-based quantum processors

Potential applications in quantum algorithms and error correction

Abstract

We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality of qudits and their topology of connections for a scalable multi-qudit processor, where higher qudit levels are used for substituting ancillas. The suggested model is of importance for the realization of quantum algorithms and as a method of quantum error correction codes for single-qubit operations.