Scalable quantum computing with qudits on a graph - Archive ouverte HAL Access content directly
Journal Articles Physical Review A Year : 2020

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.

Dates and versions

hal-02512218 , version 1 (19-03-2020)

Identifiers

Cite

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⟩
26 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More