Leonardo Banchi

Convex optimization of programmable quantum computers

2020 · npj Quantum Information

Abstract A fundamental model of quantum computation is the programmable quantum gate array. This is a quantum processor that is fed by a program state that induces a corresponding quantum operation on input states. While …

Optimal Quantum Spatial Search with One-Dimensional Long-Range Interactions

2020 · arXiv (Cornell University)

Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in O(n) time for n entries. …

Symplectic decomposition from submatrix determinants

2021 · Florence Research (University of Florence)

An important theorem in Gaussian quantum information tells us that we can diagonalize the covariance matrix of any Gaussian state via a symplectic transformation. While the diagonal form is easy to find, the process for …

Solving MNIST with a globally trained Mixture of Quantum Experts

2025 · arXiv (Cornell University)

We propose a new quantum neural network for image classification, which is able to classify the parity of the MNIST dataset with full resolution with a test accuracy of up to 97.5% without any classical …