activity
20192022
most citedDecomposing the generalized Toffoli gate with qutrits

44 citations · 99 across the 3 of their papers we have counts for

collaborators

5 papers

quant-ph2022★ 17 cited

Generalized Toffoli gate decomposition using ququints: Towards realizing Grover's algorithm with qudits

Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov

Qubits, which are quantum counterparts of classical bits, are used as basic information units for quantum information processing, whereas underlying physical information carriers,…

quant-ph2021★ 44 cited

Decomposing the generalized Toffoli gate with qutrits

A. S. Nikolaeva, E. O. Kiktenko, A. K. Fedorov

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…

quant-ph2021★ 38 cited

Efficient realization of quantum algorithms with qudits

Anastasiia S. Nikolaeva, Evgeniy O. Kiktenko, Aleksey K. Fedorov

The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and techn…

quant-ph2019

Quantum soft filtering for the improved security analysis of the coherent one-way quantum-key-distribution protocol

D. A. Kronberg, A. S. Nikolaeva, Y. V. Kurochkin +1

A precise security analysis of practical quantum key distribution (QKD) systems is an important step for improving their performance. Here we consider a class of quantum soft filte…

quant-ph2019

Scalable quantum computing with qudits on a graph

E. O. Kiktenko, A. S. Nikolaeva, Peng Xu +2

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 b…