activity
20232026
most citedQudits for decomposing multiqubit gates and realizing quantum algorithms

27 citations · 106 across the 13 of their papers we have counts for

collaborators

13 papers

quant-ph2026

On the local equivalence of trapped-ion two-qudit gates

Nikita V. Semenin, Pavel A. Kamenskikh, Ilia V. Zalivako +2

We derive a necessary condition of the local equivalence between two-qudit gates in terms of singular values of transformed gate matrices. This condition is valid for arbitrary qud…

quant-ph2025

Qudit-native simulation of the Potts model

Maksim A. Gavreev, Evgeniy O. Kiktenko, Aleksey K. Fedorov +1

Simulating entangled, many-body quantum systems is notoriously hard, especially in the case of high-dimensional nature of physical underlying objects. In this work, we propose an a…

quant-ph2025★ 1 cited

Transition-aware decomposition of single-qudit gates

Denis A. Drozhzhin, Evgeniy O. Kiktenko, Aleksey K. Fedorov +1

Quantum computation with -level quantum systems, also known as qudits, benefits from the possibility to use a richer computational space compared to qubits. However, for an arbi…

quant-ph2025

Scalable platform for qudit-based quantum computing using polar molecules

Soleh Kh. Muminov, Evgeniy O. Kiktenko, Anastasiia S. Nikolaeva +4

We propose a scalable qudit-based quantum processor using rotational states of polar molecules. Previously, molecular internal states were used to enlarge Hilbert space, whereas ou…

quant-ph2025

Progress in the development of quantum algorithms and software

Anastasiia S. Nikolaeva, Daria O. Konina, Anatolii V. Antipov +10

A quantum processor, like any computing device, requires the development of both hardware and the necessary set of software solutions, starting with quantum algorithms and ending w…

quant-ph2025★ 1 cited

Experimental factoring integers using fixed-point-QAOA with a trapped-ion quantum processor

Ilia V. Zalivako, Andrey Yu. Chernyavskiy, Anastasiia S. Nikolaeva +10

Factoring integers is considered as a computationally-hard problem for classical methods, whereas there exists polynomial-time Shor's quantum algorithm for solving this task. Howev…