Realizing quantum gates with optically addressable 
<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mmultiscripts><mml:mi>Yb</mml:mi><mml:none /><mml:mo>+</mml:mo><mml:mprescripts /><mml:none /><mml:mn>171</mml:mn></mml:mmultiscripts></mml:math>
 ion qudits

Aksenov, M. A.; Zalivako, I. V.; Semerikov, I. A.; Борисенко, А. С.; Semenin, N. V.; Sidorov, Pavel; Fedorov, Aleksey K.; Khabarova, K. Yu.; Kolachevsky, N. N.

doi:10.1103/physreva.107.052612

Cited by 13 publications

(4 citation statements)

References 104 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the approaches for making this two-qudit gate is to employ the original two-qubit gate (used within the qubit-based architecture), yet considered in the full qudit state space. We note that this approach has been successfully demonstrated in experiments with trapped ions, and it has been shown that the resulting gate fidelities are comparable with the ones for corresponding qubit-based architectures [61,62].…”

Section: Figurementioning

confidence: 62%

“…Knowing the exact coupling map between levels, single-qudit operations can be easily reformulated in terms of accessible transitions. This is the case for superconducting [77,78], ion-based [43,61,62], and neutral-atom-based [60] qudits. Moreover, in real existing experimental setups, transitions within a given coupling graph are usually addressed with a single laser.…”

Section: Qudit-based Transpilationmentioning

confidence: 99%

“…tally . The most recent result is the pioneering realization of universal multi-qudit processors with trapped ions [61][62][63], superconducting [59,64] and optical systems [65].…”

mentioning

confidence: 99%

See 2 more Smart Citations

Efficient realization of quantum algorithms with qudits

Nikolaeva,

Kiktenko,

Fedorov

2024

EPJ Quantum Technol.

View full text Add to dashboard Cite

The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits). Our method uses a transpilation of a circuit in the standard qubit form, which depends on the characteristics of a qudit-based processor, such as the number of available qudits and the number of accessible levels. This approach provides a qubit-to-qudit mapping and comparison to a standard realization of quantum algorithms highlighting potential advantages of qudits. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set. We then illustrate our method by considering an example of an efficient implementation of a 6-qubit quantum algorithm with qudits. In this particular example, we demonstrate how using qudits allows a decreasing amount of two-body interactions in the qubit circuit implementation. We expect that our findings are of relevance for ongoing experiments with noisy intermediate-scale quantum devices that operate with information carriers allowing qudit encodings, such as trapped ions and neutral atoms, as well as optical and solid-state systems.

show abstract

Section: Figurementioning

confidence: 62%

Section: Qudit-based Transpilationmentioning

confidence: 99%

See 1 more Smart Citation

Efficient realization of quantum algorithms with qudits

Nikolaeva,

Kiktenko,

Fedorov

2024

EPJ Quantum Technol.

View full text Add to dashboard Cite

show abstract

“…The main motivation for choosing qudits over qubits is to avoid truncating naturally higher dimensional quantum systems into qubits [1,2]. Single-and multi-qudit experiments use photons [3][4][5][6][7][8][9][10][11][12], trapped ions [13][14][15][16][17][18], superconducting qudits [19][20][21][22][23][24], dopants in silicon [25], ultracold atoms [26], and spin systems [27,28]. Qudits systems are currently in use in quantum communication [29], quantum teleportation [30,31], quantum memories [32,33], Bell-state measurements [34], study of spin chains [5,12,31,[34][35][36], in enhancing quantum error correction techniques [37,38], in encoding qubits [39] and qudits [40], simulations of many-body systems [41], quantum key distribution [42]…”

Section: Introductionmentioning

confidence: 99%

Randomised benchmarking for universal qudit gates

Amaro-Alcalá,

Sanders,

de Guise

2024

New J. Phys.

View full text Add to dashboard Cite

We aim to establish a scalable scheme for characterising diagonal non-Clifford gatesfor single- and multi-qudit systems; d is a prime-power integer.By employing cyclic operators and a qudit T gate,we generalise the dihedral benchmarking scheme for single- and multi-quditcircuits.Our results establish a path for experimentally benchmarking qudit systems andare of theoretical and experimental interest because our scheme is optimal insofar as it does not require preparation of the full qudit Cliffordgate set to characterise a non-Clifford gate.Moreover, combined with Clifford randomised benchmarking, our scheme is useful to characterise the generators of a universal gate set.

show abstract