activity
20182026
most citedQuantum Clustering with k-Means: a Hybrid Approach

46 citations · 46 across the 3 of their papers we have counts for

collaborators

5 papers

quant-ph2026

Block encoding of semiseparable matrices via their generators

Giacomo Antonioli, Gianna M. Del Corso, Roel Van Beeumen

We present an explicit quantum circuit that constructs a block encoding of a generator-representable semiseparable (one-pair) matrix directly from its two generators. For an $N\tim…

quant-ph2026

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Giacomo Antonioli, Anna Bernasconi, Alessandro Berti +2

Matrix chain multiplication -- computing where -- arises in scientific computing, machine lear…

quant-ph2022★ 46 cited

Quantum Clustering with k-Means: a Hybrid Approach

Alessandro Poggiali, Alessandro Berti, Anna Bernasconi +2

Quantum computing is a promising paradigm based on quantum theory for performing fast computations. Quantum algorithms are expected to surpass their classical counterparts in terms…

math.NA2021

Orthogonal iterations on Structured Pencils

Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani

We present a class of fast subspace tracking algorithms based on orthogonal iterations for structured matrices/pencils that can be represented as small rank perturbations of unitar…

math.NA2018

When is a matrix unitary or Hermitian plus low rank?

Gianna M. Del Corso, Federico Poloni, Leonardo Robol +1

Hermitian and unitary matrices are two representatives of the class of normal matrices whose full eigenvalue decomposition can be stably computed in quadratic computing com plexity…