classical optimization 1open quantum systems 1quantum simulation 1resource estimation 1trotter-suzuki decomposition 1
From the 1 of 3 linked papers with an AI index.
3 papers
quant-ph2026
Optimising Trotter-Suzuki Simulations of Markovian Open Quantum Systems via Classical Search
S. M. Pillay, I. J. David, I. Sinayskiy +1
The paper derives analytic bounds for first- and second-order deterministic and randomized Trotter‑Suzuki product formulas for simulating Markovian open quantum systems, and introd…
quant-ph2025
Faster Quantum Simulation Of Markovian Open Quantum Systems Via Randomisation
I. J. David, I. Sinayskiy, F. Petruccione
When simulating the dynamics of open quantum systems with quantum computers, it is essential to accurately approximate the system's behaviour while preserving the physicality of it…
quant-ph2025
Tighter Error Bounds for the qDRIFT Algorithm
I. J. David, I. Sinayskiy, F. Petruccione
Randomized algorithms such as qDRIFT provide an efficient framework for quantum simulation by sampling terms from a decomposition of the system's generator. However, existing error…