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

DOI10.1007/S11128-022-03482-0MaRDI QIDQ2107103zbMATH OpenOpenAlexFDO

Authors V. E. Zobov, I. S. Pichkovskiy

Publication date 29 November 2022

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.09205

zbMATH Keywords

clusteringquantum annealingqutritquantum adiabatic algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Quantum annealing for combinatorial clustering
• Classifying data using near-term quantum devices
• Balanced \(k\)-means clustering on an adiabatic quantum computer
• A hybrid classical-quantum clustering algorithm based on quantum walks
• scientific article; zbMATH DE number 1691472

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3476629 (Why is no real title available?)
• Adiabatic quantum algorithm for multijet clustering in high energy physics
• Balanced \(k\)-means clustering on an adiabatic quantum computer
• Quantum annealing for combinatorial clustering

Cited in

(3)

• Quantum annealing for combinatorial clustering
• A quantum annealing approach to biclustering
• Scheme for efficient construction of 2-dimensional qutrit cluster state

Describes a project that uses

Uses Software

• k-means++

This page was built for publication: Clustering by quantum annealing on the three-level quantum elements qutrits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107103)