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

38 citations · 144 across the 22 of their papers we have counts for

collaborators

24 papers

quant-ph2025

A weighted quantum ensemble of homogeneous quantum classifiers

Emiliano Tolotti, Enrico Blanzieri, Davide Pastorello

Ensemble methods in machine learning aim to improve prediction accuracy by combining multiple models. This is achieved by ensuring diversity among predictors to capture different d…

quant-ph2025

Enhancing Expressivity of Quantum Neural Networks Based on the SWAP test

Sebastian Nagies, Emiliano Tolotti, Davide Pastorello +1

Quantum neural networks (QNNs) based on parametrized quantum circuits are promising candidates for machine learning applications, yet many architectures lack clear connections to c…

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.LG2023★ 4 cited

A general learning scheme for classical and quantum Ising machines

Ludwig Schmid, Enrico Zardini, Davide Pastorello

An Ising machine is any hardware specifically designed for finding the ground state of the Ising model. Relevant examples are coherent Ising machines and quantum annealers. In this…

quant-ph2023★ 4 cited

Scalable quantum neural networks by few quantum resources

Davide Pastorello, Enrico Blanzieri

This paper focuses on the construction of a general parametric model that can be implemented executing multiple swap tests over few qubits and applying a suitable measurement proto…

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…

quant-ph2022

Evaluating the Convergence of Tabu Enhanced Hybrid Quantum Optimization

Enrico Blanzieri, Davide Pastorello, Valter Cavecchia +2

In this paper we introduce the Tabu Enhanced Hybrid Quantum Optimization metaheuristic approach useful for optimization problem solving on a quantum hardware. We address the theore…

cs.ET2022★ 6 cited

Implementation and Empirical Evaluation of a Quantum Machine Learning Pipeline for Local Classification

Enrico Zardini, Enrico Blanzieri, Davide Pastorello

In the current era, quantum resources are extremely limited, and this makes difficult the usage of quantum machine learning (QML) models. Concerning the supervised tasks, a viable…

cs.ET2022★ 2 cited

Reconstructing Bayesian Networks on a Quantum Annealer

Enrico Zardini, Massimo Rizzoli, Sebastiano Dissegna +2

Bayesian networks are widely used probabilistic graphical models, whose structure is hard to learn starting from the generated data. O'Gorman et al. have proposed an algorithm to e…

quant-ph2021

A quantum binary classifier based on cosine similarity

Davide Pastorello, Enrico Blanzieri

We introduce the quantum implementation of a binary classifier based on cosine similarity between data vectors. The proposed quantum algorithm evaluates the classifier on a set of…

quant-ph2020

Geometric viewpoint on the quantization of a fuzzy logic

Davide Pastorello

Within the Hamiltonian framework, the propositions about a classical physical system are described in the Borel σ-algebra of a symplectic manifold (the phase space) where logical c…

quant-ph2020★ 17 cited

Bell inequality violation by entangled single photon states generated from a laser, a LED or a Halogen lamp

M. Pasini, N. Leone, S. Mazzucchi +3

In single-particle or intraparticle entanglement, two degrees of freedom of a single particle, e.g., momentum and polarization of a single photon, are entangled. Single-particle en…

quant-ph2019★ 1 cited

Learning adiabatic quantum algorithms for solving optimization problems

Davide Pastorello, Enrico Blanzieri

An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the s…

math-ph2018

A geometrization of quantum mutual information

Davide Pastorello

It is well known that quantum mechanics admits a geometric formulation on the complex projective space as a Kahler manifold. In this paper we consider the notion of mutual informat…

quant-ph2018★ 31 cited

Quantum Annealing Learning Search for solving QUBO problems

Enrico Blanzieri, Davide Pastorello

In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO proble…

quant-ph2017

A quantum key distribution scheme based on tripartite entanglement and violation of CHSH inequality

Davide Pastorello

Entanglement is a well-known resource in quantum information, in particular it can be exploited for quantum key distribution (QKD). In this paper we define a two-way QKD scheme emp…

physics.gen-ph2015★ 3 cited

Open-loop quantum control as a resource for secure communications

Davide Pastorello

Properties of unitary time evolution of quantum systems can be applied to define quantum cryptographic protocols. Dynamics of a qubit can be exploited as a data encryption/decrypti…

math-ph2015★ 2 cited

A geometric approach to quantum control in projective Hilbert spaces

Davide Pastorello

A quantum theory in a finite-dimensional Hilbert space can be geometrically formulated as a proper Hamiltonian theory as explained in [2, 3, 7, 8]. From this point of view a quantu…

math-ph2014★ 12 cited

A geometric Hamiltonian description of composite quantum systems and quantum entanglement

Davide Pastorello

Finite-dimensional Quantum Mechanics can be geometrically formulated as a proper classical-like Hamiltonian theory in a projective Hilbert space. The description of composite quant…

math-ph2013★ 4 cited

Frame functions in finite-dimensional Quantum Mechanics and its Hamiltonian formulation on complex projective spaces

Valter Moretti, Davide Pastorello

This work concerns some issues about the interplay of standard and geometric (Hamiltonian) approaches to finite-dimensional quantum mechanics, formulated in the projective space. O…

math-ph2012★ 9 cited

Generalized Complex Spherical Harmonics, Frame Functions, and Gleason Theorem

Valter Moretti, Davide Pastorello

Consider a finite dimensional complex Hilbert space $\cH$, with $dim(\cH) \geq 3$, define $\bS(\cH):= \{x\in \cH \:|\: ||x||=1\}$, and let $ν_\cH$ be the unique regular Borel posit…