Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Experimental and Theoretical Physics

Implementation of a quantum adiabatic algorithm for factorization on two qudits

V. E. Zobov, Alexander S. Ermilov

Published Jun 1, 2012• 14 citations
Publisher

Abstract

Implementation of an adiabatic quantum algorithm for factorization on two qudits with the number of levels d 1 and d 2 is considered. A method is proposed for obtaining a time-dependent effective Hamiltonian by means of a sequence of rotation operators that are selective with respect to the transitions between neighboring levels of a qudit. A sequence of RF magnetic field pulses is obtained, and a factorization of the numbers 35, 21, and 15 is numerically simulated on two quadrupole nuclei with spins 3/2 (d 1 = 4) and 1 (d 2 = 3).

DOI
10.1134/s106377611205007x

Related papers

Implementation of the quantum order-finding algorithm on two qudits

V. E. Zobov, V. P. Shauro, Alexander S. Ermilov

A quantum circuit has been proposed for the algorithm for finding the permutation order on two qudits with the number of levels d 1 and d 2. The sequence of the RF pulses for implementing the algorithm on two quadrupole nuclei I 1 = 7/2 (d 1 = 8) and I 2 = 3/2 (d 2 = 4) has been calculated and the algorithm has been numerically simulated. A method for preparing pseudopure states has been presented. A comparison with the implementation of the algorithm by NMR methods on five qubits has been performed.

Journal of Experimental and Theoretical Physics Letters•May 1, 2008•7 citations

Effect of a phase factor on the minimum time of a quantum gate

V. E. Zobov, V. P. Shauro

A relationship between the phase factor of a quantum gate, the layout of energy levels of its effective Hamiltonian, and the implementation time of the gate is demonstrated. By an example of the direct and inverse quantum Fourier transforms (QFT) gates for a qutrit represented by a quadrupole nucleus with spin I = 1, as well as for a system of two qubits ( I = 1/2), effective Hamiltonians and minimum implementation times corresponding to different global phases are obtained. Implementation schemes are proposed for these Hamiltonians by the nuclear magnetic resonance (NMR) technique with the use of sequences of radio-frequency (RF) pulses separated by intervals of free evolution. Analytic results for the minimum times of gates are in agreement with the results obtained by numerical optimization methods. The phase considered is divided into dynamic and geometric parts.

Journal of Experimental and Theoretical Physics•Jan 1, 2014•2 citations

Representation of the quantum Fourier transform on multilevel basic elements by a sequence of selective rotation operators

Alexander S. Ermilov, V. E. Zobov

To experimentally realize quantum computations on d -level basic elements (qudits) at d > 2, it is necessary to develop schemes for the technical realization of elementary logical operators. We have found sequences of selective rotation operators that represent the operators of the quantum Fourier transform (Walsh-Hadamard matrices) for d = 3–10. For the prime numbers 3, 5, and 7, the well-known method of linear algebra is applied, whereas, for the factorable numbers 6, 9, and 10, the representation of virtual spins is used (which we previously applied for d = 4, 8). Selective rotations can be realized, for example, by means of pulses of an RF magnetic field for systems of quadrupole nuclei or laser pulses for atoms and ions in traps.

Optics and Spectroscopy•Dec 1, 2007•8 citations

Efficient realization of quantum algorithms with qudits

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

Abstract 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.

arXiv:2111.04384•EPJ Quantum Technology•Jun 26, 2024•64 citations

High-fidelity adiabatic quantum computation using the intrinsic Hamiltonian of a spin system: Application to the experimental factorization of 291311

Zhaokai Li, Nikesh S. Dattani, Chen, Xi +6 more

In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic passage. However, this approach had issues with the precision of the effective Hamiltonian and with the adiabaticity of the evolution. In order to address these, we here propose and experimentally demonstrate a novel scheme for adiabatic quantum computation by using the intrinsic Hamiltonian of a realistic spin system to represent the problem Hamiltonian while adiabatically driving the system by an extrinsic Hamiltonian directly induced by electromagnetic pulses. In comparison to the conventional method, we observed two advantages of our approach: improved ease of implementation and higher fidelity. As a showcase example of our approach, we experimentally factor 291311, which is larger than any other quantum factorization known.

