1 citations · 1 across the 4 of their papers we have counts for
7 papers · 1 filter
Multi-Boundary Many-Body Quantum Teleportation
Tal Schwartzman, Antonio F. Rotundo, Raz Monsonego +1
Unlike standard quantum teleportation, many-body teleportation uses scrambling to transmit quantum information. In this protocol, initially localized information spreads over many…
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…
Effective dynamics from minimising dissipation
Antonio F. Rotundo, Paolo Perinotti, Alessandro Bisio
It is known that the same physical system can be described by different effective theories depending on the scale at which it is observed. In this work, we formulate a prescription…
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…