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 Letters

Implementation of the quantum order-finding algorithm on two qudits

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

Published May 1, 2008• 7 citations
Publisher

Abstract

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.

DOI
10.1134/s0021364008060143

Related papers

Implementation of a quantum adiabatic algorithm for factorization on two qudits

V. E. Zobov, Alexander S. Ermilov

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

Journal of Experimental and Theoretical Physics•Jun 1, 2012•14 citations

Use of quadrupolar nuclei for quantum-information processing by nuclear magnetic resonance: Implementation of a quantum algorithm

Ranabir Das, Anil Kumar

Physical implementation of quantum-information processing by liquid-state nuclear magnetic resonance, using weakly coupled spin-$\frac{1}{2}$ nuclei of a molecule, is well established. Nuclei with $\mathrm{spin}>1/2$ oriented in liquid-crystalline matrices is another possibility. Such systems have multiple qubits per nuclei and large quadrupolar couplings resulting in well separated lines in the spectrum. So far, creation of pseudopure states and logic gates has been demonstrated in such systems using transition selective radio-frequency pulses. In this paper we report two developments. First, we implement a quantum algorithm that needs coherent superposition of states. Second, we use evolution under quadrupolar coupling to implement multiqubit gates. We implement the Deutsch-Jozsa algorithm on a spin-$\frac{3}{2}$ (2 qubit) system. The controlled-NOT operation needed to implement this algorithm has been implemented here by evolution under the quadrupolar Hamiltonian. To the best of our knowledge, this method has been implemented for the first time in quadrupolar systems. Since the quadrupolar coupling is several orders of magnitude greater than the coupling in weakly coupled spin-$\frac{1}{2}$ nuclei, the gate time decreases, increasing the clock speed of the quantum computer.

arXiv:quant-ph/0306100•Physical Review A•Sep 10, 2003•54 citations

QUANTUM INFORMATION PROCESSING BY NMR: PREPARATION OF PSEUDOPURE STATES AND IMPLEMENTATION OF UNITARY OPERATIONS IN A SINGLE-QUTRIT SYSTEM

Ranabir Das, Avik Mitra, Santosh Kumar +1 more

Theoretical Quantum Information Processing (QIP) has matured from the use of qubits to the use of qudits (systems having states >2). Whereas most of the experimental implementations have been performed using qubits, little experimental work has been carried out using qudits as yet. In this paper we demonstrate experimental realization of a qutrit system by nuclear magnetic resonance (NMR), utilizing deuterium (spin-1) nuclei partially oriented in liquid crystalline phase. Preparation of pseudopure states and implementation of unitary operations are demonstrated in this single-qutrit system, using transition selective pulses.

arXiv:quant-ph/0307240•International Journal of Quantum Information•Sep 1, 2003•47 citations

Demonstrating quantum algorithm acceleration with NMR quantum computer

Mikio Nakahara, Yasushi Kondo, Kazuya Hata +1 more

In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this experimentally by taking the two-qubit Grover's algorithm implemented in NMR quantum computations, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for a self-contained quantum algorithm.

arXiv:quant-ph/0405050•Physical Review A•Nov 19, 2004•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•45 citations

Adder on ternary base elements for a quantum computer

V. E. Zobov, D. I. Pekhterev

A circuit consisting of elementary quantum logic operators has been proposed for an adder in the ternary number system. A sequence of RF magnetic field pulses has been found for its implementation by the nuclear magnetic resonance method on a chain of quadrupole nuclei with spin I = 1. The numerical simulation of the adder operation has been performed.

Journal of Experimental and Theoretical Physics Letters•May 1, 2009•13 citations
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.
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).
Physical implementation of quantum-information processing by liquid-state nuclear magnetic resonance, using weakly coupled spin-12\frac{1}{2}21​ nuclei of a molecule, is well established. Nuclei with spin>1/2\mathrm{spin}>1/2spin>1/2 oriented in liquid-crystalline matrices is another possibility. Such systems have multiple qubits per nuclei and large quadrupolar couplings resulting in well separated lines in the spectrum. So far, creation of pseudopure states and logic gates has been demonstrated in such systems using transition selective radio-frequency pulses. In this paper we report two developments. First, we implement a quantum algorithm that needs coherent superposition of states. Second, we use evolution under quadrupolar coupling to implement multiqubit gates. We implement the Deutsch-Jozsa algorithm on a spin-32\frac{3}{2}23​ (2 qubit) system. The controlled-NOT operation needed to implement this algorithm has been implemented here by evolution under the quadrupolar Hamiltonian. To the best of our knowledge, this method has been implemented for the first time in quadrupolar systems. Since the quadrupolar coupling is several orders of magnitude greater than the coupling in weakly coupled spin-12\frac{1}{2}21​ nuclei, the gate time decreases, increasing the clock speed of the quantum computer.
Theoretical Quantum Information Processing (QIP) has matured from the use of qubits to the use of qudits (systems having states >2). Whereas most of the experimental implementations have been performed using qubits, little experimental work has been carried out using qudits as yet. In this paper we demonstrate experimental realization of a qutrit system by nuclear magnetic resonance (NMR), utilizing deuterium (spin-1) nuclei partially oriented in liquid crystalline phase. Preparation of pseudopure states and implementation of unitary operations are demonstrated in this single-qutrit system, using transition selective pulses.
In general, a quantum circuit is constructed with elementary gates, such as one-qubit gates and CNOT gates. It is possible, however, to speed up the execution time of a given circuit by merging those elementary gates together into larger modules, such that the desired unitary matrix expressing the algorithm is directly implemented. We demonstrate this experimentally by taking the two-qubit Grover's algorithm implemented in NMR quantum computations, whose pseudopure state is generated by cyclic permutations of the state populations. This is the first exact time-optimal solution, to our knowledge, obtained for a self-contained quantum algorithm.
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.