arXiv:1706.08061•Jun 25, 2017•34 citations

Transition-Aware Decomposition of Single-Qudit Gates

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

Quantum computation with d-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 d(d−1)/2 for an arbitrary single-qudit operation. For specific operations, the algorithm could produce even fewer pulses. We provide a comparison of qudit decompositions for several types of trapped ions, specifically Yb+171, Ba+137 and Ca+40 with different selection rules, and also decomposition for superconducting qudits. Although our approach deals with single-qudit operations, the proposed approach is important for realizing two-qudit operations since they can be implemented as a standard two-qubit gate that is surrounded by efficiently implemented single-qudit gates.

arXiv:2510.25561•Entropy•Dec 31, 2025•3 citations
Implementation of an adiabatic quantum algorithm for factorization on two qudits with the number of levels d 1 and d 2 is considered. A method is proposed for obtaining a time-dependent effective Hamiltonian by means of a sequence of rotation operators that are selective with respect to the transitions between neighboring levels of a qudit. A sequence of RF magnetic field pulses is obtained, and a factorization of the numbers 35, 21, and 15 is numerically simulated on two quadrupole nuclei with spins 3/2 (d 1 = 4) and 1 (d 2 = 3).
A quantum circuit has been proposed for the algorithm for finding the permutation order on two qudits with the number of levels d 1 and d 2. The sequence of the RF pulses for implementing the algorithm on two quadrupole nuclei I 1 = 7/2 (d 1 = 8) and I 2 = 3/2 (d 2 = 4) has been calculated and the algorithm has been numerically simulated. A method for preparing pseudopure states has been presented. A comparison with the implementation of the algorithm by NMR methods on five qubits has been performed.
A relationship between the phase factor of a quantum gate, the layout of energy levels of its effective Hamiltonian, and the implementation time of the gate is demonstrated. By an example of the direct and inverse quantum Fourier transforms (QFT) gates for a qutrit represented by a quadrupole nucleus with spin I = 1, as well as for a system of two qubits ( I = 1/2), effective Hamiltonians and minimum implementation times corresponding to different global phases are obtained. Implementation schemes are proposed for these Hamiltonians by the nuclear magnetic resonance (NMR) technique with the use of sequences of radio-frequency (RF) pulses separated by intervals of free evolution. Analytic results for the minimum times of gates are in agreement with the results obtained by numerical optimization methods. The phase considered is divided into dynamic and geometric parts.
To experimentally realize quantum computations on d -level basic elements (qudits) at d > 2, it is necessary to develop schemes for the technical realization of elementary logical operators. We have found sequences of selective rotation operators that represent the operators of the quantum Fourier transform (Walsh-Hadamard matrices) for d = 3–10. For the prime numbers 3, 5, and 7, the well-known method of linear algebra is applied, whereas, for the factorable numbers 6, 9, and 10, the representation of virtual spins is used (which we previously applied for d = 4, 8). Selective rotations can be realized, for example, by means of pulses of an RF magnetic field for systems of quadrupole nuclei or laser pulses for atoms and ions in traps.
Abstract 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.
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic passage. However, this approach had issues with the precision of the effective Hamiltonian and with the adiabaticity of the evolution. In order to address these, we here propose and experimentally demonstrate a novel scheme for adiabatic quantum computation by using the intrinsic Hamiltonian of a realistic spin system to represent the problem Hamiltonian while adiabatically driving the system by an extrinsic Hamiltonian directly induced by electromagnetic pulses. In comparison to the conventional method, we observed two advantages of our approach: improved ease of implementation and higher fidelity. As a showcase example of our approach, we experimentally factor 291311, which is larger than any other quantum factorization known.
Quantum computation with d-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 d(d−1)/2 for an arbitrary single-qudit operation. For specific operations, the algorithm could produce even fewer pulses. We provide a comparison of qudit decompositions for several types of trapped ions, specifically Yb+171, Ba+137 and Ca+40 with different selection rules, and also decomposition for superconducting qudits. Although our approach deals with single-qudit operations, the proposed approach is important for realizing two-qudit operations since they can be implemented as a standard two-qubit gate that is surrounded by efficiently implemented single-qudit gates.