1 citations · 1 across the 5 of their papers we have counts for
6 papers
CSS codes for Quantum Metrology with Discrete-time Error Correction
Ugnė Liaubaitė, Debora Ramacciotti, Robert Raußendorf
The goal of quantum metrology is to estimate an unknown parameter with better-than-classical precision and, ideally, to attain Heisenberg scaling. In realistic settings, however, n…
Approximate Sparse State Preparation with the Grover-Rudolph Algorithm
Debora Ramacciotti, Martin Steinbach, Bence Temesi +2
Sparse quantum state preparation is a common subroutine in quantum algorithms, where classical data with few nonzero entries must be loaded into a quantum state. In this work, we c…
Beyond asymptotic scaling: Comparing functional quantum linear solvers
Andreea-Iulia Lefterovici, Michael Perk, Debora Ramacciotti +3
Solving systems of linear equations is a key subroutine in many quantum algorithms. In the last 15 years, many quantum linear solvers (QLS) have been developed, competing to achiev…
Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
Paul Christiansen, Lennart Binkowski, Debora Ramacciotti +1
This paper introduces a novel approach to the Quantum Approximate Optimization Algorithm (QAOA), specifically tailored to the knapsack problem. We combine the recently proposed qua…
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…