activity
20182025
most citedA quantum k-nearest neighbors algorithm based on the Euclidean distance estimation

38 citations · 57 across the 9 of their papers we have counts for

collaborators
Showing cs.ETShow all

5 papers · 1 filter

cs.ET2025

Consensus ranking by quantum annealing

Daniele Franch, Enrico Zardini, Enrico Blanzieri +1

Consensus ranking is a technique used to derive a single ranking that best represents the preferences of multiple individuals or systems. It aims to aggregate different rankings in…

cs.ET2024★ 7 cited

Local Binary and Multiclass SVMs Trained on a Quantum Annealer

Enrico Zardini, Amer Delilbasic, Enrico Blanzieri +2

Support vector machines (SVMs) are widely used machine learning models (e.g., in remote sensing), with formulations for both classification and regression tasks. In the last years,…

cs.ET2023★ 1 cited

Ensembles of Quantum Classifiers

Emiliano Tolotti, Enrico Zardini, Enrico Blanzieri +1

In the current era, known as Noisy Intermediate-Scale Quantum (NISQ), encoding large amounts of data in the quantum devices is challenging and the impact of noise significantly aff…

cs.ET2023★ 38 cited

A quantum k-nearest neighbors algorithm based on the Euclidean distance estimation

Enrico Zardini, Enrico Blanzieri, Davide Pastorello

The k-nearest neighbors (k-NN) is a basic machine learning (ML) algorithm, and several quantum versions of it, employing different distance metrics, have been presented in the last…

cs.ET2022★ 3 cited

Quantum Annealing Learning Search Implementations

Andrea Bonomi, Thomas De Min, Enrico Zardini +3

This paper presents the details and testing of two implementations (in C++ and Python) of the hybrid quantum-classical algorithm Quantum Annealing Learning Search (QALS) on a D-Wav…