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

@article{Zobov2022ClusteringBQ,
title={Clustering by quantum annealing on the three-level quantum elements qutrits},
author={V. E. Zobov and I. S. Pichkovskiy},
journal={Quantum Inf. Process.},
year={2022},
volume={21},
pages={144}
}
• Published 18 February 2021
• Computer Science, Physics
• Quantum Inf. Process.
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…
1 Citations
Sequences of selective rotation operators for three group clustering on qutrits by means of quantum annealing
• Physics
International Conference on Micro- and Nano-Electronics
• 2022
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

## References

SHOWING 1-10 OF 30 REFERENCES
Associative memory on qutrits by means of quantum annealing
• Physics
Quantum Inf. Process.
• 2020
This paper studies the function of associative memory using three-level quantum elements—qutrits, represented by spins with S  = 1, and recalls the state corresponding to one of the patterns recorded in the memory, or superposition of such states by means of quantum annealing.
Qudits and High-Dimensional Quantum Computing
• Physics
Frontiers in Physics
• 2020
This review provides an overview of qudit-based quantum computing covering a variety of topics ranging from circuit building, algorithm design, to experimental methods and various physical realizations for qudit computation.
Qubit-efficient encoding schemes for binary optimisation problems
• Computer Science
Quantum
• 2021
A set of variational quantum algorithms for solving quadratic unconstrained binary optimization problems where a problem consisting of classical variables can be implemented on $\mathcal O(\log n_c)$ number of qubits is proposed and analyzed.
On time-optimal NMR control of states of qutrits represented by quadrupole nuclei with the spin I = 1
• Physics
• 2011
Elementary logical operators (selective rotation, Fourier transform, controllable phase shift, and SUM gate) are considered for a quantum computer based on three-level systems (qutrits) represented
Small quantum computers and large classical data sets
This work introduces hybrid classical-quantum algorithms for problems involving a large classical data set X and a space of models Y such that a quantum computer has superposition access to Y but not X that yields quantum speedups for maximum likelihood estimation, Bayesian inference and saddle-point optimization.
Sequences of selective rotation operators to engineer interactions for quantum annealing on three qutrits
• Physics
International Conference on Micro- and Nano-Electronics
• 2019
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
Quantum algorithms for jet clustering
• Computer Science, Physics
Physical Review D
• 2020
This work considers the possibility of using quantum computers to speed up jet clustering algorithms and identifies a well-known event shape called thrust whose optimum corresponds to the most jetlike separating plane among a set of particles, thereby defining two hemisphere jets.
Quantum annealing for combinatorial clustering
• Computer Science
Quantum Inf. Process.
• 2018
Clustering is a powerful machine learning technique that groups “similar” data points based on their characteristics. Many clustering algorithms work by approximating the minimization of an objective
Implementation of a quantum adiabatic algorithm for factorization on two qudits
• Physics
• 2012
Implementation of an adiabatic quantum algorithm for factorization on two qudits with the number of levels d1 and d2 is considered. A method is proposed for obtaining a time-dependent effective
Quantum-Assisted Clustering Algorithms for NISQ-Era Devices
• Computer Science
ArXiv
• 2019
Several hybrid quantum-classical clustering algorithms that can be employed as subroutines on small, NISQ-era devices, and do not require a black-box oracle are developed.