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

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

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•Siberian Journal of Physics•Jan 1, 2019•0 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

Hamiltonian simulation in the Pauli basis of multi-qubit clusters for condensed matter physics

Eduardo L. André, Alexander N. Tsirulev

We propose an efficient method for Hamiltonian simulation of multi-qubit quantum systems with special types of interaction. In our approach, the Hamiltonian of a \(n\)-qubit system should be represented as a linear combination of the standard Pauli basis operators, and then decomposed into a sum of partial Hamiltonians, which are, in general, not Pauli operators and satisfy some anticommutation relations. For three types of Hamiltonians, which are invariant with respect to permutations of qubits, the effectiveness of the main algorithm in the three-qubit cluster model is shown by calculating the operator exponentials for these Hamiltonians in an explicit analytical form. We also calculate the density operator, partition function, entropy, and free energy of the cluster weakly coupled to a thermal environment. In our model, the cluster is in the Gibbs state in the temperature interval \(0.1\!-\!2\:\!\text{K}\), which corresponds to the operating range of modern quantum processors. It follows from our analysis that the thermodynamic properties of such systems strongly depend on the type of internal interaction of qubits in the cluster.

Вестник Российского университета дружбы народов. Серия: Математика, информатика, физика•Sep 12, 2023•0 citations

Clustering by quantum annealing on the three-level quantum elements qutrits

V. E. Zobov, I. S. Pichkovskiy

arXiv:2102.09205•Quantum Information Processing•Apr 1, 2022•5 citations

Hamiltonian formulations of centroid-based clustering

Myeonghwan Seong, Daniel K. Park

Clustering is a fundamental task in data science that aims to group data based on their similarities. However, defining similarity is often ambiguous, making it challenging to determine the most appropriate objective function for a given dataset. Traditional clustering methods, such as the k -means algorithm and weighted maximum k -cut, focus on specific objectives—typically relying on average or pairwise characteristics of the data—leading to performance that is highly data-dependent. Moreover, incorporating practical constraints into clustering objectives is not straightforward, and these problems are known to be NP-hard. In this study, we formulate the clustering problem as a search for the ground state of a Hamiltonian, providing greater flexibility in defining clustering objectives and incorporating constraints. This approach enables the application of various quantum simulation techniques, including both circuit-based quantum computation and quantum annealing, thereby opening a path toward quantum advantage in solving clustering problems. We propose various Hamiltonians to accommodate different clustering objectives, including the ability to combine multiple objectives and incorporate constraints. We evaluate the clustering performance through numerical simulations and implementations on the D-Wave quantum annealer. The results demonstrate the broad applicability of our approach to a variety of clustering problems on current quantum devices. Furthermore, we find that Hamiltonians designed for specific clustering objectives and constraints impose different requirements for qubit connectivity, indicating that certain clustering tasks are better suited to specific quantum hardware. Our experimental results highlight this by identifying the Hamiltonian that optimally utilizes the physical qubits available in the D-Wave System.

arXiv:2502.06542•Frontiers in Physics•Apr 22, 2025•3 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.
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.
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.
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).
We propose an efficient method for Hamiltonian simulation of multi-qubit quantum systems with special types of interaction. In our approach, the Hamiltonian of a nnn-qubit system should be represented as a linear combination of the standard Pauli basis operators, and then decomposed into a sum of partial Hamiltonians, which are, in general, not Pauli operators and satisfy some anticommutation relations. For three types of Hamiltonians, which are invariant with respect to permutations of qubits, the effectiveness of the main algorithm in the three-qubit cluster model is shown by calculating the operator exponentials for these Hamiltonians in an explicit analytical form. We also calculate the density operator, partition function, entropy, and free energy of the cluster weakly coupled to a thermal environment. In our model, the cluster is in the Gibbs state in the temperature interval 0.1 ⁣− ⁣2  ⁣K0.1\!-\!2\:\!\text{K}0.1−2K, which corresponds to the operating range of modern quantum processors. It follows from our analysis that the thermodynamic properties of such systems strongly depend on the type of internal interaction of qubits in the cluster.
Clustering is a fundamental task in data science that aims to group data based on their similarities. However, defining similarity is often ambiguous, making it challenging to determine the most appropriate objective function for a given dataset. Traditional clustering methods, such as the k -means algorithm and weighted maximum k -cut, focus on specific objectives—typically relying on average or pairwise characteristics of the data—leading to performance that is highly data-dependent. Moreover, incorporating practical constraints into clustering objectives is not straightforward, and these problems are known to be NP-hard. In this study, we formulate the clustering problem as a search for the ground state of a Hamiltonian, providing greater flexibility in defining clustering objectives and incorporating constraints. This approach enables the application of various quantum simulation techniques, including both circuit-based quantum computation and quantum annealing, thereby opening a path toward quantum advantage in solving clustering problems. We propose various Hamiltonians to accommodate different clustering objectives, including the ability to combine multiple objectives and incorporate constraints. We evaluate the clustering performance through numerical simulations and implementations on the D-Wave quantum annealer. The results demonstrate the broad applicability of our approach to a variety of clustering problems on current quantum devices. Furthermore, we find that Hamiltonians designed for specific clustering objectives and constraints impose different requirements for qubit connectivity, indicating that certain clustering tasks are better suited to specific quantum hardware. Our experimental results highlight this by identifying the Hamiltonian that optimally utilizes the physical qubits available in the D-Wave System.