Transition-Aware Decomposition of Single-Qudit Gates
Denis A. Drozhzhin, Evgeniy O. Kiktenko, Aleksey K. Fedorov, Anastasiia S. Nikolaeva

TL;DR
This paper introduces an efficient algorithm for decomposing single-qudit gates into native pulses respecting selection rules, optimizing the number of pulses needed for various qudit platforms, which is crucial for scalable quantum computing.
Contribution
The paper presents a resource-efficient algorithm for decomposing single-qudit gates into minimal pulses, considering specific selection rules of different qudit hardware platforms.
Findings
Maximum of d(d-1)/2 pulses for arbitrary single-qudit operations
Fewer pulses possible for specific operations and platforms
Applicable to various qudit systems like trapped ions and superconducting qudits
Abstract
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 arbitrary qudit-based hardware platform, the issue is that a generic qudit operation has to be decomposed into the sequence of native operations pulses that are adjusted to the transitions between two levels in a qudit. Typically, not all levels in a qudit are simply connected to each other due to specific selection rules. Moreover, the number of pulses plays a significant role, since each pulse takes a certain execution time and may introduce error. In this paper, we propose a resource-efficient algorithm to decompose single-qudit operations into the sequence of pulses that are allowed by qudit selection rules. Using the developed algorithm, the number of pulses is at most for an arbitrary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
