3 papers
quant-ph2026
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…
quant-ph2025
Quantum Error-Corrected Computation of Molecular Energies
Kentaro Yamamoto, Yuta Kikuchi, David Amaro +18
We present the first demonstration of an end-to-end pipeline with quantum error correction (QEC) for a quantum computation of the electronic structure of molecular systems. We calc…
quant-ph2025
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…