1 citations · 1 across the 3 of their papers we have counts for
3 papers
Realistic Runtime Analysis for Quantum Simplex Computation
Sabrina Ammann, Maximilian Hess, Debora Ramacciotti +10
In recent years, strong expectations have been raised for the possible power of quantum computing for solving difficult optimization problems, based on theoretical, asymptotic wors…
A simple quantum algorithm to efficiently prepare sparse states
Debora Ramacciotti, Andreea-Iulia Lefterovici, Antonio F. Rotundo
State preparation is a fundamental routine in quantum computation, for which many algorithms have been proposed. Among them, perhaps the simplest one is the Grover-Rudolph algorith…
An entropic uncertainty principle for mixed states
Antonio F. Rotundo, René Schwonnek
The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum in…