Scalable quantum computing with qudits on a graph

E. O. Kiktenko (1) , A. S. Nikolaeva , Peng Xu , G. V. Shlyapnikov (2) , A. K. Fedorov (3)

1 IPE - Schmidt United Institute of Physics of the Earth [Moscow]
2 LPTMS - Laboratoire de Physique Théorique et Modèles Statistiques
3 Russian Quantum Center

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.

Domaines: Physique [physics]

E. O. Kiktenko, A. S. Nikolaeva, Peng Xu, G. V. Shlyapnikov, A. K. Fedorov. Scalable quantum computing with qudits on a graph. Physical Review A, 2020, 101 (2), ⟨10.1103/PhysRevA.101.022304⟩. ⟨hal-02512218⟩