7 papers
Probabilistic quantum algorithm for Lyapunov equations and matrix inversion
Marcello Benedetti, Ansis Rosmanis, Matthias Rosenkranz
We present a probabilistic quantum algorithm for preparing mixed states which, in expectation, are proportional to the solutions of Lyapunov equations -- linear matrix equations ub…
Provable and Verifiable Quantum Advantage in Sample Complexity
Marcello Benedetti, Harry Buhrman, Jordi Weggemans
Consider a fixed universe of elements and the uniform distribution over elements of some subset of size . Given samples from this distribution, the task of complement sa…
Sparsity-dependent Complexity Lower Bound of Quantum Linear System Solvers
Hitomi Mori, Yuta Kikuchi, Marcello Benedetti +1
Quantum linear system (QLS) solvers are a fundamental class of quantum algorithms used in many potential quantum computing applications, including machine learning and solving diff…
Unconditional and exponentially large violation of classicality
Marcello Benedetti, Gabriel Marin-Sanchez, Jordi Weggemans +2
Testing the predictions of quantum mechanics has been one of the main experimental endeavors for decades. Recent advancements in technology led to a number of demonstrations which…
Measuring Correlation and Entanglement between Molecular Orbitals on a Trapped-Ion Quantum Computer
Gabriel Greene-Diniz, Chris N. Self, Michal Krompiec +4
Quantifying correlation and entanglement between molecular orbitals can elucidate the role of quantum effects in strongly correlated reaction processes. However, accurately storing…
Quantum state preparation for multivariate functions
Matthias Rosenkranz, Eric Brunner, Gabriel Marin-Sanchez +5
A fundamental step of any quantum algorithm is the preparation of qubit registers in a suitable initial state. Often qubit registers represent a discretization of continuous variab…