22 citations · 66 across the 8 of their papers we have counts for
9 papers
Quantum block encoding for one-pair semiseparable matrices
Giacomo Antonioli, Paola Boito, Gianna M. Del Corso +1
Quantum block encoding (QBE) is a crucial step in the development of most quantum algorithms, as it provides an embedding of a given matrix into a suitable larger unitary matrix. H…
Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications
Anna Bernasconi, Alessandro Berti, Gianna M. Del Corso +2
Quantum computing sets the foundation for new ways of designing algorithms, thanks to the peculiar properties inherited by quantum mechanics. The exploration of this new paradigm f…
Quantum Hitting Time according to a given distribution
P. Boito, G. M. Del Corso
In this work we focus on the notion of quantum hitting time for discrete-time Szegedy quantum walks, compared to its classical counterpart. Under suitable hypotheses, quantum hitti…
Fast QR iterations for unitary plus low rank matrices
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
Some fast algorithms for computing the eigenvalues of a block companion matrix , where is unitary block circulant and $X, Y \in\mathbb{C}…
Adaptive Nonnegative Matrix Factorization and Measure Comparisons for Recommender Systems
Gianna M. Del Corso, Francesco Romani
The Nonnegative Matrix Factorization (NMF) of the rating matrix has shown to be an effective method to tackle the recommendation problem. In this paper we propose new methods based…
A multi-class approach for ranking graph nodes: models and experiments with incomplete data
Gianna M. Del Corso, Francesco Romani
After the phenomenal success of the PageRank algorithm, many researchers have extended the PageRank approach to ranking graphs with richer structures beside the simple linkage stru…
A CMV--based eigensolver for companion matrices
Roberto Bevilacqua, Gianna M. Del Corso, Luca gemignani
In this paper we present a novel matrix method for polynomial rootfinding. By exploiting the properties of the QR eigenvalue algorithm applied to a suitable CMV-like form of a comp…
Compression of unitary rank--structured matrices to CMV-like shape with an application to polynomial rootfinding
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
This paper is concerned with the reduction of a unitary matrix U to CMV-like shape. A Lanczos--type algorithm is presented which carries out the reduction by computing the block tr…
Block Tridiagonal Reduction of Perturbed Normal and Rank Structured Matrices
Roberto Bevilacqua, Gianna M. Del Corso, Luca Gemignani
It is well known that if a matrix solves the matrix equation , where is a linear bivariate polynomial, then is normal; and…