Skip to Main content Skip to Navigation
Journal articles

Scalable quantum computing with qudits on a graph

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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-02512218
Contributor : Claudine Le Vaou Connect in order to contact the contributor
Submitted on : Thursday, March 19, 2020 - 2:41:36 PM
Last modification on : Wednesday, October 6, 2021 - 3:52:13 PM

Links full text

Identifiers

Collections

Citation

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, American Physical Society 2020, 101 (2), ⟨10.1103/PhysRevA.101.022304⟩. ⟨hal-02512218⟩

Share

Metrics

Record views

372