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

International Conference on Micro- and Nano-Electronics (ICMNE)

Sequences of selective rotation operators for three group clustering on qutrits by means of quantum annealing

V. E. Zobov, I. S. Pichkovskiy

Published Jan 31, 2022• 1 citation
Publisher

Abstract

Recently, it was demonstrated1 that the clustering considered in this articlec, which consists in partitioning a set of data points into subsets depending on the proximity of some properties, can be performed using quantum annealing on a system of two-level quantum elements - qubits. In previous work2, we proposed to pass from qubits to qutrits - three-level quantum elements showed the advantages of such a replacement and obtained a time-dependent effective Hamiltonian. In the present paper, we have found a sequence of selective rotation operators that allows one to realize adiabatic evolution with this effective Hamiltonian in the discrete-time approximation. On five qutrits, represented by spins S = 1, we performed a simulation of clustering a set of six points on a plane into three groups by means of quantum annealing.

DOI
10.1117/12.2622732

Related papers

Clustering by quantum annealing on three-level quantum elements qutrits

V. E. Zobov, I. S. Pichkovskiy

Clustering is grouping of data by the proximity of some properties. We report on the possibility of increasing the efficiency of clustering of points in a plane using artificial quantum neural networks after the replacement of the two-level neurons called qubits represented by the spins S = 1/2 by the three-level neurons called qutrits represented by the spins S = 1. The problem has been solved by the slow adiabatic change of the Hamiltonian in time. The methods for controlling a qutrit system using projection operators have been developed and the numerical simulation has been performed. The Hamiltonians for two well-known cluster-ing methods, one-hot encoding and k-means ++, have been built. The first method has been used to partition a set of six points into three or two clusters and the second method, to partition a set of nine points into three clusters and seven points into four clusters. The simulation has shown that the clustering problem can be ef-fectively solved on qutrits represented by the spins S = 1. The advantages of clustering on qutrits over that on qubits have been demonstrated. In particular, the number of qutrits required to represent data points is smaller than the number of qubits by a factor of log2 N / log3 N . Since, for qutrits, it is easier to partition the data points into three clusters rather than two ones, the approximate hierarchical procedure of data partition-ing into a larger number of clusters is accelerated. At the exact data partition into more than three clusters, it has been proposed to number the clusters by the numbers of states of the corresponding multi-spin subsys-tems, instead of using the numbers of individual spins. This reduces even more the number of qutrits (N log3 K instead of NK ) required to implement the algorithm.

arXiv:2102.09205•Feb 18, 2021•0 citations

Sequences of selective rotation operators to engineer interactions for quantum annealing on three qutrits

V. E. Zobov, I. S. Pichkovskiy

We have done simulating of factorization the number 15 on three qutrits, represented by the spins S = 1, by quantum annealing. We assume that strong one-spin interaction allow selectively operate on different transitions between levels of the each qutrit. We present a sequence of selective rotation operators to engineer from dipole-dipole interaction a time-dependent effective Hamiltonian necessary for solving the problem. Also we find dependence of fidelity versus different parameters: magnetic field, total annealing time, and duration of time step, when the continuous variation of the Hamiltonian is replaced by a discrete one.

arXiv:1903.01135•Mar 4, 2019•0 citations

Sequences of selective rotation operators to engineer interactions for quantum annealing on three qutrits

V. E. Zobov, I. S. Pichkovskiy

We have done simulating of factorization the number 15 on three qutrits, represented by the spins S = 1, by quantum annealing. We assume that strong one-spin interaction allow selectively operate on different transitions between levels of the each qutrit. We present a sequence of selective rotation operators to engineer from dipole-dipole interaction a timedependent effective Hamiltonian necessary for solving the problem. Also we find dependence of fidelity versus different parameters: magnetic field, total annealing time, and duration of time step, when the continuous variation of the Hamiltonian is replaced by a discrete one.

International Conference on Micro- and Nano-Electronics (ICMNE)•Mar 15, 2019•4 citations

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

Sequences of Selective Rotation Operators to Engineer Interactions for Quantum Annealing on Three Qutrits

V. E. Zobov, I. S. Pichkovskiy

Siberian Journal of Physics•Jan 1, 2019•0 citations

Alignment of the amplitudes of stored states for solving the associative memory problem using quantum annealing

Vladimir E. Zobov, Ivan S. Pichkovskiy

The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).

quant-pharXiv:2610.29190•Oct 22, 2026•0 citations
Recently, it was demonstrated1 that the clustering considered in this articlec, which consists in partitioning a set of data points into subsets depending on the proximity of some properties, can be performed using quantum annealing on a system of two-level quantum elements - qubits. In previous work2, we proposed to pass from qubits to qutrits - three-level quantum elements showed the advantages of such a replacement and obtained a time-dependent effective Hamiltonian. In the present paper, we have found a sequence of selective rotation operators that allows one to realize adiabatic evolution with this effective Hamiltonian in the discrete-time approximation. On five qutrits, represented by spins S = 1, we performed a simulation of clustering a set of six points on a plane into three groups by means of quantum annealing.
Clustering is grouping of data by the proximity of some properties. We report on the possibility of increasing the efficiency of clustering of points in a plane using artificial quantum neural networks after the replacement of the two-level neurons called qubits represented by the spins S = 1/2 by the three-level neurons called qutrits represented by the spins S = 1. The problem has been solved by the slow adiabatic change of the Hamiltonian in time. The methods for controlling a qutrit system using projection operators have been developed and the numerical simulation has been performed. The Hamiltonians for two well-known cluster-ing methods, one-hot encoding and k-means ++, have been built. The first method has been used to partition a set of six points into three or two clusters and the second method, to partition a set of nine points into three clusters and seven points into four clusters. The simulation has shown that the clustering problem can be ef-fectively solved on qutrits represented by the spins S = 1. The advantages of clustering on qutrits over that on qubits have been demonstrated. In particular, the number of qutrits required to represent data points is smaller than the number of qubits by a factor of log2 N / log3 N . Since, for qutrits, it is easier to partition the data points into three clusters rather than two ones, the approximate hierarchical procedure of data partition-ing into a larger number of clusters is accelerated. At the exact data partition into more than three clusters, it has been proposed to number the clusters by the numbers of states of the corresponding multi-spin subsys-tems, instead of using the numbers of individual spins. This reduces even more the number of qutrits (N log3 K instead of NK ) required to implement the algorithm.
We have done simulating of factorization the number 15 on three qutrits, represented by the spins S = 1, by quantum annealing. We assume that strong one-spin interaction allow selectively operate on different transitions between levels of the each qutrit. We present a sequence of selective rotation operators to engineer from dipole-dipole interaction a time-dependent effective Hamiltonian necessary for solving the problem. Also we find dependence of fidelity versus different parameters: magnetic field, total annealing time, and duration of time step, when the continuous variation of the Hamiltonian is replaced by a discrete one.
We have done simulating of factorization the number 15 on three qutrits, represented by the spins S = 1, by quantum annealing. We assume that strong one-spin interaction allow selectively operate on different transitions between levels of the each qutrit. We present a sequence of selective rotation operators to engineer from dipole-dipole interaction a timedependent effective Hamiltonian necessary for solving the problem. Also we find dependence of fidelity versus different parameters: magnetic field, total annealing time, and duration of time step, when the continuous variation of the Hamiltonian is replaced by a discrete one.
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).
The solution of combinatorial optimization problems by means of quantum annealing is based on the preparation of an equally superposition state. Such superposition is crucial to the associative memory problem of correctly recalling patterns. In this paper, we study the alignment of the amplitudes of stored states in memory using the proposed auxiliary Hamiltonian, which is switched off at the end of evolution. The results of the algorithm execution were obtained both by numerical modeling and by the perturbation theory method, which made it possible to obtain the dependences on physical parameters in explicit form. As examples, systems of two and three qutrits, represented by spins S=1, are considered. Since the Hamiltonian is expressed in a univer-sal form through projectors onto states stored in memory, it can be used for other quantum sys-tems (platforms).